/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 --traceabstraction.assert.codeblocks.term.scoring.heuristic DAGSIZE --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 --traceabstraction.trace.refinement.strategy CAMEL_SMT_AM -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-79ed534 [2020-07-20 03:20:37,979 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 03:20:37,981 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 03:20:37,999 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 03:20:38,000 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 03:20:38,002 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 03:20:38,004 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 03:20:38,014 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 03:20:38,018 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 03:20:38,022 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 03:20:38,022 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 03:20:38,024 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 03:20:38,024 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 03:20:38,026 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 03:20:38,028 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 03:20:38,029 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 03:20:38,031 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 03:20:38,032 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 03:20:38,033 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 03:20:38,039 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 03:20:38,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 03:20:38,049 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 03:20:38,050 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 03:20:38,051 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 03:20:38,054 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 03:20:38,054 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 03:20:38,054 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 03:20:38,057 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 03:20:38,058 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 03:20:38,059 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 03:20:38,059 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 03:20:38,060 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 03:20:38,061 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 03:20:38,061 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 03:20:38,063 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 03:20:38,063 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 03:20:38,064 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 03:20:38,064 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 03:20:38,064 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 03:20:38,065 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 03:20:38,067 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 03:20:38,068 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-20 03:20:38,094 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 03:20:38,094 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 03:20:38,095 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 03:20:38,096 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 03:20:38,096 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 03:20:38,096 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 03:20:38,096 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 03:20:38,096 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 03:20:38,097 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 03:20:38,097 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 03:20:38,097 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 03:20:38,097 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 03:20:38,097 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 03:20:38,098 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 03:20:38,098 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 03:20:38,098 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 03:20:38,098 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 03:20:38,098 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 03:20:38,099 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 03:20:38,099 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 03:20:38,099 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 03:20:38,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 03:20:38,099 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 03:20:38,100 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 03:20:38,100 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 03:20:38,100 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 03:20:38,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 03:20:38,100 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 03:20:38,100 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 03:20:38,101 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> DAGSIZE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> CAMEL_SMT_AM [2020-07-20 03:20:38,397 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 03:20:38,410 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 03:20:38,414 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 03:20:38,415 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 03:20:38,416 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 03:20:38,417 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-20 03:20:38,479 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f63263aec/50ccf025eb3f486984d201083c98d698/FLAG0155f346d [2020-07-20 03:20:38,978 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 03:20:38,980 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-07-20 03:20:38,987 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f63263aec/50ccf025eb3f486984d201083c98d698/FLAG0155f346d [2020-07-20 03:20:39,376 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f63263aec/50ccf025eb3f486984d201083c98d698 [2020-07-20 03:20:39,384 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 03:20:39,387 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 03:20:39,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 03:20:39,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 03:20:39,392 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 03:20:39,393 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 03:20:39" (1/1) ... [2020-07-20 03:20:39,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d385da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:20:39, skipping insertion in model container [2020-07-20 03:20:39,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 03:20:39" (1/1) ... [2020-07-20 03:20:39,403 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 03:20:39,418 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 03:20:39,581 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 03:20:39,586 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 03:20:39,600 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 03:20:39,614 INFO L208 MainTranslator]: Completed translation [2020-07-20 03:20:39,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:20:39 WrapperNode [2020-07-20 03:20:39,615 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 03:20:39,616 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 03:20:39,616 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 03:20:39,616 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 03:20:39,627 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:20:39" (1/1) ... [2020-07-20 03:20:39,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:20:39" (1/1) ... [2020-07-20 03:20:39,632 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:20:39" (1/1) ... [2020-07-20 03:20:39,632 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:20:39" (1/1) ... [2020-07-20 03:20:39,636 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:20:39" (1/1) ... [2020-07-20 03:20:39,638 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:20:39" (1/1) ... [2020-07-20 03:20:39,639 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:20:39" (1/1) ... [2020-07-20 03:20:39,641 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 03:20:39,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 03:20:39,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 03:20:39,641 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 03:20:39,642 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:20:39" (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-20 03:20:39,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 03:20:39,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 03:20:39,812 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-07-20 03:20:39,813 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 03:20:39,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 03:20:39,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 03:20:39,813 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-07-20 03:20:39,815 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 03:20:39,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 03:20:39,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 03:20:39,995 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 03:20:39,995 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-20 03:20:40,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 03:20:39 BoogieIcfgContainer [2020-07-20 03:20:40,000 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 03:20:40,001 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 03:20:40,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 03:20:40,005 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 03:20:40,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 03:20:39" (1/3) ... [2020-07-20 03:20:40,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d6ba73c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 03:20:40, skipping insertion in model container [2020-07-20 03:20:40,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:20:39" (2/3) ... [2020-07-20 03:20:40,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d6ba73c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 03:20:40, skipping insertion in model container [2020-07-20 03:20:40,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 03:20:39" (3/3) ... [2020-07-20 03:20:40,009 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2020-07-20 03:20:40,020 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-20 03:20:40,029 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 03:20:40,043 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 03:20:40,109 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 03:20:40,109 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 03:20:40,109 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-20 03:20:40,110 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 03:20:40,110 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 03:20:40,110 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 03:20:40,110 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 03:20:40,110 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 03:20:40,150 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-20 03:20:40,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-20 03:20:40,158 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:20:40,159 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 03:20:40,159 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:20:40,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:20:40,163 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2020-07-20 03:20:40,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:20:40,171 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362474433] [2020-07-20 03:20:40,171 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@16a2f752 [2020-07-20 03:20:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:40,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:40,356 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-20 03:20:40,357 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362474433] [2020-07-20 03:20:40,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:20:40,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 03:20:40,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872647631] [2020-07-20 03:20:40,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 03:20:40,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:20:40,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 03:20:40,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 03:20:40,377 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-07-20 03:20:40,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:20:40,488 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-07-20 03:20:40,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 03:20:40,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-20 03:20:40,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:20:40,501 INFO L225 Difference]: With dead ends: 35 [2020-07-20 03:20:40,501 INFO L226 Difference]: Without dead ends: 21 [2020-07-20 03:20:40,505 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-20 03:20:40,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-20 03:20:40,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-20 03:20:40,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-20 03:20:40,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-20 03:20:40,546 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-07-20 03:20:40,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:20:40,547 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-20 03:20:40,547 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 03:20:40,547 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-20 03:20:40,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-20 03:20:40,549 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:20:40,550 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 03:20:40,550 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-20 03:20:40,550 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:20:40,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:20:40,551 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2020-07-20 03:20:40,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:20:40,552 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968117610] [2020-07-20 03:20:40,552 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@16a2f752 [2020-07-20 03:20:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:40,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:40,624 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-20 03:20:40,624 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968117610] [2020-07-20 03:20:40,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:20:40,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 03:20:40,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116219239] [2020-07-20 03:20:40,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 03:20:40,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:20:40,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 03:20:40,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 03:20:40,628 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-07-20 03:20:40,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:20:40,688 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-20 03:20:40,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 03:20:40,690 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-20 03:20:40,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:20:40,691 INFO L225 Difference]: With dead ends: 27 [2020-07-20 03:20:40,691 INFO L226 Difference]: Without dead ends: 23 [2020-07-20 03:20:40,693 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-20 03:20:40,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-20 03:20:40,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-20 03:20:40,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-20 03:20:40,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-20 03:20:40,701 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-07-20 03:20:40,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:20:40,702 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-20 03:20:40,702 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 03:20:40,702 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-20 03:20:40,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-20 03:20:40,703 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:20:40,704 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-20 03:20:40,704 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-20 03:20:40,704 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:20:40,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:20:40,705 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2020-07-20 03:20:40,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:20:40,706 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593953049] [2020-07-20 03:20:40,706 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@16a2f752 [2020-07-20 03:20:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:40,849 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-20 03:20:40,849 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593953049] [2020-07-20 03:20:40,850 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176133931] [2020-07-20 03:20:40,850 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3fd27149 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-20 03:20:40,897 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3fd27149 issued 3 check-sat command(s) [2020-07-20 03:20:40,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 03:20:40,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 03:20:40,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 03:20:40,987 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-20 03:20:40,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 03:20:40,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2020-07-20 03:20:40,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517733805] [2020-07-20 03:20:40,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 03:20:40,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:20:40,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 03:20:40,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-20 03:20:40,990 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 9 states. [2020-07-20 03:20:41,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:20:41,111 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-07-20 03:20:41,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-20 03:20:41,112 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-20 03:20:41,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:20:41,114 INFO L225 Difference]: With dead ends: 38 [2020-07-20 03:20:41,114 INFO L226 Difference]: Without dead ends: 23 [2020-07-20 03:20:41,115 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 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-20 03:20:41,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-20 03:20:41,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-20 03:20:41,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-20 03:20:41,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-07-20 03:20:41,124 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-07-20 03:20:41,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:20:41,124 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-07-20 03:20:41,124 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 03:20:41,125 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-07-20 03:20:41,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-20 03:20:41,126 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:20:41,127 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-20 03:20:41,339 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-20 03:20:41,339 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:20:41,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:20:41,340 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2020-07-20 03:20:41,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:20:41,340 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229768177] [2020-07-20 03:20:41,341 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@16a2f752 [2020-07-20 03:20:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:41,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:41,471 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-20 03:20:41,471 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229768177] [2020-07-20 03:20:41,472 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255270962] [2020-07-20 03:20:41,472 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@611d4133 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-20 03:20:41,505 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@611d4133 issued 3 check-sat command(s) [2020-07-20 03:20:41,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 03:20:41,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 03:20:41,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 03:20:41,528 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-20 03:20:41,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 03:20:41,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-07-20 03:20:41,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599288721] [2020-07-20 03:20:41,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-20 03:20:41,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:20:41,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-20 03:20:41,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-20 03:20:41,530 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 7 states. [2020-07-20 03:20:41,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:20:41,629 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-07-20 03:20:41,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-20 03:20:41,630 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-07-20 03:20:41,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:20:41,632 INFO L225 Difference]: With dead ends: 41 [2020-07-20 03:20:41,632 INFO L226 Difference]: Without dead ends: 37 [2020-07-20 03:20:41,633 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-20 03:20:41,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-20 03:20:41,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-20 03:20:41,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-20 03:20:41,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-07-20 03:20:41,644 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-07-20 03:20:41,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:20:41,645 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-07-20 03:20:41,645 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-20 03:20:41,645 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-07-20 03:20:41,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-20 03:20:41,647 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:20:41,647 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-20 03:20:41,861 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 03:20:41,862 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:20:41,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:20:41,864 INFO L82 PathProgramCache]: Analyzing trace with hash 146085807, now seen corresponding path program 2 times [2020-07-20 03:20:41,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:20:41,865 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539294282] [2020-07-20 03:20:41,865 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@16a2f752 [2020-07-20 03:20:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:41,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:42,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:42,058 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-20 03:20:42,058 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539294282] [2020-07-20 03:20:42,059 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191256250] [2020-07-20 03:20:42,059 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@23b8c794 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 03:20:42,091 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@23b8c794 issued 3 check-sat command(s) [2020-07-20 03:20:42,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 03:20:42,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 03:20:42,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 03:20:42,157 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-20 03:20:42,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 03:20:42,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2020-07-20 03:20:42,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61689071] [2020-07-20 03:20:42,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-20 03:20:42,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:20:42,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-20 03:20:42,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-07-20 03:20:42,160 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 12 states. [2020-07-20 03:20:42,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:20:42,392 INFO L93 Difference]: Finished difference Result 72 states and 109 transitions. [2020-07-20 03:20:42,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-20 03:20:42,393 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2020-07-20 03:20:42,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:20:42,395 INFO L225 Difference]: With dead ends: 72 [2020-07-20 03:20:42,396 INFO L226 Difference]: Without dead ends: 41 [2020-07-20 03:20:42,397 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2020-07-20 03:20:42,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-20 03:20:42,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-20 03:20:42,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-20 03:20:42,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2020-07-20 03:20:42,407 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 40 [2020-07-20 03:20:42,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:20:42,408 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2020-07-20 03:20:42,408 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-20 03:20:42,408 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2020-07-20 03:20:42,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-07-20 03:20:42,410 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:20:42,411 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 03:20:42,625 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 03:20:42,626 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:20:42,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:20:42,626 INFO L82 PathProgramCache]: Analyzing trace with hash 2001184551, now seen corresponding path program 3 times [2020-07-20 03:20:42,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:20:42,627 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075595225] [2020-07-20 03:20:42,627 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@16a2f752 [2020-07-20 03:20:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:42,843 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-07-20 03:20:42,843 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075595225] [2020-07-20 03:20:42,843 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447849310] [2020-07-20 03:20:42,844 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4fb8bb5d 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-20 03:20:42,893 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4fb8bb5d issued 3 check-sat command(s) [2020-07-20 03:20:42,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 03:20:42,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-20 03:20:42,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 03:20:42,937 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-07-20 03:20:42,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 03:20:42,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-07-20 03:20:42,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3292832] [2020-07-20 03:20:42,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 03:20:42,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:20:42,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 03:20:42,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-20 03:20:42,940 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 9 states. [2020-07-20 03:20:43,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:20:43,077 INFO L93 Difference]: Finished difference Result 83 states and 114 transitions. [2020-07-20 03:20:43,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-20 03:20:43,077 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2020-07-20 03:20:43,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:20:43,081 INFO L225 Difference]: With dead ends: 83 [2020-07-20 03:20:43,081 INFO L226 Difference]: Without dead ends: 79 [2020-07-20 03:20:43,082 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-07-20 03:20:43,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-07-20 03:20:43,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2020-07-20 03:20:43,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-07-20 03:20:43,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2020-07-20 03:20:43,097 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 68 [2020-07-20 03:20:43,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:20:43,098 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2020-07-20 03:20:43,098 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 03:20:43,098 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2020-07-20 03:20:43,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-07-20 03:20:43,101 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:20:43,101 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 03:20:43,312 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 03:20:43,313 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:20:43,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:20:43,314 INFO L82 PathProgramCache]: Analyzing trace with hash -2068257585, now seen corresponding path program 4 times [2020-07-20 03:20:43,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:20:43,315 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130125626] [2020-07-20 03:20:43,316 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@16a2f752 [2020-07-20 03:20:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:43,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:43,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:43,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:43,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:43,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:43,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:43,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 377 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2020-07-20 03:20:43,805 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130125626] [2020-07-20 03:20:43,805 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735939126] [2020-07-20 03:20:43,805 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7f7ab905 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-20 03:20:43,878 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7f7ab905 issued 3 check-sat command(s) [2020-07-20 03:20:43,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 03:20:43,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-20 03:20:43,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 03:20:43,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 377 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2020-07-20 03:20:43,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 03:20:43,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-07-20 03:20:43,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322371215] [2020-07-20 03:20:43,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 03:20:43,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:20:43,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 03:20:43,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-07-20 03:20:43,938 INFO L87 Difference]: Start difference. First operand 73 states and 101 transitions. Second operand 10 states. [2020-07-20 03:20:44,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:20:44,137 INFO L93 Difference]: Finished difference Result 150 states and 231 transitions. [2020-07-20 03:20:44,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 03:20:44,137 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 150 [2020-07-20 03:20:44,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:20:44,142 INFO L225 Difference]: With dead ends: 150 [2020-07-20 03:20:44,142 INFO L226 Difference]: Without dead ends: 146 [2020-07-20 03:20:44,143 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-07-20 03:20:44,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-07-20 03:20:44,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 137. [2020-07-20 03:20:44,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-07-20 03:20:44,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 214 transitions. [2020-07-20 03:20:44,168 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 214 transitions. Word has length 150 [2020-07-20 03:20:44,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:20:44,169 INFO L479 AbstractCegarLoop]: Abstraction has 137 states and 214 transitions. [2020-07-20 03:20:44,169 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 03:20:44,169 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 214 transitions. [2020-07-20 03:20:44,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2020-07-20 03:20:44,174 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:20:44,174 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-20 03:20:44,387 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-20 03:20:44,388 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:20:44,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:20:44,388 INFO L82 PathProgramCache]: Analyzing trace with hash 706081956, now seen corresponding path program 5 times [2020-07-20 03:20:44,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:20:44,389 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121558470] [2020-07-20 03:20:44,390 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@16a2f752 [2020-07-20 03:20:44,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:44,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:44,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:44,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:44,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:44,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:44,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:44,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:44,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:44,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 432 proven. 761 refuted. 0 times theorem prover too weak. 1387 trivial. 0 not checked. [2020-07-20 03:20:44,964 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121558470] [2020-07-20 03:20:44,964 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479727783] [2020-07-20 03:20:44,964 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7f46c280 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-20 03:20:45,064 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7f46c280 issued 3 check-sat command(s) [2020-07-20 03:20:45,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 03:20:45,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-20 03:20:45,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 03:20:45,256 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-20 03:20:45,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 03:20:45,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 17 [2020-07-20 03:20:45,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539950851] [2020-07-20 03:20:45,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-20 03:20:45,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:20:45,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-20 03:20:45,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-07-20 03:20:45,260 INFO L87 Difference]: Start difference. First operand 137 states and 214 transitions. Second operand 17 states. [2020-07-20 03:20:45,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:20:45,976 INFO L93 Difference]: Finished difference Result 229 states and 428 transitions. [2020-07-20 03:20:45,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-07-20 03:20:45,977 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 218 [2020-07-20 03:20:45,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:20:45,980 INFO L225 Difference]: With dead ends: 229 [2020-07-20 03:20:45,980 INFO L226 Difference]: Without dead ends: 101 [2020-07-20 03:20:45,984 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=286, Invalid=974, Unknown=0, NotChecked=0, Total=1260 [2020-07-20 03:20:45,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-07-20 03:20:45,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2020-07-20 03:20:45,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-07-20 03:20:45,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2020-07-20 03:20:45,998 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 218 [2020-07-20 03:20:45,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:20:45,999 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2020-07-20 03:20:45,999 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-20 03:20:45,999 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2020-07-20 03:20:46,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2020-07-20 03:20:46,005 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:20:46,006 INFO L422 BasicCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 15, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 03:20:46,221 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 03:20:46,222 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:20:46,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:20:46,222 INFO L82 PathProgramCache]: Analyzing trace with hash -530192014, now seen corresponding path program 6 times [2020-07-20 03:20:46,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:20:46,222 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20892766] [2020-07-20 03:20:46,223 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@16a2f752 [2020-07-20 03:20:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:46,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:46,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:46,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:46,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:46,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:46,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:46,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:46,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:46,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:46,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:46,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:47,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:47,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:47,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:47,290 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 1358 proven. 1342 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2020-07-20 03:20:47,290 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20892766] [2020-07-20 03:20:47,290 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111776297] [2020-07-20 03:20:47,291 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7722ee4 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-20 03:20:47,444 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7722ee4 issued 3 check-sat command(s) [2020-07-20 03:20:47,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 03:20:47,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-20 03:20:47,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 03:20:47,598 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 204 proven. 1348 refuted. 0 times theorem prover too weak. 4487 trivial. 0 not checked. [2020-07-20 03:20:47,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 03:20:47,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 19 [2020-07-20 03:20:47,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472694751] [2020-07-20 03:20:47,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-20 03:20:47,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:20:47,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-20 03:20:47,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2020-07-20 03:20:47,602 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand 19 states. [2020-07-20 03:20:48,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:20:48,396 INFO L93 Difference]: Finished difference Result 195 states and 335 transitions. [2020-07-20 03:20:48,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-07-20 03:20:48,396 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 327 [2020-07-20 03:20:48,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:20:48,402 INFO L225 Difference]: With dead ends: 195 [2020-07-20 03:20:48,402 INFO L226 Difference]: Without dead ends: 122 [2020-07-20 03:20:48,404 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=384, Invalid=1422, Unknown=0, NotChecked=0, Total=1806 [2020-07-20 03:20:48,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-07-20 03:20:48,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 108. [2020-07-20 03:20:48,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-07-20 03:20:48,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 155 transitions. [2020-07-20 03:20:48,429 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 155 transitions. Word has length 327 [2020-07-20 03:20:48,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:20:48,430 INFO L479 AbstractCegarLoop]: Abstraction has 108 states and 155 transitions. [2020-07-20 03:20:48,430 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-20 03:20:48,430 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 155 transitions. [2020-07-20 03:20:48,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-07-20 03:20:48,440 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:20:48,440 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-20 03:20:48,653 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 03:20:48,654 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:20:48,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:20:48,655 INFO L82 PathProgramCache]: Analyzing trace with hash -229001048, now seen corresponding path program 7 times [2020-07-20 03:20:48,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:20:48,656 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468692974] [2020-07-20 03:20:48,656 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@16a2f752 [2020-07-20 03:20:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:50,146 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-20 03:20:50,147 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468692974] [2020-07-20 03:20:50,147 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277855331] [2020-07-20 03:20:50,147 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1b3ed079 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-20 03:20:50,279 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1b3ed079 issued 3 check-sat command(s) [2020-07-20 03:20:50,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 03:20:50,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 840 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-20 03:20:50,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 03:20:50,465 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-20 03:20:50,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 03:20:50,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2020-07-20 03:20:50,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485391978] [2020-07-20 03:20:50,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-20 03:20:50,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:20:50,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-20 03:20:50,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2020-07-20 03:20:50,470 INFO L87 Difference]: Start difference. First operand 108 states and 155 transitions. Second operand 13 states. [2020-07-20 03:20:50,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:20:50,773 INFO L93 Difference]: Finished difference Result 373 states and 583 transitions. [2020-07-20 03:20:50,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-20 03:20:50,774 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 463 [2020-07-20 03:20:50,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:20:50,782 INFO L225 Difference]: With dead ends: 373 [2020-07-20 03:20:50,782 INFO L226 Difference]: Without dead ends: 369 [2020-07-20 03:20:50,784 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 598 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=272, Unknown=0, NotChecked=0, Total=420 [2020-07-20 03:20:50,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2020-07-20 03:20:50,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 351. [2020-07-20 03:20:50,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2020-07-20 03:20:50,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 544 transitions. [2020-07-20 03:20:50,835 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 544 transitions. Word has length 463 [2020-07-20 03:20:50,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:20:50,837 INFO L479 AbstractCegarLoop]: Abstraction has 351 states and 544 transitions. [2020-07-20 03:20:50,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-20 03:20:50,837 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 544 transitions. [2020-07-20 03:20:50,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 968 [2020-07-20 03:20:50,877 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:20:50,877 INFO L422 BasicCegarLoop]: trace histogram [141, 141, 114, 70, 70, 70, 70, 70, 70, 70, 44, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 03:20:51,091 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-20 03:20:51,091 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:20:51,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:20:51,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1070302453, now seen corresponding path program 8 times [2020-07-20 03:20:51,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:20:51,093 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095792855] [2020-07-20 03:20:51,094 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@16a2f752 [2020-07-20 03:20:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:53,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:54,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:54,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:54,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:54,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:54,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:54,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:54,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:55,561 INFO L134 CoverageAnalysis]: Checked inductivity of 55581 backedges. 6994 proven. 7521 refuted. 0 times theorem prover too weak. 41066 trivial. 0 not checked. [2020-07-20 03:20:55,561 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095792855] [2020-07-20 03:20:55,562 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167337978] [2020-07-20 03:20:55,562 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@6ed11d56 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 03:20:55,807 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@6ed11d56 issued 3 check-sat command(s) [2020-07-20 03:20:55,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 03:20:55,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 1749 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-20 03:20:55,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 03:20:56,267 INFO L134 CoverageAnalysis]: Checked inductivity of 55581 backedges. 739 proven. 5910 refuted. 0 times theorem prover too weak. 48932 trivial. 0 not checked. [2020-07-20 03:20:56,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 03:20:56,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13] total 23 [2020-07-20 03:20:56,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145236560] [2020-07-20 03:20:56,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-07-20 03:20:56,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:20:56,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-07-20 03:20:56,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2020-07-20 03:20:56,271 INFO L87 Difference]: Start difference. First operand 351 states and 544 transitions. Second operand 23 states. [2020-07-20 03:20:57,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:20:57,381 INFO L93 Difference]: Finished difference Result 509 states and 918 transitions. [2020-07-20 03:20:57,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2020-07-20 03:20:57,382 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 967 [2020-07-20 03:20:57,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:20:57,391 INFO L225 Difference]: With dead ends: 509 [2020-07-20 03:20:57,391 INFO L226 Difference]: Without dead ends: 176 [2020-07-20 03:20:57,395 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1313 GetRequests, 1256 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=681, Invalid=2741, Unknown=0, NotChecked=0, Total=3422 [2020-07-20 03:20:57,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-07-20 03:20:57,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 142. [2020-07-20 03:20:57,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-07-20 03:20:57,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 211 transitions. [2020-07-20 03:20:57,414 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 211 transitions. Word has length 967 [2020-07-20 03:20:57,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:20:57,415 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 211 transitions. [2020-07-20 03:20:57,415 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-07-20 03:20:57,415 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 211 transitions. [2020-07-20 03:20:57,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1499 [2020-07-20 03:20:57,447 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:20:57,448 INFO L422 BasicCegarLoop]: trace histogram [219, 219, 177, 109, 109, 109, 109, 109, 109, 109, 68, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 03:20:57,661 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 03:20:57,662 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:20:57,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:20:57,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1905168074, now seen corresponding path program 9 times [2020-07-20 03:20:57,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:20:57,665 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074782438] [2020-07-20 03:20:57,665 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@16a2f752 [2020-07-20 03:20:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:20:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:00,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:01,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:02,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:03,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:21:05,549 INFO L134 CoverageAnalysis]: Checked inductivity of 134604 backedges. 6680 proven. 13635 refuted. 0 times theorem prover too weak. 114289 trivial. 0 not checked. [2020-07-20 03:21:05,551 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074782438] [2020-07-20 03:21:05,551 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993468147] [2020-07-20 03:21:05,552 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@56ae33d4 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 03:21:06,018 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@56ae33d4 issued 4 check-sat command(s) [2020-07-20 03:21:06,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 03:21:06,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 3328 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-20 03:21:06,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 03:21:06,984 INFO L134 CoverageAnalysis]: Checked inductivity of 134604 backedges. 6930 proven. 4808 refuted. 0 times theorem prover too weak. 122866 trivial. 0 not checked. [2020-07-20 03:21:06,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 03:21:06,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 14] total 26 [2020-07-20 03:21:06,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597755763] [2020-07-20 03:21:06,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-07-20 03:21:06,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:21:06,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-07-20 03:21:06,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2020-07-20 03:21:06,988 INFO L87 Difference]: Start difference. First operand 142 states and 211 transitions. Second operand 26 states. [2020-07-20 03:21:08,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:21:08,534 INFO L93 Difference]: Finished difference Result 346 states and 703 transitions. [2020-07-20 03:21:08,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2020-07-20 03:21:08,535 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 1498 [2020-07-20 03:21:08,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:21:08,540 INFO L225 Difference]: With dead ends: 346 [2020-07-20 03:21:08,541 INFO L226 Difference]: Without dead ends: 190 [2020-07-20 03:21:08,544 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2001 GetRequests, 1936 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1137 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=830, Invalid=3592, Unknown=0, NotChecked=0, Total=4422 [2020-07-20 03:21:08,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2020-07-20 03:21:08,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 164. [2020-07-20 03:21:08,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-07-20 03:21:08,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 225 transitions. [2020-07-20 03:21:08,558 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 225 transitions. Word has length 1498 [2020-07-20 03:21:08,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:21:08,559 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 225 transitions. [2020-07-20 03:21:08,559 INFO L480 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-07-20 03:21:08,559 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 225 transitions. [2020-07-20 03:21:08,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2020-07-20 03:21:08,573 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:21:08,573 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-20 03:21:08,786 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 03:21:08,787 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:21:08,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:21:08,788 INFO L82 PathProgramCache]: Analyzing trace with hash 452920407, now seen corresponding path program 10 times [2020-07-20 03:21:08,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:21:08,789 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352467238] [2020-07-20 03:21:08,789 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@16a2f752 [2020-07-20 03:21:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 03:21:09,235 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 03:21:09,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 03:21:09,541 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 03:21:09,610 INFO L174 FreeRefinementEngine]: Strategy CAMEL_SMT_AM found a feasible trace [2020-07-20 03:21:09,611 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-20 03:21:09,611 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-20 03:21:09,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 03:21:09 BoogieIcfgContainer [2020-07-20 03:21:09,773 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 03:21:09,775 INFO L168 Benchmark]: Toolchain (without parser) took 30389.12 ms. Allocated memory was 146.8 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 103.6 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 621.5 MB. Max. memory is 7.1 GB. [2020-07-20 03:21:09,776 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 146.8 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-20 03:21:09,776 INFO L168 Benchmark]: CACSL2BoogieTranslator took 227.62 ms. Allocated memory is still 146.8 MB. Free memory was 103.1 MB in the beginning and 93.5 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-20 03:21:09,777 INFO L168 Benchmark]: Boogie Preprocessor took 24.97 ms. Allocated memory is still 146.8 MB. Free memory was 93.5 MB in the beginning and 92.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-07-20 03:21:09,778 INFO L168 Benchmark]: RCFGBuilder took 359.00 ms. Allocated memory was 146.8 MB in the beginning and 203.9 MB in the end (delta: 57.1 MB). Free memory was 92.1 MB in the beginning and 171.6 MB in the end (delta: -79.5 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-20 03:21:09,779 INFO L168 Benchmark]: TraceAbstraction took 29771.53 ms. Allocated memory was 203.9 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 171.6 MB in the beginning and 1.1 GB in the end (delta: -950.9 MB). Peak memory consumption was 632.4 MB. Max. memory is 7.1 GB. [2020-07-20 03:21:09,782 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.21 ms. Allocated memory is still 146.8 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 227.62 ms. Allocated memory is still 146.8 MB. Free memory was 103.1 MB in the beginning and 93.5 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.97 ms. Allocated memory is still 146.8 MB. Free memory was 93.5 MB in the beginning and 92.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 359.00 ms. Allocated memory was 146.8 MB in the beginning and 203.9 MB in the end (delta: 57.1 MB). Free memory was 92.1 MB in the beginning and 171.6 MB in the end (delta: -79.5 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29771.53 ms. Allocated memory was 203.9 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 171.6 MB in the beginning and 1.1 GB in the end (delta: -950.9 MB). Peak memory consumption was 632.4 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: 29.5s, OverallIterations: 13, TraceHistogramMax: 219, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 315 SDtfs, 1109 SDslu, 1110 SDs, 0 SdLazy, 2823 SolverSat, 1067 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5193 GetRequests, 4910 SyntacticMatches, 0 SemanticMatches, 283 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2711 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=351occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 123 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 16.5s InterpolantComputationTime, 8807 NumberOfCodeBlocks, 8243 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 7573 ConstructedInterpolants, 0 QuantifiedInterpolants, 8519473 SizeOfPredicates, 66 NumberOfNonLiveVariables, 7492 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 22 InterpolantComputations, 2 PerfectInterpolantSequences, 383656/425216 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...