/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_10-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-86f66a4 [2020-07-07 10:57:20,878 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-07 10:57:20,881 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-07 10:57:20,893 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-07 10:57:20,894 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-07 10:57:20,895 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-07 10:57:20,896 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-07 10:57:20,898 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-07 10:57:20,899 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-07 10:57:20,900 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-07 10:57:20,901 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-07 10:57:20,902 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-07 10:57:20,902 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-07 10:57:20,903 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-07 10:57:20,904 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-07 10:57:20,905 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-07 10:57:20,906 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-07 10:57:20,907 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-07 10:57:20,908 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-07 10:57:20,910 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-07 10:57:20,911 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-07 10:57:20,912 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-07 10:57:20,913 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-07 10:57:20,914 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-07 10:57:20,918 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-07 10:57:20,918 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-07 10:57:20,919 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-07 10:57:20,919 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-07 10:57:20,920 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-07 10:57:20,921 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-07 10:57:20,921 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-07 10:57:20,922 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-07 10:57:20,922 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-07 10:57:20,923 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-07 10:57:20,924 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-07 10:57:20,924 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-07 10:57:20,925 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-07 10:57:20,925 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-07 10:57:20,925 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-07 10:57:20,926 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-07 10:57:20,926 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-07 10:57:20,927 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-07 10:57:20,941 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-07 10:57:20,942 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-07 10:57:20,943 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-07 10:57:20,943 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-07 10:57:20,943 INFO L138 SettingsManager]: * Use SBE=true [2020-07-07 10:57:20,943 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-07 10:57:20,944 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-07 10:57:20,944 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-07 10:57:20,944 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-07 10:57:20,944 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-07 10:57:20,944 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-07 10:57:20,945 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-07 10:57:20,945 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-07 10:57:20,945 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-07 10:57:20,945 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-07 10:57:20,945 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-07 10:57:20,945 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-07 10:57:20,946 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-07 10:57:20,946 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-07 10:57:20,946 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-07 10:57:20,946 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-07 10:57:20,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 10:57:20,947 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-07 10:57:20,947 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-07 10:57:20,947 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-07 10:57:20,947 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-07 10:57:20,947 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-07 10:57:20,948 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-07 10:57:20,948 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-07 10:57:20,948 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-07 10:57:21,266 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-07 10:57:21,277 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-07 10:57:21,281 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-07 10:57:21,282 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-07 10:57:21,282 INFO L275 PluginConnector]: CDTParser initialized [2020-07-07 10:57:21,283 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-07-07 10:57:21,341 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fae4e78b8/44cd383ab720496f975a0caf91cb4ba5/FLAG044e75e4f [2020-07-07 10:57:21,738 INFO L306 CDTParser]: Found 1 translation units. [2020-07-07 10:57:21,739 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-07-07 10:57:21,745 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fae4e78b8/44cd383ab720496f975a0caf91cb4ba5/FLAG044e75e4f [2020-07-07 10:57:22,149 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fae4e78b8/44cd383ab720496f975a0caf91cb4ba5 [2020-07-07 10:57:22,157 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-07 10:57:22,158 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-07 10:57:22,159 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-07 10:57:22,159 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-07 10:57:22,163 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-07 10:57:22,163 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 10:57:22" (1/1) ... [2020-07-07 10:57:22,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41ff13ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 10:57:22, skipping insertion in model container [2020-07-07 10:57:22,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 10:57:22" (1/1) ... [2020-07-07 10:57:22,174 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-07 10:57:22,190 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-07 10:57:22,347 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 10:57:22,351 INFO L203 MainTranslator]: Completed pre-run [2020-07-07 10:57:22,366 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 10:57:22,381 INFO L208 MainTranslator]: Completed translation [2020-07-07 10:57:22,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 10:57:22 WrapperNode [2020-07-07 10:57:22,381 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-07 10:57:22,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-07 10:57:22,382 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-07 10:57:22,383 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-07 10:57:22,396 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 10:57:22" (1/1) ... [2020-07-07 10:57:22,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 10:57:22" (1/1) ... [2020-07-07 10:57:22,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 10:57:22" (1/1) ... [2020-07-07 10:57:22,402 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 10:57:22" (1/1) ... [2020-07-07 10:57:22,406 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 10:57:22" (1/1) ... [2020-07-07 10:57:22,408 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 10:57:22" (1/1) ... [2020-07-07 10:57:22,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 10:57:22" (1/1) ... [2020-07-07 10:57:22,411 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-07 10:57:22,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-07 10:57:22,411 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-07 10:57:22,411 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-07 10:57:22,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 10:57:22" (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-07-07 10:57:22,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-07 10:57:22,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-07 10:57:22,578 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-07-07 10:57:22,578 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-07 10:57:22,579 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-07 10:57:22,579 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-07 10:57:22,579 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-07-07 10:57:22,579 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-07 10:57:22,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-07 10:57:22,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-07 10:57:22,753 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-07 10:57:22,753 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-07 10:57:22,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 10:57:22 BoogieIcfgContainer [2020-07-07 10:57:22,757 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-07 10:57:22,758 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-07 10:57:22,758 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-07 10:57:22,761 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-07 10:57:22,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.07 10:57:22" (1/3) ... [2020-07-07 10:57:22,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b8fa48c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 10:57:22, skipping insertion in model container [2020-07-07 10:57:22,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 10:57:22" (2/3) ... [2020-07-07 10:57:22,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b8fa48c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 10:57:22, skipping insertion in model container [2020-07-07 10:57:22,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 10:57:22" (3/3) ... [2020-07-07 10:57:22,764 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2020-07-07 10:57:22,771 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-07 10:57:22,777 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-07 10:57:22,790 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-07 10:57:22,811 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-07 10:57:22,812 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-07 10:57:22,812 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-07 10:57:22,812 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-07 10:57:22,812 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-07 10:57:22,812 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-07 10:57:22,813 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-07 10:57:22,813 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-07 10:57:22,828 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-07 10:57:22,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-07 10:57:22,834 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 10:57:22,835 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 10:57:22,836 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 10:57:22,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 10:57:22,840 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2020-07-07 10:57:22,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 10:57:22,847 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123122] [2020-07-07 10:57:22,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 10:57:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:23,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:23,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 10:57:23,051 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123122] [2020-07-07 10:57:23,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 10:57:23,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 10:57:23,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026627221] [2020-07-07 10:57:23,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 10:57:23,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 10:57:23,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 10:57:23,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-07 10:57:23,076 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-07-07 10:57:23,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 10:57:23,205 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-07-07 10:57:23,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-07 10:57:23,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-07 10:57:23,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 10:57:23,221 INFO L225 Difference]: With dead ends: 35 [2020-07-07 10:57:23,222 INFO L226 Difference]: Without dead ends: 21 [2020-07-07 10:57:23,226 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-07 10:57:23,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-07 10:57:23,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-07 10:57:23,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-07 10:57:23,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-07 10:57:23,276 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-07-07 10:57:23,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 10:57:23,276 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-07 10:57:23,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 10:57:23,277 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-07 10:57:23,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-07 10:57:23,279 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 10:57:23,279 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 10:57:23,279 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-07 10:57:23,280 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 10:57:23,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 10:57:23,280 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2020-07-07 10:57:23,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 10:57:23,281 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079920325] [2020-07-07 10:57:23,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 10:57:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:23,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:23,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 10:57:23,363 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079920325] [2020-07-07 10:57:23,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 10:57:23,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 10:57:23,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523288207] [2020-07-07 10:57:23,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 10:57:23,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 10:57:23,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 10:57:23,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-07 10:57:23,367 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-07-07 10:57:23,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 10:57:23,454 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-07 10:57:23,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-07 10:57:23,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-07 10:57:23,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 10:57:23,458 INFO L225 Difference]: With dead ends: 27 [2020-07-07 10:57:23,459 INFO L226 Difference]: Without dead ends: 23 [2020-07-07 10:57:23,460 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-07 10:57:23,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-07 10:57:23,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-07 10:57:23,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-07 10:57:23,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-07 10:57:23,468 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-07-07 10:57:23,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 10:57:23,469 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-07 10:57:23,469 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 10:57:23,469 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-07 10:57:23,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-07 10:57:23,471 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 10:57:23,471 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 10:57:23,472 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-07 10:57:23,472 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 10:57:23,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 10:57:23,473 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2020-07-07 10:57:23,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 10:57:23,473 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430909721] [2020-07-07 10:57:23,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 10:57:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:23,600 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-07 10:57:23,601 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430909721] [2020-07-07 10:57:23,601 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907590014] [2020-07-07 10:57:23,602 INFO L94 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-07-07 10:57:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:23,653 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-07 10:57:23,660 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 10:57:23,726 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-07 10:57:23,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 10:57:23,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2020-07-07 10:57:23,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987438387] [2020-07-07 10:57:23,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 10:57:23,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 10:57:23,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 10:57:23,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-07 10:57:23,729 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 9 states. [2020-07-07 10:57:23,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 10:57:23,844 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-07-07 10:57:23,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-07 10:57:23,845 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-07 10:57:23,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 10:57:23,846 INFO L225 Difference]: With dead ends: 38 [2020-07-07 10:57:23,847 INFO L226 Difference]: Without dead ends: 23 [2020-07-07 10:57:23,848 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-07-07 10:57:23,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-07 10:57:23,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-07 10:57:23,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-07 10:57:23,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-07-07 10:57:23,855 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-07-07 10:57:23,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 10:57:23,856 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-07-07 10:57:23,856 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 10:57:23,856 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-07-07 10:57:23,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-07 10:57:23,858 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 10:57:23,858 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 10:57:24,073 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-07 10:57:24,074 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 10:57:24,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 10:57:24,075 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2020-07-07 10:57:24,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 10:57:24,075 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158634093] [2020-07-07 10:57:24,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 10:57:24,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:24,235 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-07 10:57:24,235 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158634093] [2020-07-07 10:57:24,236 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071766579] [2020-07-07 10:57:24,236 INFO L94 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-07-07 10:57:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:24,269 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-07 10:57:24,271 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 10:57:24,289 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-07 10:57:24,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 10:57:24,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2020-07-07 10:57:24,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269153120] [2020-07-07 10:57:24,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-07 10:57:24,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 10:57:24,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-07 10:57:24,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-07-07 10:57:24,293 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 8 states. [2020-07-07 10:57:24,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 10:57:24,414 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-07-07 10:57:24,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-07 10:57:24,415 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-07-07 10:57:24,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 10:57:24,419 INFO L225 Difference]: With dead ends: 41 [2020-07-07 10:57:24,419 INFO L226 Difference]: Without dead ends: 37 [2020-07-07 10:57:24,420 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 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-07-07 10:57:24,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-07 10:57:24,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-07 10:57:24,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-07 10:57:24,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-07-07 10:57:24,438 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-07-07 10:57:24,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 10:57:24,439 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-07-07 10:57:24,439 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-07 10:57:24,439 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-07-07 10:57:24,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-07 10:57:24,442 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 10:57:24,443 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 10:57:24,656 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 10:57:24,656 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 10:57:24,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 10:57:24,657 INFO L82 PathProgramCache]: Analyzing trace with hash 146085807, now seen corresponding path program 2 times [2020-07-07 10:57:24,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 10:57:24,658 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628925801] [2020-07-07 10:57:24,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 10:57:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:24,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:24,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:24,828 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-07-07 10:57:24,828 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628925801] [2020-07-07 10:57:24,828 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227462173] [2020-07-07 10:57:24,829 INFO L92 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) [2020-07-07 10:57:24,866 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 10:57:24,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-07 10:57:24,868 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-07 10:57:24,870 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 10:57:24,926 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-07 10:57:24,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 10:57:24,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2020-07-07 10:57:24,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212991087] [2020-07-07 10:57:24,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-07 10:57:24,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 10:57:24,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-07 10:57:24,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-07-07 10:57:24,928 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 13 states. [2020-07-07 10:57:25,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 10:57:25,128 INFO L93 Difference]: Finished difference Result 72 states and 109 transitions. [2020-07-07 10:57:25,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-07 10:57:25,129 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2020-07-07 10:57:25,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 10:57:25,131 INFO L225 Difference]: With dead ends: 72 [2020-07-07 10:57:25,131 INFO L226 Difference]: Without dead ends: 41 [2020-07-07 10:57:25,132 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2020-07-07 10:57:25,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-07 10:57:25,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-07 10:57:25,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-07 10:57:25,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2020-07-07 10:57:25,141 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 40 [2020-07-07 10:57:25,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 10:57:25,141 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2020-07-07 10:57:25,141 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-07 10:57:25,141 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2020-07-07 10:57:25,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-07-07 10:57:25,144 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 10:57:25,144 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 10:57:25,357 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 10:57:25,358 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 10:57:25,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 10:57:25,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1986920854, now seen corresponding path program 3 times [2020-07-07 10:57:25,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 10:57:25,360 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876403893] [2020-07-07 10:57:25,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 10:57:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:25,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:25,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:25,836 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 80 proven. 101 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-07-07 10:57:25,837 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876403893] [2020-07-07 10:57:25,837 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828829450] [2020-07-07 10:57:25,837 INFO L92 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-07-07 10:57:25,873 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2020-07-07 10:57:25,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-07 10:57:25,875 INFO L264 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-07 10:57:25,879 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 10:57:25,921 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 89 proven. 32 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2020-07-07 10:57:25,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 10:57:25,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7] total 17 [2020-07-07 10:57:25,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242328673] [2020-07-07 10:57:25,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-07 10:57:25,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 10:57:25,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-07 10:57:25,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2020-07-07 10:57:25,924 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 17 states. [2020-07-07 10:57:26,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 10:57:26,298 INFO L93 Difference]: Finished difference Result 98 states and 155 transitions. [2020-07-07 10:57:26,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-07 10:57:26,298 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 82 [2020-07-07 10:57:26,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 10:57:26,308 INFO L225 Difference]: With dead ends: 98 [2020-07-07 10:57:26,308 INFO L226 Difference]: Without dead ends: 66 [2020-07-07 10:57:26,312 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2020-07-07 10:57:26,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-07 10:57:26,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2020-07-07 10:57:26,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-07-07 10:57:26,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 87 transitions. [2020-07-07 10:57:26,329 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 87 transitions. Word has length 82 [2020-07-07 10:57:26,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 10:57:26,330 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 87 transitions. [2020-07-07 10:57:26,330 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-07 10:57:26,330 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2020-07-07 10:57:26,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2020-07-07 10:57:26,337 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 10:57:26,337 INFO L422 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 10:57:26,551 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 10:57:26,552 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 10:57:26,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 10:57:26,552 INFO L82 PathProgramCache]: Analyzing trace with hash 706081956, now seen corresponding path program 4 times [2020-07-07 10:57:26,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 10:57:26,553 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449074796] [2020-07-07 10:57:26,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 10:57:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:26,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:26,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:26,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:26,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:26,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:27,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:27,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:27,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:27,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 403 proven. 706 refuted. 0 times theorem prover too weak. 1471 trivial. 0 not checked. [2020-07-07 10:57:27,259 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449074796] [2020-07-07 10:57:27,259 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141283682] [2020-07-07 10:57:27,259 INFO L92 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-07-07 10:57:27,327 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-07 10:57:27,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-07 10:57:27,329 INFO L264 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-07 10:57:27,338 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 10:57:27,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 108 proven. 716 refuted. 0 times theorem prover too weak. 1756 trivial. 0 not checked. [2020-07-07 10:57:27,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 10:57:27,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10] total 22 [2020-07-07 10:57:27,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521111380] [2020-07-07 10:57:27,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-07 10:57:27,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 10:57:27,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-07 10:57:27,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2020-07-07 10:57:27,452 INFO L87 Difference]: Start difference. First operand 63 states and 87 transitions. Second operand 22 states. [2020-07-07 10:57:27,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 10:57:27,994 INFO L93 Difference]: Finished difference Result 142 states and 253 transitions. [2020-07-07 10:57:27,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-07-07 10:57:27,998 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 218 [2020-07-07 10:57:27,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 10:57:28,001 INFO L225 Difference]: With dead ends: 142 [2020-07-07 10:57:28,001 INFO L226 Difference]: Without dead ends: 87 [2020-07-07 10:57:28,005 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=304, Invalid=956, Unknown=0, NotChecked=0, Total=1260 [2020-07-07 10:57:28,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-07-07 10:57:28,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 80. [2020-07-07 10:57:28,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-07-07 10:57:28,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 109 transitions. [2020-07-07 10:57:28,027 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 109 transitions. Word has length 218 [2020-07-07 10:57:28,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 10:57:28,029 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 109 transitions. [2020-07-07 10:57:28,029 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-07 10:57:28,029 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 109 transitions. [2020-07-07 10:57:28,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-07-07 10:57:28,038 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 10:57:28,039 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 10:57:28,251 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-07 10:57:28,257 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 10:57:28,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 10:57:28,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1425621089, now seen corresponding path program 5 times [2020-07-07 10:57:28,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 10:57:28,260 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827774178] [2020-07-07 10:57:28,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 10:57:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:29,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2020-07-07 10:57:29,077 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827774178] [2020-07-07 10:57:29,077 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115310822] [2020-07-07 10:57:29,077 INFO L92 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-07-07 10:57:29,220 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2020-07-07 10:57:29,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-07 10:57:29,224 INFO L264 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-07 10:57:29,233 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 10:57:29,388 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 801 proven. 327 refuted. 0 times theorem prover too weak. 3440 trivial. 0 not checked. [2020-07-07 10:57:29,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 10:57:29,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 19 [2020-07-07 10:57:29,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784208505] [2020-07-07 10:57:29,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-07 10:57:29,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 10:57:29,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-07 10:57:29,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2020-07-07 10:57:29,392 INFO L87 Difference]: Start difference. First operand 80 states and 109 transitions. Second operand 19 states. [2020-07-07 10:57:29,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 10:57:29,650 INFO L93 Difference]: Finished difference Result 173 states and 296 transitions. [2020-07-07 10:57:29,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-07 10:57:29,650 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 286 [2020-07-07 10:57:29,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 10:57:29,654 INFO L225 Difference]: With dead ends: 173 [2020-07-07 10:57:29,654 INFO L226 Difference]: Without dead ends: 104 [2020-07-07 10:57:29,655 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=272, Unknown=0, NotChecked=0, Total=420 [2020-07-07 10:57:29,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-07-07 10:57:29,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 93. [2020-07-07 10:57:29,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-07-07 10:57:29,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 134 transitions. [2020-07-07 10:57:29,669 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 134 transitions. Word has length 286 [2020-07-07 10:57:29,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 10:57:29,670 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 134 transitions. [2020-07-07 10:57:29,670 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-07 10:57:29,670 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 134 transitions. [2020-07-07 10:57:29,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-07-07 10:57:29,681 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 10:57:29,681 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 10:57:29,896 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 10:57:29,897 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 10:57:29,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 10:57:29,897 INFO L82 PathProgramCache]: Analyzing trace with hash -229001048, now seen corresponding path program 6 times [2020-07-07 10:57:29,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 10:57:29,898 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045599519] [2020-07-07 10:57:29,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 10:57:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:30,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:31,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:31,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:31,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:31,439 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 361 proven. 2270 refuted. 0 times theorem prover too weak. 9756 trivial. 0 not checked. [2020-07-07 10:57:31,439 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045599519] [2020-07-07 10:57:31,439 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826315399] [2020-07-07 10:57:31,440 INFO L92 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-07-07 10:57:31,551 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2020-07-07 10:57:31,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-07 10:57:31,553 INFO L264 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-07 10:57:31,561 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 10:57:31,710 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 508 proven. 1816 refuted. 0 times theorem prover too weak. 10063 trivial. 0 not checked. [2020-07-07 10:57:31,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 10:57:31,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 20 [2020-07-07 10:57:31,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272957441] [2020-07-07 10:57:31,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-07 10:57:31,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 10:57:31,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-07 10:57:31,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2020-07-07 10:57:31,714 INFO L87 Difference]: Start difference. First operand 93 states and 134 transitions. Second operand 20 states. [2020-07-07 10:57:32,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 10:57:32,038 INFO L93 Difference]: Finished difference Result 333 states and 537 transitions. [2020-07-07 10:57:32,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-07 10:57:32,039 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 463 [2020-07-07 10:57:32,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 10:57:32,045 INFO L225 Difference]: With dead ends: 333 [2020-07-07 10:57:32,045 INFO L226 Difference]: Without dead ends: 329 [2020-07-07 10:57:32,046 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 598 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=272, Unknown=0, NotChecked=0, Total=420 [2020-07-07 10:57:32,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2020-07-07 10:57:32,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 311. [2020-07-07 10:57:32,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2020-07-07 10:57:32,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 505 transitions. [2020-07-07 10:57:32,085 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 505 transitions. Word has length 463 [2020-07-07 10:57:32,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 10:57:32,086 INFO L479 AbstractCegarLoop]: Abstraction has 311 states and 505 transitions. [2020-07-07 10:57:32,086 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-07 10:57:32,086 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 505 transitions. [2020-07-07 10:57:32,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 859 [2020-07-07 10:57:32,114 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 10:57:32,115 INFO L422 BasicCegarLoop]: trace histogram [125, 125, 101, 62, 62, 62, 62, 62, 62, 62, 39, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 10:57:32,327 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 10:57:32,328 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 10:57:32,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 10:57:32,328 INFO L82 PathProgramCache]: Analyzing trace with hash -840680129, now seen corresponding path program 7 times [2020-07-07 10:57:32,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 10:57:32,329 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343765795] [2020-07-07 10:57:32,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 10:57:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:34,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:36,109 INFO L134 CoverageAnalysis]: Checked inductivity of 43614 backedges. 5753 proven. 5825 refuted. 0 times theorem prover too weak. 32036 trivial. 0 not checked. [2020-07-07 10:57:36,109 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343765795] [2020-07-07 10:57:36,109 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909411921] [2020-07-07 10:57:36,110 INFO L92 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-07-07 10:57:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:36,366 INFO L264 TraceCheckSpWp]: Trace formula consists of 1907 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-07 10:57:36,379 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 10:57:36,807 INFO L134 CoverageAnalysis]: Checked inductivity of 43614 backedges. 699 proven. 5145 refuted. 0 times theorem prover too weak. 37770 trivial. 0 not checked. [2020-07-07 10:57:36,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 10:57:36,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 13] total 33 [2020-07-07 10:57:36,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756924927] [2020-07-07 10:57:36,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-07-07 10:57:36,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 10:57:36,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-07-07 10:57:36,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=836, Unknown=0, NotChecked=0, Total=1056 [2020-07-07 10:57:36,811 INFO L87 Difference]: Start difference. First operand 311 states and 505 transitions. Second operand 33 states. [2020-07-07 10:57:37,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 10:57:37,862 INFO L93 Difference]: Finished difference Result 470 states and 909 transitions. [2020-07-07 10:57:37,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2020-07-07 10:57:37,862 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 858 [2020-07-07 10:57:37,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 10:57:37,868 INFO L225 Difference]: With dead ends: 470 [2020-07-07 10:57:37,868 INFO L226 Difference]: Without dead ends: 173 [2020-07-07 10:57:37,876 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1177 GetRequests, 1119 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1006 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=707, Invalid=2833, Unknown=0, NotChecked=0, Total=3540 [2020-07-07 10:57:37,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-07-07 10:57:37,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 136. [2020-07-07 10:57:37,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-07-07 10:57:37,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 199 transitions. [2020-07-07 10:57:37,902 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 199 transitions. Word has length 858 [2020-07-07 10:57:37,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 10:57:37,905 INFO L479 AbstractCegarLoop]: Abstraction has 136 states and 199 transitions. [2020-07-07 10:57:37,905 INFO L480 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-07-07 10:57:37,906 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 199 transitions. [2020-07-07 10:57:37,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2020-07-07 10:57:37,920 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 10:57:37,921 INFO L422 BasicCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 10:57:38,135 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-07 10:57:38,136 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 10:57:38,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 10:57:38,136 INFO L82 PathProgramCache]: Analyzing trace with hash 452920407, now seen corresponding path program 8 times [2020-07-07 10:57:38,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 10:57:38,137 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672414480] [2020-07-07 10:57:38,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 10:57:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-07 10:57:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-07 10:57:39,129 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-07 10:57:39,129 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-07 10:57:39,130 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-07 10:57:39,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.07 10:57:39 BoogieIcfgContainer [2020-07-07 10:57:39,337 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-07 10:57:39,341 INFO L168 Benchmark]: Toolchain (without parser) took 17181.27 ms. Allocated memory was 143.1 MB in the beginning and 928.0 MB in the end (delta: 784.9 MB). Free memory was 101.3 MB in the beginning and 246.8 MB in the end (delta: -145.5 MB). Peak memory consumption was 639.4 MB. Max. memory is 7.1 GB. [2020-07-07 10:57:39,342 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 143.1 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-07 10:57:39,343 INFO L168 Benchmark]: CACSL2BoogieTranslator took 222.83 ms. Allocated memory is still 143.1 MB. Free memory was 101.1 MB in the beginning and 91.7 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2020-07-07 10:57:39,344 INFO L168 Benchmark]: Boogie Preprocessor took 28.50 ms. Allocated memory is still 143.1 MB. Free memory was 91.7 MB in the beginning and 90.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-07 10:57:39,350 INFO L168 Benchmark]: RCFGBuilder took 346.11 ms. Allocated memory was 143.1 MB in the beginning and 199.8 MB in the end (delta: 56.6 MB). Free memory was 90.3 MB in the beginning and 167.0 MB in the end (delta: -76.7 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-07 10:57:39,355 INFO L168 Benchmark]: TraceAbstraction took 16579.58 ms. Allocated memory was 199.8 MB in the beginning and 928.0 MB in the end (delta: 728.2 MB). Free memory was 166.3 MB in the beginning and 246.8 MB in the end (delta: -80.5 MB). Peak memory consumption was 647.8 MB. Max. memory is 7.1 GB. [2020-07-07 10:57:39,360 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 143.1 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 222.83 ms. Allocated memory is still 143.1 MB. Free memory was 101.1 MB in the beginning and 91.7 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.50 ms. Allocated memory is still 143.1 MB. Free memory was 91.7 MB in the beginning and 90.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 346.11 ms. Allocated memory was 143.1 MB in the beginning and 199.8 MB in the end (delta: 56.6 MB). Free memory was 90.3 MB in the beginning and 167.0 MB in the end (delta: -76.7 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16579.58 ms. Allocated memory was 199.8 MB in the beginning and 928.0 MB in the end (delta: 728.2 MB). Free memory was 166.3 MB in the beginning and 246.8 MB in the end (delta: -80.5 MB). Peak memory consumption was 647.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 10; VAL [x=10] [L25] CALL, EXPR fibo(x) VAL [\old(n)=10] [L6] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L8] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=9] [L6] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L8] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=8] [L6] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L8] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=9, fibo(n-1)=21, n=9] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=9, fibo(n-1)=21, fibo(n-2)=13, n=9] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=10, fibo(n-1)=34, n=10] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=8] [L6] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L8] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=10, fibo(n-1)=34, fibo(n-2)=21, n=10] [L11] return fibo(n-1) + fibo(n-2); [L25] RET, EXPR fibo(x) VAL [fibo(x)=55, x=10] [L25] int result = fibo(x); [L26] COND TRUE result == 55 VAL [result=55, x=10] [L27] __VERIFIER_error() VAL [result=55, x=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.3s, OverallIterations: 11, TraceHistogramMax: 177, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 214 SDtfs, 905 SDslu, 839 SDs, 0 SdLazy, 1710 SolverSat, 998 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2801 GetRequests, 2604 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1712 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=311occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 78 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 5239 NumberOfCodeBlocks, 4941 NumberOfCodeBlocksAsserted, 92 NumberOfCheckSat, 4009 ConstructedInterpolants, 0 QuantifiedInterpolants, 2919331 SizeOfPredicates, 46 NumberOfNonLiveVariables, 3772 ConjunctsInSsa, 92 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 108917/127034 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...