/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample FPandBPonlyIfFpWasNotPerfect -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks SMT_FEATURE_HEURISTIC --traceabstraction.assert.codeblocks.term.scoring.heuristic BIGGEST_EQUIVALENCE_CLASS --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 -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-d623d84 [2020-07-21 22:03:49,385 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 22:03:49,387 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 22:03:49,399 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 22:03:49,399 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 22:03:49,401 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 22:03:49,402 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 22:03:49,404 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 22:03:49,405 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 22:03:49,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 22:03:49,407 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 22:03:49,408 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 22:03:49,408 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 22:03:49,409 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 22:03:49,410 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 22:03:49,411 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 22:03:49,412 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 22:03:49,413 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 22:03:49,415 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 22:03:49,417 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 22:03:49,418 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 22:03:49,419 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 22:03:49,420 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 22:03:49,421 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 22:03:49,424 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 22:03:49,424 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 22:03:49,424 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 22:03:49,425 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 22:03:49,425 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 22:03:49,426 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 22:03:49,426 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 22:03:49,427 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 22:03:49,428 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 22:03:49,428 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 22:03:49,429 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 22:03:49,430 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 22:03:49,430 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 22:03:49,430 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 22:03:49,431 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 22:03:49,431 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 22:03:49,432 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 22:03:49,433 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-21 22:03:49,448 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 22:03:49,449 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 22:03:49,450 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 22:03:49,451 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 22:03:49,451 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 22:03:49,451 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 22:03:49,452 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 22:03:49,452 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 22:03:49,452 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 22:03:49,452 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 22:03:49,452 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 22:03:49,453 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 22:03:49,453 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 22:03:49,453 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 22:03:49,453 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 22:03:49,453 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 22:03:49,453 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 22:03:49,454 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 22:03:49,454 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 22:03:49,454 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 22:03:49,455 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 22:03:49,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 22:03:49,455 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 22:03:49,456 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 22:03:49,456 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 22:03:49,456 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 22:03:49,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:03:49,457 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 22:03:49,457 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 22:03:49,457 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> FPandBPonlyIfFpWasNotPerfect Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks -> SMT_FEATURE_HEURISTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> BIGGEST_EQUIVALENCE_CLASS 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 [2020-07-21 22:03:49,745 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 22:03:49,758 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 22:03:49,762 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 22:03:49,763 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 22:03:49,764 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 22:03:49,765 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-21 22:03:49,834 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce88a96f1/9c823d770e604babbaf4a6e2af213da6/FLAGb377949a8 [2020-07-21 22:03:50,274 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 22:03:50,275 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-07-21 22:03:50,282 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce88a96f1/9c823d770e604babbaf4a6e2af213da6/FLAGb377949a8 [2020-07-21 22:03:50,645 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce88a96f1/9c823d770e604babbaf4a6e2af213da6 [2020-07-21 22:03:50,655 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 22:03:50,658 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 22:03:50,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 22:03:50,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 22:03:50,663 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 22:03:50,664 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 10:03:50" (1/1) ... [2020-07-21 22:03:50,667 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@422631d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:03:50, skipping insertion in model container [2020-07-21 22:03:50,667 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 10:03:50" (1/1) ... [2020-07-21 22:03:50,675 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 22:03:50,690 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 22:03:50,854 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 22:03:50,860 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 22:03:50,880 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 22:03:50,895 INFO L208 MainTranslator]: Completed translation [2020-07-21 22:03:50,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:03:50 WrapperNode [2020-07-21 22:03:50,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 22:03:50,896 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 22:03:50,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 22:03:50,896 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 22:03:50,907 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:03:50" (1/1) ... [2020-07-21 22:03:50,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:03:50" (1/1) ... [2020-07-21 22:03:50,911 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:03:50" (1/1) ... [2020-07-21 22:03:50,911 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:03:50" (1/1) ... [2020-07-21 22:03:50,915 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:03:50" (1/1) ... [2020-07-21 22:03:50,917 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:03:50" (1/1) ... [2020-07-21 22:03:50,918 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:03:50" (1/1) ... [2020-07-21 22:03:50,919 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 22:03:50,919 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 22:03:50,919 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 22:03:50,920 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 22:03:50,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:03:50" (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-21 22:03:51,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 22:03:51,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 22:03:51,065 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-07-21 22:03:51,065 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 22:03:51,065 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 22:03:51,065 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 22:03:51,066 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-07-21 22:03:51,066 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 22:03:51,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 22:03:51,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 22:03:51,222 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 22:03:51,222 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-21 22:03:51,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 10:03:51 BoogieIcfgContainer [2020-07-21 22:03:51,226 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 22:03:51,227 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 22:03:51,227 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 22:03:51,230 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 22:03:51,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 10:03:50" (1/3) ... [2020-07-21 22:03:51,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a4b2a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 10:03:51, skipping insertion in model container [2020-07-21 22:03:51,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:03:50" (2/3) ... [2020-07-21 22:03:51,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a4b2a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 10:03:51, skipping insertion in model container [2020-07-21 22:03:51,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 10:03:51" (3/3) ... [2020-07-21 22:03:51,233 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2020-07-21 22:03:51,243 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 22:03:51,250 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 22:03:51,263 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 22:03:51,287 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 22:03:51,287 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 22:03:51,287 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 22:03:51,287 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 22:03:51,287 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 22:03:51,288 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 22:03:51,288 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 22:03:51,288 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 22:03:51,305 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-21 22:03:51,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-21 22:03:51,310 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:03:51,311 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 22:03:51,311 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:03:51,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:03:51,316 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2020-07-21 22:03:51,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:03:51,323 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [379322909] [2020-07-21 22:03:51,324 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:03:51,392 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 22:03:51,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:03:51,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 22:03:51,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:03:51,518 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-21 22:03:51,519 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 22:03:51,520 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [379322909] [2020-07-21 22:03:51,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 22:03:51,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 22:03:51,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772989910] [2020-07-21 22:03:51,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 22:03:51,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:03:51,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 22:03:51,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 22:03:51,545 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-07-21 22:03:51,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:03:51,649 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-07-21 22:03:51,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 22:03:51,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-21 22:03:51,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:03:51,662 INFO L225 Difference]: With dead ends: 35 [2020-07-21 22:03:51,663 INFO L226 Difference]: Without dead ends: 21 [2020-07-21 22:03:51,666 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-21 22:03:51,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-21 22:03:51,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-21 22:03:51,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-21 22:03:51,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-21 22:03:51,706 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-07-21 22:03:51,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:03:51,707 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-21 22:03:51,707 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 22:03:51,707 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-21 22:03:51,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-21 22:03:51,709 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:03:51,710 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 22:03:51,915 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:03:51,916 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:03:51,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:03:51,917 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2020-07-21 22:03:51,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:03:51,918 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1751993334] [2020-07-21 22:03:51,919 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:03:51,943 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 22:03:51,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:03:51,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 22:03:51,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:03:51,987 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-21 22:03:51,990 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 22:03:51,990 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1751993334] [2020-07-21 22:03:51,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 22:03:51,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 22:03:51,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201127261] [2020-07-21 22:03:51,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 22:03:51,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:03:51,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 22:03:51,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 22:03:51,995 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-07-21 22:03:52,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:03:52,064 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-21 22:03:52,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 22:03:52,065 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-21 22:03:52,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:03:52,067 INFO L225 Difference]: With dead ends: 27 [2020-07-21 22:03:52,067 INFO L226 Difference]: Without dead ends: 23 [2020-07-21 22:03:52,068 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 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-21 22:03:52,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-21 22:03:52,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-21 22:03:52,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-21 22:03:52,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-21 22:03:52,077 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-07-21 22:03:52,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:03:52,077 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-21 22:03:52,077 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 22:03:52,078 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-21 22:03:52,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-21 22:03:52,079 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:03:52,080 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-21 22:03:52,295 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:03:52,296 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:03:52,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:03:52,297 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2020-07-21 22:03:52,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:03:52,299 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1710589256] [2020-07-21 22:03:52,299 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:03:52,328 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 22:03:52,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:03:52,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-21 22:03:52,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:03:52,381 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-21 22:03:52,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 22:03:52,544 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:52,588 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-21 22:03:52,589 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1710589256] [2020-07-21 22:03:52,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 22:03:52,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2020-07-21 22:03:52,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479348266] [2020-07-21 22:03:52,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-21 22:03:52,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:03:52,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-21 22:03:52,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-21 22:03:52,592 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 9 states. [2020-07-21 22:03:52,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:03:52,693 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2020-07-21 22:03:52,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 22:03:52,694 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-21 22:03:52,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:03:52,696 INFO L225 Difference]: With dead ends: 32 [2020-07-21 22:03:52,696 INFO L226 Difference]: Without dead ends: 28 [2020-07-21 22:03:52,697 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-07-21 22:03:52,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-21 22:03:52,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2020-07-21 22:03:52,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-21 22:03:52,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2020-07-21 22:03:52,706 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 26 [2020-07-21 22:03:52,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:03:52,707 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-07-21 22:03:52,707 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-21 22:03:52,707 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2020-07-21 22:03:52,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-21 22:03:52,709 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:03:52,709 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-21 22:03:52,923 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:03:52,924 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:03:52,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:03:52,925 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2020-07-21 22:03:52,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:03:52,926 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [151254598] [2020-07-21 22:03:52,927 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:03:52,959 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 22:03:52,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:03:52,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-21 22:03:52,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:03:53,008 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-21 22:03:53,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 22:03:53,131 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:53,165 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-21 22:03:53,165 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [151254598] [2020-07-21 22:03:53,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 22:03:53,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2020-07-21 22:03:53,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517686347] [2020-07-21 22:03:53,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-21 22:03:53,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:03:53,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-21 22:03:53,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-21 22:03:53,168 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 9 states. [2020-07-21 22:03:53,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:03:53,241 INFO L93 Difference]: Finished difference Result 37 states and 54 transitions. [2020-07-21 22:03:53,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 22:03:53,242 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-21 22:03:53,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:03:53,244 INFO L225 Difference]: With dead ends: 37 [2020-07-21 22:03:53,244 INFO L226 Difference]: Without dead ends: 33 [2020-07-21 22:03:53,245 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-07-21 22:03:53,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-21 22:03:53,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2020-07-21 22:03:53,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-21 22:03:53,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2020-07-21 22:03:53,254 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 27 [2020-07-21 22:03:53,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:03:53,255 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-07-21 22:03:53,255 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-21 22:03:53,255 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2020-07-21 22:03:53,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-21 22:03:53,257 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:03:53,257 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] [2020-07-21 22:03:53,471 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:03:53,472 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:03:53,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:03:53,473 INFO L82 PathProgramCache]: Analyzing trace with hash -2027372739, now seen corresponding path program 2 times [2020-07-21 22:03:53,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:03:53,473 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [891876195] [2020-07-21 22:03:53,474 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:03:53,502 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 22:03:53,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:03:53,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 22:03:53,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:03:53,564 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-21 22:03:53,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 22:03:53,792 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:53,794 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:53,852 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:53,853 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:53,886 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-21 22:03:53,887 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [891876195] [2020-07-21 22:03:53,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 22:03:53,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2020-07-21 22:03:53,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282076085] [2020-07-21 22:03:53,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-21 22:03:53,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:03:53,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-21 22:03:53,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-07-21 22:03:53,889 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 11 states. [2020-07-21 22:03:54,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:03:54,046 INFO L93 Difference]: Finished difference Result 42 states and 68 transitions. [2020-07-21 22:03:54,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-21 22:03:54,047 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2020-07-21 22:03:54,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:03:54,050 INFO L225 Difference]: With dead ends: 42 [2020-07-21 22:03:54,050 INFO L226 Difference]: Without dead ends: 38 [2020-07-21 22:03:54,051 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-07-21 22:03:54,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-21 22:03:54,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2020-07-21 22:03:54,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-21 22:03:54,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2020-07-21 22:03:54,060 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 39 [2020-07-21 22:03:54,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:03:54,061 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-07-21 22:03:54,061 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-21 22:03:54,061 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-21 22:03:54,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-21 22:03:54,063 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:03:54,063 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 22:03:54,265 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:03:54,266 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:03:54,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:03:54,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1111873851, now seen corresponding path program 2 times [2020-07-21 22:03:54,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:03:54,269 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [663035407] [2020-07-21 22:03:54,269 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:03:54,298 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 22:03:54,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:03:54,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 22:03:54,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:03:54,341 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-21 22:03:54,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 22:03:54,559 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:54,610 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:54,611 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:54,648 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-21 22:03:54,649 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [663035407] [2020-07-21 22:03:54,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 22:03:54,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2020-07-21 22:03:54,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267900562] [2020-07-21 22:03:54,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-21 22:03:54,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:03:54,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-21 22:03:54,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-07-21 22:03:54,651 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 11 states. [2020-07-21 22:03:54,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:03:54,785 INFO L93 Difference]: Finished difference Result 47 states and 84 transitions. [2020-07-21 22:03:54,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-21 22:03:54,786 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2020-07-21 22:03:54,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:03:54,791 INFO L225 Difference]: With dead ends: 47 [2020-07-21 22:03:54,791 INFO L226 Difference]: Without dead ends: 43 [2020-07-21 22:03:54,792 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-07-21 22:03:54,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-21 22:03:54,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2020-07-21 22:03:54,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-21 22:03:54,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2020-07-21 22:03:54,815 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 41 [2020-07-21 22:03:54,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:03:54,816 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-07-21 22:03:54,816 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-21 22:03:54,816 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-21 22:03:54,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-21 22:03:54,823 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:03:54,824 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 22:03:55,037 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:03:55,038 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:03:55,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:03:55,039 INFO L82 PathProgramCache]: Analyzing trace with hash -767819153, now seen corresponding path program 3 times [2020-07-21 22:03:55,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:03:55,041 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1577138548] [2020-07-21 22:03:55,041 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:03:55,083 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 22:03:55,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:03:55,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-21 22:03:55,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:03:55,136 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 17 proven. 79 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-07-21 22:03:55,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 22:03:55,530 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:55,632 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:55,633 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:55,683 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:55,684 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:55,715 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 17 proven. 91 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2020-07-21 22:03:55,715 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1577138548] [2020-07-21 22:03:55,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 22:03:55,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 13 [2020-07-21 22:03:55,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165905895] [2020-07-21 22:03:55,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-21 22:03:55,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:03:55,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-21 22:03:55,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-07-21 22:03:55,717 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 13 states. [2020-07-21 22:03:55,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:03:55,867 INFO L93 Difference]: Finished difference Result 52 states and 102 transitions. [2020-07-21 22:03:55,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-21 22:03:55,868 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2020-07-21 22:03:55,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:03:55,870 INFO L225 Difference]: With dead ends: 52 [2020-07-21 22:03:55,870 INFO L226 Difference]: Without dead ends: 48 [2020-07-21 22:03:55,871 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 111 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2020-07-21 22:03:55,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-21 22:03:55,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2020-07-21 22:03:55,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-21 22:03:55,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. [2020-07-21 22:03:55,883 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 65 [2020-07-21 22:03:55,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:03:55,883 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 58 transitions. [2020-07-21 22:03:55,884 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-21 22:03:55,884 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 58 transitions. [2020-07-21 22:03:55,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-07-21 22:03:55,886 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:03:55,886 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 22:03:56,101 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:03:56,102 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:03:56,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:03:56,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1474757101, now seen corresponding path program 3 times [2020-07-21 22:03:56,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:03:56,104 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [360458727] [2020-07-21 22:03:56,105 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:03:56,147 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 22:03:56,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:03:56,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-21 22:03:56,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:03:56,236 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2020-07-21 22:03:56,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 22:03:56,653 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:56,757 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:56,758 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:56,810 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:56,854 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 181 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2020-07-21 22:03:56,855 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [360458727] [2020-07-21 22:03:56,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 22:03:56,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 13 [2020-07-21 22:03:56,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077122317] [2020-07-21 22:03:56,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-21 22:03:56,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:03:56,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-21 22:03:56,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-07-21 22:03:56,857 INFO L87 Difference]: Start difference. First operand 36 states and 58 transitions. Second operand 13 states. [2020-07-21 22:03:56,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:03:56,988 INFO L93 Difference]: Finished difference Result 57 states and 122 transitions. [2020-07-21 22:03:56,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-21 22:03:56,992 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2020-07-21 22:03:56,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:03:56,996 INFO L225 Difference]: With dead ends: 57 [2020-07-21 22:03:56,996 INFO L226 Difference]: Without dead ends: 53 [2020-07-21 22:03:56,997 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 172 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2020-07-21 22:03:56,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-21 22:03:57,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 36. [2020-07-21 22:03:57,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-21 22:03:57,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. [2020-07-21 22:03:57,009 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 96 [2020-07-21 22:03:57,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:03:57,010 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 58 transitions. [2020-07-21 22:03:57,010 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-21 22:03:57,010 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 58 transitions. [2020-07-21 22:03:57,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-07-21 22:03:57,012 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:03:57,012 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 22:03:57,215 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:03:57,216 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:03:57,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:03:57,217 INFO L82 PathProgramCache]: Analyzing trace with hash 838335741, now seen corresponding path program 4 times [2020-07-21 22:03:57,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:03:57,218 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1730217507] [2020-07-21 22:03:57,219 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:03:57,262 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 22:03:57,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:03:57,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-21 22:03:57,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:03:57,364 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 54 proven. 244 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2020-07-21 22:03:57,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 22:03:57,939 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:57,941 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:58,099 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:58,184 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:58,228 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:58,280 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 54 proven. 266 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2020-07-21 22:03:58,280 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1730217507] [2020-07-21 22:03:58,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 22:03:58,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 15 [2020-07-21 22:03:58,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873851116] [2020-07-21 22:03:58,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-21 22:03:58,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:03:58,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-21 22:03:58,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-07-21 22:03:58,282 INFO L87 Difference]: Start difference. First operand 36 states and 58 transitions. Second operand 15 states. [2020-07-21 22:03:58,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:03:58,551 INFO L93 Difference]: Finished difference Result 62 states and 144 transitions. [2020-07-21 22:03:58,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-21 22:03:58,552 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 117 [2020-07-21 22:03:58,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:03:58,554 INFO L225 Difference]: With dead ends: 62 [2020-07-21 22:03:58,554 INFO L226 Difference]: Without dead ends: 58 [2020-07-21 22:03:58,555 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 211 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2020-07-21 22:03:58,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-21 22:03:58,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 41. [2020-07-21 22:03:58,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-21 22:03:58,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 73 transitions. [2020-07-21 22:03:58,567 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 73 transitions. Word has length 117 [2020-07-21 22:03:58,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:03:58,568 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 73 transitions. [2020-07-21 22:03:58,568 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-21 22:03:58,568 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 73 transitions. [2020-07-21 22:03:58,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-07-21 22:03:58,571 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:03:58,571 INFO L422 BasicCegarLoop]: trace histogram [27, 27, 21, 13, 13, 13, 13, 13, 13, 13, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 22:03:58,784 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:03:58,785 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:03:58,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:03:58,786 INFO L82 PathProgramCache]: Analyzing trace with hash -2072922826, now seen corresponding path program 4 times [2020-07-21 22:03:58,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:03:58,787 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [206768134] [2020-07-21 22:03:58,788 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:03:58,854 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 22:03:58,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:03:58,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-21 22:03:58,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:03:58,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 86 proven. 506 refuted. 0 times theorem prover too weak. 1334 trivial. 0 not checked. [2020-07-21 22:03:58,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 22:03:59,628 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:59,818 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:59,895 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:59,896 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:59,938 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:03:59,939 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:00,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 86 proven. 532 refuted. 0 times theorem prover too weak. 1308 trivial. 0 not checked. [2020-07-21 22:04:00,006 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [206768134] [2020-07-21 22:04:00,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 22:04:00,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 15 [2020-07-21 22:04:00,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479284128] [2020-07-21 22:04:00,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-21 22:04:00,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:04:00,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-21 22:04:00,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-07-21 22:04:00,009 INFO L87 Difference]: Start difference. First operand 41 states and 73 transitions. Second operand 15 states. [2020-07-21 22:04:00,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:04:00,167 INFO L93 Difference]: Finished difference Result 67 states and 168 transitions. [2020-07-21 22:04:00,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-21 22:04:00,168 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 190 [2020-07-21 22:04:00,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:04:00,171 INFO L225 Difference]: With dead ends: 67 [2020-07-21 22:04:00,171 INFO L226 Difference]: Without dead ends: 63 [2020-07-21 22:04:00,172 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 356 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2020-07-21 22:04:00,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-21 22:04:00,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 41. [2020-07-21 22:04:00,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-21 22:04:00,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 73 transitions. [2020-07-21 22:04:00,183 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 73 transitions. Word has length 190 [2020-07-21 22:04:00,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:04:00,184 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 73 transitions. [2020-07-21 22:04:00,184 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-21 22:04:00,184 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 73 transitions. [2020-07-21 22:04:00,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-07-21 22:04:00,188 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:04:00,188 INFO L422 BasicCegarLoop]: trace histogram [43, 43, 22, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 22:04:00,401 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:04:00,402 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:04:00,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:04:00,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1082984306, now seen corresponding path program 5 times [2020-07-21 22:04:00,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:04:00,404 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1578773889] [2020-07-21 22:04:00,404 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:04:00,484 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 22:04:00,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:04:00,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-21 22:04:00,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:04:00,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4662 backedges. 159 proven. 967 refuted. 0 times theorem prover too weak. 3536 trivial. 0 not checked. [2020-07-21 22:04:00,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 22:04:01,708 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:02,027 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:02,168 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:02,249 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:02,299 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:02,300 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:02,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4662 backedges. 159 proven. 1002 refuted. 0 times theorem prover too weak. 3501 trivial. 0 not checked. [2020-07-21 22:04:02,404 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1578773889] [2020-07-21 22:04:02,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 22:04:02,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 17 [2020-07-21 22:04:02,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388949386] [2020-07-21 22:04:02,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-21 22:04:02,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:04:02,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-21 22:04:02,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2020-07-21 22:04:02,406 INFO L87 Difference]: Start difference. First operand 41 states and 73 transitions. Second operand 17 states. [2020-07-21 22:04:02,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:04:02,612 INFO L93 Difference]: Finished difference Result 72 states and 194 transitions. [2020-07-21 22:04:02,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-21 22:04:02,612 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 286 [2020-07-21 22:04:02,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:04:02,616 INFO L225 Difference]: With dead ends: 72 [2020-07-21 22:04:02,616 INFO L226 Difference]: Without dead ends: 68 [2020-07-21 22:04:02,618 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 545 SyntacticMatches, 12 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2020-07-21 22:04:02,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-21 22:04:02,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2020-07-21 22:04:02,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-21 22:04:02,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 90 transitions. [2020-07-21 22:04:02,640 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 90 transitions. Word has length 286 [2020-07-21 22:04:02,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:04:02,641 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 90 transitions. [2020-07-21 22:04:02,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-21 22:04:02,642 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 90 transitions. [2020-07-21 22:04:02,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2020-07-21 22:04:02,648 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:04:02,648 INFO L422 BasicCegarLoop]: trace histogram [43, 43, 35, 21, 21, 21, 21, 21, 21, 21, 14, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 22:04:02,861 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:04:02,862 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:04:02,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:04:02,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1101007572, now seen corresponding path program 5 times [2020-07-21 22:04:02,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:04:02,864 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [218695111] [2020-07-21 22:04:02,864 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:04:02,959 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 22:04:02,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:04:02,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-21 22:04:02,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:04:03,124 INFO L134 CoverageAnalysis]: Checked inductivity of 5047 backedges. 159 proven. 1061 refuted. 0 times theorem prover too weak. 3827 trivial. 0 not checked. [2020-07-21 22:04:03,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 22:04:04,316 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:04,624 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:04,769 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:04,851 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:04,852 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:04,894 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:04,991 INFO L134 CoverageAnalysis]: Checked inductivity of 5047 backedges. 159 proven. 1101 refuted. 0 times theorem prover too weak. 3787 trivial. 0 not checked. [2020-07-21 22:04:04,992 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [218695111] [2020-07-21 22:04:04,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 22:04:04,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 17 [2020-07-21 22:04:04,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584691154] [2020-07-21 22:04:04,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-21 22:04:04,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:04:04,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-21 22:04:04,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2020-07-21 22:04:04,994 INFO L87 Difference]: Start difference. First operand 46 states and 90 transitions. Second operand 17 states. [2020-07-21 22:04:05,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:04:05,218 INFO L93 Difference]: Finished difference Result 77 states and 222 transitions. [2020-07-21 22:04:05,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-21 22:04:05,218 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 300 [2020-07-21 22:04:05,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:04:05,226 INFO L225 Difference]: With dead ends: 77 [2020-07-21 22:04:05,227 INFO L226 Difference]: Without dead ends: 73 [2020-07-21 22:04:05,228 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 572 SyntacticMatches, 12 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2020-07-21 22:04:05,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-21 22:04:05,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 46. [2020-07-21 22:04:05,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-21 22:04:05,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 90 transitions. [2020-07-21 22:04:05,250 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 90 transitions. Word has length 300 [2020-07-21 22:04:05,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:04:05,251 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 90 transitions. [2020-07-21 22:04:05,251 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-21 22:04:05,251 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 90 transitions. [2020-07-21 22:04:05,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2020-07-21 22:04:05,261 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:04:05,262 INFO L422 BasicCegarLoop]: trace histogram [71, 71, 36, 35, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 22:04:05,475 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:04:05,476 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:04:05,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:04:05,476 INFO L82 PathProgramCache]: Analyzing trace with hash -897924696, now seen corresponding path program 6 times [2020-07-21 22:04:05,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:04:05,476 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2004744877] [2020-07-21 22:04:05,477 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:04:05,598 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 22:04:05,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:04:05,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-21 22:04:05,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:04:05,848 INFO L134 CoverageAnalysis]: Checked inductivity of 12915 backedges. 306 proven. 1995 refuted. 0 times theorem prover too weak. 10614 trivial. 0 not checked. [2020-07-21 22:04:05,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 22:04:07,702 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:08,176 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:08,427 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:08,595 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:08,596 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:08,674 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:08,720 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:08,721 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:08,847 INFO L134 CoverageAnalysis]: Checked inductivity of 12915 backedges. 306 proven. 2046 refuted. 0 times theorem prover too weak. 10563 trivial. 0 not checked. [2020-07-21 22:04:08,848 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2004744877] [2020-07-21 22:04:08,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 22:04:08,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 19 [2020-07-21 22:04:08,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112057713] [2020-07-21 22:04:08,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-21 22:04:08,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:04:08,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-21 22:04:08,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2020-07-21 22:04:08,851 INFO L87 Difference]: Start difference. First operand 46 states and 90 transitions. Second operand 19 states. [2020-07-21 22:04:09,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:04:09,189 INFO L93 Difference]: Finished difference Result 82 states and 252 transitions. [2020-07-21 22:04:09,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-21 22:04:09,189 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 468 [2020-07-21 22:04:09,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:04:09,194 INFO L225 Difference]: With dead ends: 82 [2020-07-21 22:04:09,195 INFO L226 Difference]: Without dead ends: 78 [2020-07-21 22:04:09,196 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 943 GetRequests, 905 SyntacticMatches, 14 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2020-07-21 22:04:09,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-21 22:04:09,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 51. [2020-07-21 22:04:09,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-21 22:04:09,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 109 transitions. [2020-07-21 22:04:09,208 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 109 transitions. Word has length 468 [2020-07-21 22:04:09,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:04:09,209 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 109 transitions. [2020-07-21 22:04:09,209 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-21 22:04:09,209 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 109 transitions. [2020-07-21 22:04:09,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2020-07-21 22:04:09,213 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:04:09,213 INFO L422 BasicCegarLoop]: trace histogram [65, 65, 53, 32, 32, 32, 32, 32, 32, 32, 21, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 22:04:09,428 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:04:09,429 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:04:09,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:04:09,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1350718391, now seen corresponding path program 6 times [2020-07-21 22:04:09,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:04:09,430 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2091790244] [2020-07-21 22:04:09,430 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:04:09,558 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 22:04:09,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:04:09,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-21 22:04:09,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:04:09,747 INFO L134 CoverageAnalysis]: Checked inductivity of 11682 backedges. 333 proven. 1918 refuted. 0 times theorem prover too weak. 9431 trivial. 0 not checked. [2020-07-21 22:04:09,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 22:04:11,330 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:12,012 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:12,012 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:12,342 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:12,343 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:12,489 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:12,571 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:12,572 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:12,617 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:12,752 INFO L134 CoverageAnalysis]: Checked inductivity of 11682 backedges. 333 proven. 1975 refuted. 0 times theorem prover too weak. 9374 trivial. 0 not checked. [2020-07-21 22:04:12,753 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2091790244] [2020-07-21 22:04:12,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 22:04:12,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 19 [2020-07-21 22:04:12,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532841313] [2020-07-21 22:04:12,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-21 22:04:12,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:04:12,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-21 22:04:12,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2020-07-21 22:04:12,755 INFO L87 Difference]: Start difference. First operand 51 states and 109 transitions. Second operand 19 states. [2020-07-21 22:04:13,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:04:13,236 INFO L93 Difference]: Finished difference Result 87 states and 284 transitions. [2020-07-21 22:04:13,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-21 22:04:13,237 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 450 [2020-07-21 22:04:13,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:04:13,242 INFO L225 Difference]: With dead ends: 87 [2020-07-21 22:04:13,243 INFO L226 Difference]: Without dead ends: 83 [2020-07-21 22:04:13,244 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 906 GetRequests, 868 SyntacticMatches, 14 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2020-07-21 22:04:13,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-07-21 22:04:13,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 51. [2020-07-21 22:04:13,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-21 22:04:13,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 109 transitions. [2020-07-21 22:04:13,258 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 109 transitions. Word has length 450 [2020-07-21 22:04:13,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:04:13,260 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 109 transitions. [2020-07-21 22:04:13,260 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-21 22:04:13,260 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 109 transitions. [2020-07-21 22:04:13,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 872 [2020-07-21 22:04:13,270 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:04:13,271 INFO L422 BasicCegarLoop]: trace histogram [133, 133, 67, 66, 66, 66, 66, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 22:04:13,483 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:04:13,484 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:04:13,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:04:13,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1701713687, now seen corresponding path program 7 times [2020-07-21 22:04:13,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:04:13,485 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [983049744] [2020-07-21 22:04:13,485 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:04:13,687 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 22:04:13,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:04:13,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-21 22:04:13,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:04:14,098 INFO L134 CoverageAnalysis]: Checked inductivity of 45837 backedges. 778 proven. 4406 refuted. 0 times theorem prover too weak. 40653 trivial. 0 not checked. [2020-07-21 22:04:14,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 22:04:16,771 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:16,772 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:18,085 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:18,684 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:18,685 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:19,012 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:19,013 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:19,163 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:19,164 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:19,247 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:19,248 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:19,301 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:19,665 INFO L134 CoverageAnalysis]: Checked inductivity of 45837 backedges. 778 proven. 4476 refuted. 0 times theorem prover too weak. 40583 trivial. 0 not checked. [2020-07-21 22:04:19,665 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [983049744] [2020-07-21 22:04:19,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 22:04:19,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 21 [2020-07-21 22:04:19,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097350445] [2020-07-21 22:04:19,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-21 22:04:19,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:04:19,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-21 22:04:19,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2020-07-21 22:04:19,669 INFO L87 Difference]: Start difference. First operand 51 states and 109 transitions. Second operand 21 states. [2020-07-21 22:04:20,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:04:20,055 INFO L93 Difference]: Finished difference Result 92 states and 318 transitions. [2020-07-21 22:04:20,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-21 22:04:20,056 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 871 [2020-07-21 22:04:20,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:04:20,061 INFO L225 Difference]: With dead ends: 92 [2020-07-21 22:04:20,061 INFO L226 Difference]: Without dead ends: 88 [2020-07-21 22:04:20,065 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1750 GetRequests, 1707 SyntacticMatches, 16 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2020-07-21 22:04:20,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-21 22:04:20,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 56. [2020-07-21 22:04:20,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-21 22:04:20,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 130 transitions. [2020-07-21 22:04:20,087 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 130 transitions. Word has length 871 [2020-07-21 22:04:20,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:04:20,090 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 130 transitions. [2020-07-21 22:04:20,090 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-21 22:04:20,090 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 130 transitions. [2020-07-21 22:04:20,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1078 [2020-07-21 22:04:20,101 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:04:20,102 INFO L422 BasicCegarLoop]: trace histogram [157, 157, 128, 78, 78, 78, 78, 78, 78, 78, 50, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 22:04:20,317 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:04:20,318 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:04:20,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:04:20,318 INFO L82 PathProgramCache]: Analyzing trace with hash 860290653, now seen corresponding path program 7 times [2020-07-21 22:04:20,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:04:20,319 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [388274816] [2020-07-21 22:04:20,319 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:04:20,568 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 22:04:20,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:04:20,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-21 22:04:20,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:04:21,134 INFO L134 CoverageAnalysis]: Checked inductivity of 69124 backedges. 831 proven. 5812 refuted. 0 times theorem prover too weak. 62481 trivial. 0 not checked. [2020-07-21 22:04:21,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 22:04:24,521 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:24,522 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:25,801 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:26,404 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:26,405 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:26,737 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:26,738 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:26,904 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:26,992 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:27,040 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:27,624 INFO L134 CoverageAnalysis]: Checked inductivity of 69124 backedges. 831 proven. 5889 refuted. 0 times theorem prover too weak. 62404 trivial. 0 not checked. [2020-07-21 22:04:27,625 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [388274816] [2020-07-21 22:04:27,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 22:04:27,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 21 [2020-07-21 22:04:27,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049811758] [2020-07-21 22:04:27,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-21 22:04:27,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:04:27,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-21 22:04:27,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2020-07-21 22:04:27,630 INFO L87 Difference]: Start difference. First operand 56 states and 130 transitions. Second operand 21 states. [2020-07-21 22:04:28,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:04:28,209 INFO L93 Difference]: Finished difference Result 97 states and 354 transitions. [2020-07-21 22:04:28,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-21 22:04:28,210 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1077 [2020-07-21 22:04:28,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:04:28,216 INFO L225 Difference]: With dead ends: 97 [2020-07-21 22:04:28,216 INFO L226 Difference]: Without dead ends: 93 [2020-07-21 22:04:28,217 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2161 GetRequests, 2118 SyntacticMatches, 16 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2020-07-21 22:04:28,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-07-21 22:04:28,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 56. [2020-07-21 22:04:28,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-21 22:04:28,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 130 transitions. [2020-07-21 22:04:28,234 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 130 transitions. Word has length 1077 [2020-07-21 22:04:28,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:04:28,236 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 130 transitions. [2020-07-21 22:04:28,236 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-21 22:04:28,236 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 130 transitions. [2020-07-21 22:04:28,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1574 [2020-07-21 22:04:28,256 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:04:28,257 INFO L422 BasicCegarLoop]: trace histogram [241, 241, 121, 120, 120, 120, 120, 120, 120, 120, 120, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 22:04:28,468 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:04:28,468 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:04:28,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:04:28,470 INFO L82 PathProgramCache]: Analyzing trace with hash 78333505, now seen corresponding path program 8 times [2020-07-21 22:04:28,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:04:28,471 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [204163530] [2020-07-21 22:04:28,471 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:04:28,802 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 22:04:28,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:04:28,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-21 22:04:28,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:04:29,952 INFO L134 CoverageAnalysis]: Checked inductivity of 151380 backedges. 1563 proven. 9337 refuted. 0 times theorem prover too weak. 140480 trivial. 0 not checked. [2020-07-21 22:04:29,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 22:04:34,698 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:37,015 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:38,221 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:38,753 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:38,754 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:39,143 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:39,144 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:39,359 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:39,456 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:39,457 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:39,519 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:39,520 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:40,631 INFO L134 CoverageAnalysis]: Checked inductivity of 151380 backedges. 1563 proven. 9429 refuted. 0 times theorem prover too weak. 140388 trivial. 0 not checked. [2020-07-21 22:04:40,632 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [204163530] [2020-07-21 22:04:40,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 22:04:40,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 23 [2020-07-21 22:04:40,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819282177] [2020-07-21 22:04:40,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-07-21 22:04:40,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:04:40,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-07-21 22:04:40,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2020-07-21 22:04:40,636 INFO L87 Difference]: Start difference. First operand 56 states and 130 transitions. Second operand 23 states. [2020-07-21 22:04:41,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:04:41,419 INFO L93 Difference]: Finished difference Result 102 states and 392 transitions. [2020-07-21 22:04:41,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-21 22:04:41,420 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1573 [2020-07-21 22:04:41,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:04:41,426 INFO L225 Difference]: With dead ends: 102 [2020-07-21 22:04:41,426 INFO L226 Difference]: Without dead ends: 98 [2020-07-21 22:04:41,428 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3155 GetRequests, 3107 SyntacticMatches, 18 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=323, Invalid=669, Unknown=0, NotChecked=0, Total=992 [2020-07-21 22:04:41,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-21 22:04:41,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 61. [2020-07-21 22:04:41,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-21 22:04:41,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 153 transitions. [2020-07-21 22:04:41,443 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 153 transitions. Word has length 1573 [2020-07-21 22:04:41,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:04:41,445 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 153 transitions. [2020-07-21 22:04:41,446 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-07-21 22:04:41,446 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 153 transitions. [2020-07-21 22:04:41,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1843 [2020-07-21 22:04:41,479 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:04:41,480 INFO L422 BasicCegarLoop]: trace histogram [269, 269, 221, 134, 134, 134, 134, 134, 134, 134, 87, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 22:04:41,693 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:04:41,694 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:04:41,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:04:41,695 INFO L82 PathProgramCache]: Analyzing trace with hash -323852785, now seen corresponding path program 8 times [2020-07-21 22:04:41,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:04:41,696 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1798977098] [2020-07-21 22:04:41,696 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:04:42,122 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 22:04:42,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:04:42,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 1021 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-21 22:04:42,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:04:43,593 INFO L134 CoverageAnalysis]: Checked inductivity of 204138 backedges. 1703 proven. 11413 refuted. 0 times theorem prover too weak. 191022 trivial. 0 not checked. [2020-07-21 22:04:43,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 22:04:48,721 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:51,459 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:51,460 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:52,869 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:52,870 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:53,534 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:53,888 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:53,889 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:54,050 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:54,145 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:54,193 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:04:55,620 INFO L134 CoverageAnalysis]: Checked inductivity of 204138 backedges. 1703 proven. 11513 refuted. 0 times theorem prover too weak. 190922 trivial. 0 not checked. [2020-07-21 22:04:55,621 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1798977098] [2020-07-21 22:04:55,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 22:04:55,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 22 [2020-07-21 22:04:55,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851794478] [2020-07-21 22:04:55,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-21 22:04:55,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:04:55,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-21 22:04:55,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2020-07-21 22:04:55,624 INFO L87 Difference]: Start difference. First operand 61 states and 153 transitions. Second operand 22 states. [2020-07-21 22:04:56,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:04:56,154 INFO L93 Difference]: Finished difference Result 107 states and 432 transitions. [2020-07-21 22:04:56,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-21 22:04:56,155 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1842 [2020-07-21 22:04:56,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:04:56,162 INFO L225 Difference]: With dead ends: 107 [2020-07-21 22:04:56,162 INFO L226 Difference]: Without dead ends: 103 [2020-07-21 22:04:56,163 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3692 GetRequests, 3644 SyntacticMatches, 19 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=320, Invalid=610, Unknown=0, NotChecked=0, Total=930 [2020-07-21 22:04:56,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-07-21 22:04:56,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 61. [2020-07-21 22:04:56,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-21 22:04:56,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 153 transitions. [2020-07-21 22:04:56,178 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 153 transitions. Word has length 1842 [2020-07-21 22:04:56,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:04:56,180 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 153 transitions. [2020-07-21 22:04:56,180 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-21 22:04:56,180 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 153 transitions. [2020-07-21 22:04:56,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2107 [2020-07-21 22:04:56,219 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:04:56,220 INFO L422 BasicCegarLoop]: trace histogram [323, 323, 162, 161, 161, 161, 161, 161, 161, 161, 161, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 22:04:56,434 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:04:56,435 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:04:56,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:04:56,436 INFO L82 PathProgramCache]: Analyzing trace with hash 211951896, now seen corresponding path program 9 times [2020-07-21 22:04:56,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:04:56,437 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [488922492] [2020-07-21 22:04:56,437 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:04:56,947 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 22:04:56,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:04:56,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 1173 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-21 22:04:56,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:04:58,990 INFO L134 CoverageAnalysis]: Checked inductivity of 272412 backedges. 2152 proven. 14276 refuted. 0 times theorem prover too weak. 255984 trivial. 0 not checked. [2020-07-21 22:04:58,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 22:05:05,859 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:05:09,515 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:05:11,358 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:05:12,357 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:05:12,359 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:05:12,996 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:05:12,996 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:05:13,351 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:05:13,353 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:05:13,528 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:05:13,629 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:05:13,691 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:05:15,388 INFO L134 CoverageAnalysis]: Checked inductivity of 272412 backedges. 2152 proven. 14393 refuted. 0 times theorem prover too weak. 255867 trivial. 0 not checked. [2020-07-21 22:05:15,389 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [488922492] [2020-07-21 22:05:15,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 22:05:15,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 23] total 24 [2020-07-21 22:05:15,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429715524] [2020-07-21 22:05:15,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-07-21 22:05:15,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:05:15,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-07-21 22:05:15,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2020-07-21 22:05:15,392 INFO L87 Difference]: Start difference. First operand 61 states and 153 transitions. Second operand 24 states. [2020-07-21 22:05:16,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:05:16,017 INFO L93 Difference]: Finished difference Result 112 states and 474 transitions. [2020-07-21 22:05:16,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-21 22:05:16,018 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 2106 [2020-07-21 22:05:16,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:05:16,025 INFO L225 Difference]: With dead ends: 112 [2020-07-21 22:05:16,025 INFO L226 Difference]: Without dead ends: 108 [2020-07-21 22:05:16,026 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4222 GetRequests, 4169 SyntacticMatches, 21 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=385, Invalid=737, Unknown=0, NotChecked=0, Total=1122 [2020-07-21 22:05:16,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-07-21 22:05:16,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 66. [2020-07-21 22:05:16,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-21 22:05:16,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 178 transitions. [2020-07-21 22:05:16,044 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 178 transitions. Word has length 2106 [2020-07-21 22:05:16,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:05:16,045 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 178 transitions. [2020-07-21 22:05:16,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-07-21 22:05:16,045 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 178 transitions. [2020-07-21 22:05:16,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2370 [2020-07-21 22:05:16,099 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:05:16,100 INFO L422 BasicCegarLoop]: trace histogram [347, 347, 280, 173, 173, 173, 173, 173, 173, 173, 107, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 22:05:16,300 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:05:16,301 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:05:16,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:05:16,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1042406318, now seen corresponding path program 9 times [2020-07-21 22:05:16,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:05:16,303 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1150669887] [2020-07-21 22:05:16,304 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:05:16,848 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 22:05:16,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:05:16,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 1313 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-21 22:05:16,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:05:20,015 INFO L134 CoverageAnalysis]: Checked inductivity of 338696 backedges. 2716 proven. 16857 refuted. 0 times theorem prover too weak. 319123 trivial. 0 not checked. [2020-07-21 22:05:20,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 22:05:27,380 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:05:32,088 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:05:32,089 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:05:33,965 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:05:34,929 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:05:35,510 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:05:35,769 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:05:35,950 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:05:36,074 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:05:36,074 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:05:36,139 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:05:36,218 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:05:38,393 INFO L134 CoverageAnalysis]: Checked inductivity of 338696 backedges. 2726 proven. 16964 refuted. 0 times theorem prover too weak. 319006 trivial. 0 not checked. [2020-07-21 22:05:38,393 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1150669887] [2020-07-21 22:05:38,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 22:05:38,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 23] total 24 [2020-07-21 22:05:38,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191053061] [2020-07-21 22:05:38,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-07-21 22:05:38,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:05:38,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-07-21 22:05:38,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2020-07-21 22:05:38,397 INFO L87 Difference]: Start difference. First operand 66 states and 178 transitions. Second operand 24 states. [2020-07-21 22:05:39,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:05:39,022 INFO L93 Difference]: Finished difference Result 289 states and 3051 transitions. [2020-07-21 22:05:39,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-21 22:05:39,023 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 2369 [2020-07-21 22:05:39,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:05:39,030 INFO L225 Difference]: With dead ends: 289 [2020-07-21 22:05:39,030 INFO L226 Difference]: Without dead ends: 85 [2020-07-21 22:05:39,048 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4747 GetRequests, 4694 SyntacticMatches, 21 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=385, Invalid=737, Unknown=0, NotChecked=0, Total=1122 [2020-07-21 22:05:39,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-07-21 22:05:39,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2020-07-21 22:05:39,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-21 22:05:39,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 140 transitions. [2020-07-21 22:05:39,070 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 140 transitions. Word has length 2369 [2020-07-21 22:05:39,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:05:39,071 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 140 transitions. [2020-07-21 22:05:39,071 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-07-21 22:05:39,071 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 140 transitions. [2020-07-21 22:05:39,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1366 [2020-07-21 22:05:39,099 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:05:39,100 INFO L422 BasicCegarLoop]: trace histogram [197, 197, 176, 98, 98, 98, 98, 98, 98, 98, 78, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 22:05:39,315 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:05:39,315 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:05:39,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:05:39,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1651397559, now seen corresponding path program 10 times [2020-07-21 22:05:39,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:05:39,316 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [978475584] [2020-07-21 22:05:39,317 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:05:39,845 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 22:05:39,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 22:05:39,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-21 22:05:39,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 22:05:40,614 INFO L134 CoverageAnalysis]: Checked inductivity of 111636 backedges. 1525 proven. 8096 refuted. 0 times theorem prover too weak. 102015 trivial. 0 not checked. [2020-07-21 22:05:40,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 22:05:45,743 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:05:47,609 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:05:48,802 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:05:49,468 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:05:49,911 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:05:49,912 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:05:50,128 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:05:50,129 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:05:50,224 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:05:50,225 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:05:50,276 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:05:50,277 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:05:50,311 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:05:50,336 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 22:05:51,062 INFO L134 CoverageAnalysis]: Checked inductivity of 111636 backedges. 1549 proven. 8166 refuted. 0 times theorem prover too weak. 101921 trivial. 0 not checked. [2020-07-21 22:05:51,062 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [978475584] [2020-07-21 22:05:51,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 22:05:51,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 22 [2020-07-21 22:05:51,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613988447] [2020-07-21 22:05:51,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-21 22:05:51,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 22:05:51,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-21 22:05:51,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2020-07-21 22:05:51,065 INFO L87 Difference]: Start difference. First operand 85 states and 140 transitions. Second operand 22 states. [2020-07-21 22:05:51,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 22:05:51,639 INFO L93 Difference]: Finished difference Result 294 states and 697 transitions. [2020-07-21 22:05:51,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-21 22:05:51,640 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1365 [2020-07-21 22:05:51,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 22:05:51,646 INFO L225 Difference]: With dead ends: 294 [2020-07-21 22:05:51,646 INFO L226 Difference]: Without dead ends: 93 [2020-07-21 22:05:51,665 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2738 GetRequests, 2690 SyntacticMatches, 19 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=320, Invalid=610, Unknown=0, NotChecked=0, Total=930 [2020-07-21 22:05:51,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-07-21 22:05:51,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 82. [2020-07-21 22:05:51,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-07-21 22:05:51,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 117 transitions. [2020-07-21 22:05:51,686 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 117 transitions. Word has length 1365 [2020-07-21 22:05:51,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 22:05:51,687 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 117 transitions. [2020-07-21 22:05:51,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-21 22:05:51,688 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 117 transitions. [2020-07-21 22:05:51,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2020-07-21 22:05:51,714 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 22:05:51,715 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-21 22:05:51,927 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:05:51,928 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 22:05:51,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 22:05:51,928 INFO L82 PathProgramCache]: Analyzing trace with hash 452920407, now seen corresponding path program 11 times [2020-07-21 22:05:51,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 22:05:51,929 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [176768990] [2020-07-21 22:05:51,929 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:05:52,651 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 22:05:52,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-07-21 22:05:52,651 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 22:05:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-21 22:05:52,879 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 22:05:53,072 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-21 22:05:53,072 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-21 22:05:53,276 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 22:05:53,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 10:05:53 BoogieIcfgContainer [2020-07-21 22:05:53,483 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-21 22:05:53,486 INFO L168 Benchmark]: Toolchain (without parser) took 122828.75 ms. Allocated memory was 138.4 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 103.9 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2020-07-21 22:05:53,486 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-21 22:05:53,487 INFO L168 Benchmark]: CACSL2BoogieTranslator took 236.79 ms. Allocated memory is still 138.4 MB. Free memory was 103.5 MB in the beginning and 94.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-07-21 22:05:53,487 INFO L168 Benchmark]: Boogie Preprocessor took 22.87 ms. Allocated memory is still 138.4 MB. Free memory was 94.3 MB in the beginning and 92.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-21 22:05:53,488 INFO L168 Benchmark]: RCFGBuilder took 306.56 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 92.9 MB in the beginning and 170.5 MB in the end (delta: -77.7 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-07-21 22:05:53,488 INFO L168 Benchmark]: TraceAbstraction took 122256.60 ms. Allocated memory was 201.9 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 169.8 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2020-07-21 22:05:53,491 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 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 236.79 ms. Allocated memory is still 138.4 MB. Free memory was 103.5 MB in the beginning and 94.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.87 ms. Allocated memory is still 138.4 MB. Free memory was 94.3 MB in the beginning and 92.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 306.56 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 92.9 MB in the beginning and 170.5 MB in the end (delta: -77.7 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 122256.60 ms. Allocated memory was 201.9 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 169.8 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.4 GB. 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: 121.9s, OverallIterations: 22, TraceHistogramMax: 347, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 374 SDtfs, 1517 SDslu, 1877 SDs, 0 SdLazy, 2350 SolverSat, 3491 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 26755 GetRequests, 26105 SyntacticMatches, 238 SemanticMatches, 412 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2320 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 407 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 104.8s InterpolantComputationTime, 14547 NumberOfCodeBlocks, 4620 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 26603 ConstructedInterpolants, 0 QuantifiedInterpolants, 45560373 SizeOfPredicates, 140 NumberOfNonLiveVariables, 7575 ConjunctsInSsa, 280 ConjunctsInUnsatCore, 40 InterpolantComputations, 2 PerfectInterpolantSequences, 2306434/2461720 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...