java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.cil.c_23.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-133090d [2018-10-04 09:22:11,471 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:22:11,473 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:22:11,485 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:22:11,486 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:22:11,487 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:22:11,488 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:22:11,490 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:22:11,492 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:22:11,493 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:22:11,494 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:22:11,494 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:22:11,495 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:22:11,496 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:22:11,497 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:22:11,498 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:22:11,499 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:22:11,501 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:22:11,503 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:22:11,505 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:22:11,506 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:22:11,511 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:22:11,514 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:22:11,514 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:22:11,515 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:22:11,516 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:22:11,518 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:22:11,521 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:22:11,522 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:22:11,523 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:22:11,523 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:22:11,525 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:22:11,526 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:22:11,526 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:22:11,527 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:22:11,528 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:22:11,528 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-04 09:22:11,559 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:22:11,559 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:22:11,560 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:22:11,560 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:22:11,561 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:22:11,561 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:22:11,562 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:22:11,562 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:22:11,562 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:22:11,562 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:22:11,562 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:22:11,563 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:22:11,563 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:22:11,563 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:22:11,563 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:22:11,563 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:22:11,564 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:22:11,565 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:22:11,565 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:22:11,565 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:22:11,565 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:22:11,566 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:22:11,566 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:22:11,566 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:22:11,566 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:22:11,567 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:22:11,567 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:22:11,567 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:22:11,568 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:22:11,568 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:22:11,618 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:22:11,631 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:22:11,637 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:22:11,639 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:22:11,639 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:22:11,641 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.cil.c_23.bpl [2018-10-04 09:22:11,641 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.cil.c_23.bpl' [2018-10-04 09:22:11,765 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:22:11,767 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:22:11,768 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:22:11,768 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:22:11,768 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:22:11,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:11" (1/1) ... [2018-10-04 09:22:11,807 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:11" (1/1) ... [2018-10-04 09:22:11,822 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:22:11,823 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:22:11,823 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:22:11,823 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:22:11,835 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:11" (1/1) ... [2018-10-04 09:22:11,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:11" (1/1) ... [2018-10-04 09:22:11,846 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:11" (1/1) ... [2018-10-04 09:22:11,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:11" (1/1) ... [2018-10-04 09:22:11,865 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:11" (1/1) ... [2018-10-04 09:22:11,872 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:11" (1/1) ... [2018-10-04 09:22:11,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:11" (1/1) ... [2018-10-04 09:22:11,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:22:11,887 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:22:11,887 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:22:11,887 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:22:11,893 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:11" (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 [2018-10-04 09:22:11,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 09:22:11,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 09:22:12,662 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 09:22:12,663 INFO L202 PluginConnector]: Adding new model s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:22:12 BoogieIcfgContainer [2018-10-04 09:22:12,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:22:12,664 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:22:12,664 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:22:12,667 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:22:12,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:11" (1/2) ... [2018-10-04 09:22:12,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13e056d1 and model type s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:22:12, skipping insertion in model container [2018-10-04 09:22:12,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:22:12" (2/2) ... [2018-10-04 09:22:12,671 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil.c_23.bpl [2018-10-04 09:22:12,680 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:22:12,689 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:22:12,740 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:22:12,741 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:22:12,741 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:22:12,742 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:22:12,742 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:22:12,742 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:22:12,742 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:22:12,742 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:22:12,743 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:22:12,759 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-10-04 09:22:12,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:22:12,767 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:12,768 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:12,769 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:12,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:12,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1511424245, now seen corresponding path program 1 times [2018-10-04 09:22:12,778 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:12,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:12,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:12,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:12,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:13,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:22:13,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:13,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:22:13,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:13,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:13,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:13,042 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2018-10-04 09:22:13,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:13,549 INFO L93 Difference]: Finished difference Result 60 states and 100 transitions. [2018-10-04 09:22:13,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:13,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-04 09:22:13,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:13,564 INFO L225 Difference]: With dead ends: 60 [2018-10-04 09:22:13,565 INFO L226 Difference]: Without dead ends: 36 [2018-10-04 09:22:13,569 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:13,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-04 09:22:13,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-10-04 09:22:13,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-04 09:22:13,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 60 transitions. [2018-10-04 09:22:13,617 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 60 transitions. Word has length 16 [2018-10-04 09:22:13,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:13,617 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 60 transitions. [2018-10-04 09:22:13,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:13,618 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 60 transitions. [2018-10-04 09:22:13,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 09:22:13,619 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:13,619 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:13,620 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:13,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:13,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1787958207, now seen corresponding path program 1 times [2018-10-04 09:22:13,620 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:13,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:13,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:13,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:13,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:13,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:13,699 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:22:13,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:13,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:22:13,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:13,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:13,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:13,704 INFO L87 Difference]: Start difference. First operand 36 states and 60 transitions. Second operand 3 states. [2018-10-04 09:22:13,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:13,899 INFO L93 Difference]: Finished difference Result 87 states and 147 transitions. [2018-10-04 09:22:13,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:13,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-04 09:22:13,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:13,901 INFO L225 Difference]: With dead ends: 87 [2018-10-04 09:22:13,901 INFO L226 Difference]: Without dead ends: 52 [2018-10-04 09:22:13,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:13,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-04 09:22:13,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-10-04 09:22:13,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-04 09:22:13,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 86 transitions. [2018-10-04 09:22:13,916 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 86 transitions. Word has length 24 [2018-10-04 09:22:13,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:13,917 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 86 transitions. [2018-10-04 09:22:13,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:13,917 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 86 transitions. [2018-10-04 09:22:13,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-04 09:22:13,919 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:13,919 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:13,919 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:13,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:13,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1179694243, now seen corresponding path program 1 times [2018-10-04 09:22:13,920 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:13,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:13,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:13,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:13,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:14,004 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-04 09:22:14,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:14,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:22:14,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:14,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:14,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:14,006 INFO L87 Difference]: Start difference. First operand 52 states and 86 transitions. Second operand 3 states. [2018-10-04 09:22:14,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:14,247 INFO L93 Difference]: Finished difference Result 110 states and 183 transitions. [2018-10-04 09:22:14,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:14,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-04 09:22:14,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:14,250 INFO L225 Difference]: With dead ends: 110 [2018-10-04 09:22:14,250 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 09:22:14,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:14,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 09:22:14,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-10-04 09:22:14,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-04 09:22:14,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 95 transitions. [2018-10-04 09:22:14,265 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 95 transitions. Word has length 31 [2018-10-04 09:22:14,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:14,265 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 95 transitions. [2018-10-04 09:22:14,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:14,265 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 95 transitions. [2018-10-04 09:22:14,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-04 09:22:14,267 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:14,267 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:14,267 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:14,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:14,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1680558917, now seen corresponding path program 1 times [2018-10-04 09:22:14,268 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:14,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:14,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:14,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:14,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:14,372 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:22:14,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:14,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:22:14,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:14,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:14,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:14,374 INFO L87 Difference]: Start difference. First operand 59 states and 95 transitions. Second operand 3 states. [2018-10-04 09:22:14,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:14,679 INFO L93 Difference]: Finished difference Result 135 states and 220 transitions. [2018-10-04 09:22:14,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:14,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-04 09:22:14,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:14,682 INFO L225 Difference]: With dead ends: 135 [2018-10-04 09:22:14,682 INFO L226 Difference]: Without dead ends: 76 [2018-10-04 09:22:14,683 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:14,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-04 09:22:14,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-10-04 09:22:14,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-04 09:22:14,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 123 transitions. [2018-10-04 09:22:14,698 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 123 transitions. Word has length 31 [2018-10-04 09:22:14,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:14,698 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 123 transitions. [2018-10-04 09:22:14,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:14,699 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 123 transitions. [2018-10-04 09:22:14,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-04 09:22:14,700 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:14,700 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:14,701 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:14,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:14,701 INFO L82 PathProgramCache]: Analyzing trace with hash -2026096289, now seen corresponding path program 1 times [2018-10-04 09:22:14,701 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:14,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:14,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:14,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:14,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:14,792 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-04 09:22:14,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:14,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:22:14,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:14,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:14,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:14,794 INFO L87 Difference]: Start difference. First operand 76 states and 123 transitions. Second operand 3 states. [2018-10-04 09:22:15,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:15,215 INFO L93 Difference]: Finished difference Result 157 states and 255 transitions. [2018-10-04 09:22:15,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:15,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-10-04 09:22:15,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:15,218 INFO L225 Difference]: With dead ends: 157 [2018-10-04 09:22:15,219 INFO L226 Difference]: Without dead ends: 82 [2018-10-04 09:22:15,220 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:15,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-04 09:22:15,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-10-04 09:22:15,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-04 09:22:15,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 128 transitions. [2018-10-04 09:22:15,245 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 128 transitions. Word has length 37 [2018-10-04 09:22:15,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:15,248 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 128 transitions. [2018-10-04 09:22:15,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:15,248 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 128 transitions. [2018-10-04 09:22:15,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-04 09:22:15,250 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:15,250 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:15,251 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:15,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:15,252 INFO L82 PathProgramCache]: Analyzing trace with hash -865281023, now seen corresponding path program 1 times [2018-10-04 09:22:15,252 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:15,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:15,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:15,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:15,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:15,337 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-04 09:22:15,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:15,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:22:15,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:15,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:15,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:15,339 INFO L87 Difference]: Start difference. First operand 82 states and 128 transitions. Second operand 3 states. [2018-10-04 09:22:15,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:15,540 INFO L93 Difference]: Finished difference Result 168 states and 263 transitions. [2018-10-04 09:22:15,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:15,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-10-04 09:22:15,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:15,542 INFO L225 Difference]: With dead ends: 168 [2018-10-04 09:22:15,543 INFO L226 Difference]: Without dead ends: 87 [2018-10-04 09:22:15,544 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:15,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-04 09:22:15,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-10-04 09:22:15,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-04 09:22:15,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 130 transitions. [2018-10-04 09:22:15,559 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 130 transitions. Word has length 42 [2018-10-04 09:22:15,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:15,560 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 130 transitions. [2018-10-04 09:22:15,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:15,560 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 130 transitions. [2018-10-04 09:22:15,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-04 09:22:15,563 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:15,564 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:15,564 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:15,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:15,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1951176091, now seen corresponding path program 1 times [2018-10-04 09:22:15,564 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:15,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:15,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:15,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:15,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:15,626 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-04 09:22:15,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:15,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:22:15,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:15,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:15,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:15,628 INFO L87 Difference]: Start difference. First operand 87 states and 130 transitions. Second operand 3 states. [2018-10-04 09:22:15,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:15,861 INFO L93 Difference]: Finished difference Result 185 states and 276 transitions. [2018-10-04 09:22:15,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:15,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-10-04 09:22:15,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:15,863 INFO L225 Difference]: With dead ends: 185 [2018-10-04 09:22:15,863 INFO L226 Difference]: Without dead ends: 98 [2018-10-04 09:22:15,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:15,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-04 09:22:15,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-10-04 09:22:15,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-04 09:22:15,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 143 transitions. [2018-10-04 09:22:15,880 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 143 transitions. Word has length 45 [2018-10-04 09:22:15,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:15,881 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 143 transitions. [2018-10-04 09:22:15,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:15,881 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2018-10-04 09:22:15,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-04 09:22:15,883 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:15,883 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:15,883 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:15,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:15,884 INFO L82 PathProgramCache]: Analyzing trace with hash 2094171455, now seen corresponding path program 1 times [2018-10-04 09:22:15,884 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:15,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:15,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:15,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:15,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:15,972 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-04 09:22:15,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:15,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:22:15,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:15,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:15,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:15,975 INFO L87 Difference]: Start difference. First operand 98 states and 143 transitions. Second operand 3 states. [2018-10-04 09:22:16,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:16,220 INFO L93 Difference]: Finished difference Result 285 states and 418 transitions. [2018-10-04 09:22:16,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:16,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-10-04 09:22:16,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:16,222 INFO L225 Difference]: With dead ends: 285 [2018-10-04 09:22:16,223 INFO L226 Difference]: Without dead ends: 188 [2018-10-04 09:22:16,223 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:16,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-04 09:22:16,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-10-04 09:22:16,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-10-04 09:22:16,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 264 transitions. [2018-10-04 09:22:16,252 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 264 transitions. Word has length 46 [2018-10-04 09:22:16,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:16,252 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 264 transitions. [2018-10-04 09:22:16,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:16,252 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 264 transitions. [2018-10-04 09:22:16,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-04 09:22:16,254 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:16,254 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:16,255 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:16,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:16,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1814017687, now seen corresponding path program 1 times [2018-10-04 09:22:16,255 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:16,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:16,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:16,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:16,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:16,431 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-04 09:22:16,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:22:16,432 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:22:16,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:16,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:16,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:22:16,602 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-04 09:22:16,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 09:22:16,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-04 09:22:16,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 09:22:16,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 09:22:16,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-04 09:22:16,625 INFO L87 Difference]: Start difference. First operand 188 states and 264 transitions. Second operand 5 states. [2018-10-04 09:22:17,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:17,889 INFO L93 Difference]: Finished difference Result 695 states and 974 transitions. [2018-10-04 09:22:17,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:22:17,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-10-04 09:22:17,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:17,893 INFO L225 Difference]: With dead ends: 695 [2018-10-04 09:22:17,893 INFO L226 Difference]: Without dead ends: 486 [2018-10-04 09:22:17,895 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-04 09:22:17,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-10-04 09:22:17,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 280. [2018-10-04 09:22:17,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-10-04 09:22:17,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 381 transitions. [2018-10-04 09:22:17,945 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 381 transitions. Word has length 49 [2018-10-04 09:22:17,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:17,945 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 381 transitions. [2018-10-04 09:22:17,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 09:22:17,946 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 381 transitions. [2018-10-04 09:22:17,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-04 09:22:17,948 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:17,948 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:17,948 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:17,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:17,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1561426047, now seen corresponding path program 1 times [2018-10-04 09:22:17,949 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:17,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:17,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:17,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:17,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:18,017 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-10-04 09:22:18,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:18,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:22:18,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:18,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:18,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:18,019 INFO L87 Difference]: Start difference. First operand 280 states and 381 transitions. Second operand 3 states. [2018-10-04 09:22:18,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:18,222 INFO L93 Difference]: Finished difference Result 466 states and 642 transitions. [2018-10-04 09:22:18,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:18,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-10-04 09:22:18,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:18,225 INFO L225 Difference]: With dead ends: 466 [2018-10-04 09:22:18,225 INFO L226 Difference]: Without dead ends: 279 [2018-10-04 09:22:18,226 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:18,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-04 09:22:18,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2018-10-04 09:22:18,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-04 09:22:18,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 378 transitions. [2018-10-04 09:22:18,265 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 378 transitions. Word has length 68 [2018-10-04 09:22:18,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:18,265 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 378 transitions. [2018-10-04 09:22:18,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:18,265 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 378 transitions. [2018-10-04 09:22:18,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-04 09:22:18,266 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:18,267 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:18,268 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:18,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:18,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1819686273, now seen corresponding path program 1 times [2018-10-04 09:22:18,268 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:18,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:18,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:18,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:18,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:18,351 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-10-04 09:22:18,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:18,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:22:18,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:18,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:18,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:18,355 INFO L87 Difference]: Start difference. First operand 279 states and 378 transitions. Second operand 3 states. [2018-10-04 09:22:18,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:18,471 INFO L93 Difference]: Finished difference Result 464 states and 636 transitions. [2018-10-04 09:22:18,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:18,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2018-10-04 09:22:18,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:18,478 INFO L225 Difference]: With dead ends: 464 [2018-10-04 09:22:18,478 INFO L226 Difference]: Without dead ends: 278 [2018-10-04 09:22:18,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:18,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-10-04 09:22:18,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-10-04 09:22:18,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-10-04 09:22:18,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 374 transitions. [2018-10-04 09:22:18,519 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 374 transitions. Word has length 72 [2018-10-04 09:22:18,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:18,520 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 374 transitions. [2018-10-04 09:22:18,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:18,520 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 374 transitions. [2018-10-04 09:22:18,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-04 09:22:18,521 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:18,521 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:18,522 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:18,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:18,522 INFO L82 PathProgramCache]: Analyzing trace with hash 642028047, now seen corresponding path program 1 times [2018-10-04 09:22:18,522 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:18,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:18,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:18,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:18,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:18,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:18,592 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-10-04 09:22:18,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:18,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:22:18,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:18,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:18,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:18,594 INFO L87 Difference]: Start difference. First operand 278 states and 374 transitions. Second operand 3 states. [2018-10-04 09:22:18,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:18,723 INFO L93 Difference]: Finished difference Result 548 states and 739 transitions. [2018-10-04 09:22:18,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:18,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-10-04 09:22:18,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:18,726 INFO L225 Difference]: With dead ends: 548 [2018-10-04 09:22:18,726 INFO L226 Difference]: Without dead ends: 276 [2018-10-04 09:22:18,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:18,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-10-04 09:22:18,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2018-10-04 09:22:18,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-10-04 09:22:18,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 364 transitions. [2018-10-04 09:22:18,766 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 364 transitions. Word has length 77 [2018-10-04 09:22:18,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:18,766 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 364 transitions. [2018-10-04 09:22:18,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:18,766 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 364 transitions. [2018-10-04 09:22:18,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-04 09:22:18,768 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:18,768 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 6, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:18,768 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:18,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:18,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1765416395, now seen corresponding path program 1 times [2018-10-04 09:22:18,769 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:18,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:18,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:18,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:18,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:18,865 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-10-04 09:22:18,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:18,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:22:18,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:18,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:18,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:18,867 INFO L87 Difference]: Start difference. First operand 276 states and 364 transitions. Second operand 3 states. [2018-10-04 09:22:19,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:19,206 INFO L93 Difference]: Finished difference Result 543 states and 718 transitions. [2018-10-04 09:22:19,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:19,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-10-04 09:22:19,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:19,210 INFO L225 Difference]: With dead ends: 543 [2018-10-04 09:22:19,210 INFO L226 Difference]: Without dead ends: 274 [2018-10-04 09:22:19,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:19,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-10-04 09:22:19,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2018-10-04 09:22:19,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-10-04 09:22:19,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 354 transitions. [2018-10-04 09:22:19,253 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 354 transitions. Word has length 83 [2018-10-04 09:22:19,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:19,254 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 354 transitions. [2018-10-04 09:22:19,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:19,254 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 354 transitions. [2018-10-04 09:22:19,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-04 09:22:19,256 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:19,256 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 7, 6, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:19,256 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:19,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:19,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1105856767, now seen corresponding path program 1 times [2018-10-04 09:22:19,257 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:19,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:19,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:19,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:19,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:19,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:19,366 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-10-04 09:22:19,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:19,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:22:19,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:19,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:19,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:19,368 INFO L87 Difference]: Start difference. First operand 274 states and 354 transitions. Second operand 3 states. [2018-10-04 09:22:19,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:19,855 INFO L93 Difference]: Finished difference Result 543 states and 705 transitions. [2018-10-04 09:22:19,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:19,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2018-10-04 09:22:19,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:19,857 INFO L225 Difference]: With dead ends: 543 [2018-10-04 09:22:19,857 INFO L226 Difference]: Without dead ends: 277 [2018-10-04 09:22:19,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:19,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-10-04 09:22:19,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-10-04 09:22:19,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-04 09:22:19,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 352 transitions. [2018-10-04 09:22:19,891 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 352 transitions. Word has length 90 [2018-10-04 09:22:19,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:19,892 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 352 transitions. [2018-10-04 09:22:19,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:19,892 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 352 transitions. [2018-10-04 09:22:19,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-04 09:22:19,893 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:19,893 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 7, 6, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:19,894 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:19,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:19,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1448402059, now seen corresponding path program 1 times [2018-10-04 09:22:19,894 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:19,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:19,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:19,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:19,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:19,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:20,001 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-10-04 09:22:20,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:20,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:22:20,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:20,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:20,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:20,002 INFO L87 Difference]: Start difference. First operand 277 states and 352 transitions. Second operand 3 states. [2018-10-04 09:22:20,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:20,429 INFO L93 Difference]: Finished difference Result 576 states and 736 transitions. [2018-10-04 09:22:20,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:20,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-10-04 09:22:20,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:20,433 INFO L225 Difference]: With dead ends: 576 [2018-10-04 09:22:20,433 INFO L226 Difference]: Without dead ends: 307 [2018-10-04 09:22:20,434 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:20,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-10-04 09:22:20,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-10-04 09:22:20,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-10-04 09:22:20,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 382 transitions. [2018-10-04 09:22:20,472 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 382 transitions. Word has length 98 [2018-10-04 09:22:20,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:20,473 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 382 transitions. [2018-10-04 09:22:20,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:20,473 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 382 transitions. [2018-10-04 09:22:20,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-04 09:22:20,474 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:20,474 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:20,475 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:20,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:20,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1388837957, now seen corresponding path program 1 times [2018-10-04 09:22:20,475 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:20,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:20,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:20,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:20,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:20,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:20,595 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-10-04 09:22:20,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:20,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:22:20,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:20,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:20,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:20,597 INFO L87 Difference]: Start difference. First operand 307 states and 382 transitions. Second operand 3 states. [2018-10-04 09:22:20,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:20,915 INFO L93 Difference]: Finished difference Result 606 states and 764 transitions. [2018-10-04 09:22:20,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:20,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-10-04 09:22:20,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:20,921 INFO L225 Difference]: With dead ends: 606 [2018-10-04 09:22:20,921 INFO L226 Difference]: Without dead ends: 403 [2018-10-04 09:22:20,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:20,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-10-04 09:22:20,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-10-04 09:22:20,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-04 09:22:20,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 505 transitions. [2018-10-04 09:22:20,970 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 505 transitions. Word has length 108 [2018-10-04 09:22:20,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:20,971 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 505 transitions. [2018-10-04 09:22:20,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:20,971 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 505 transitions. [2018-10-04 09:22:20,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-04 09:22:20,973 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:20,974 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 12, 11, 10, 9, 8, 7, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:20,974 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:20,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:20,974 INFO L82 PathProgramCache]: Analyzing trace with hash 816352441, now seen corresponding path program 1 times [2018-10-04 09:22:20,974 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:20,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:20,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:20,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:20,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:21,109 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2018-10-04 09:22:21,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:21,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:22:21,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:21,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:21,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:21,111 INFO L87 Difference]: Start difference. First operand 403 states and 505 transitions. Second operand 3 states. [2018-10-04 09:22:21,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:21,351 INFO L93 Difference]: Finished difference Result 798 states and 1001 transitions. [2018-10-04 09:22:21,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:21,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2018-10-04 09:22:21,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:21,355 INFO L225 Difference]: With dead ends: 798 [2018-10-04 09:22:21,355 INFO L226 Difference]: Without dead ends: 403 [2018-10-04 09:22:21,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:21,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-10-04 09:22:21,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-10-04 09:22:21,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-04 09:22:21,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 486 transitions. [2018-10-04 09:22:21,408 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 486 transitions. Word has length 148 [2018-10-04 09:22:21,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:21,409 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 486 transitions. [2018-10-04 09:22:21,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:21,409 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 486 transitions. [2018-10-04 09:22:21,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-04 09:22:21,411 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:21,411 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 16, 15, 14, 12, 10, 8, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:22:21,412 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:21,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:21,412 INFO L82 PathProgramCache]: Analyzing trace with hash 155947305, now seen corresponding path program 1 times [2018-10-04 09:22:21,412 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:21,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:21,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:21,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:21,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:21,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1266 backedges. 741 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-10-04 09:22:21,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:22:21,610 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:22:21,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:21,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:22:21,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1266 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2018-10-04 09:22:21,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 09:22:21,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-04 09:22:21,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 09:22:21,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 09:22:21,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-04 09:22:21,923 INFO L87 Difference]: Start difference. First operand 403 states and 486 transitions. Second operand 5 states. [2018-10-04 09:22:22,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:22,134 INFO L93 Difference]: Finished difference Result 643 states and 775 transitions. [2018-10-04 09:22:22,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 09:22:22,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 191 [2018-10-04 09:22:22,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:22,139 INFO L225 Difference]: With dead ends: 643 [2018-10-04 09:22:22,139 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 09:22:22,140 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-04 09:22:22,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 09:22:22,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 09:22:22,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 09:22:22,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 09:22:22,141 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 191 [2018-10-04 09:22:22,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:22,141 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 09:22:22,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 09:22:22,142 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 09:22:22,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 09:22:22,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 09:22:22,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:22,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:22:24,621 WARN L178 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-10-04 09:22:25,003 WARN L178 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-10-04 09:22:25,245 WARN L178 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-10-04 09:22:25,419 WARN L178 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2018-10-04 09:22:25,680 WARN L178 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-10-04 09:22:25,967 WARN L178 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2018-10-04 09:22:26,113 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2018-10-04 09:22:26,361 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2018-10-04 09:22:26,531 WARN L178 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 26 [2018-10-04 09:22:26,659 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2018-10-04 09:22:26,880 WARN L178 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 29 [2018-10-04 09:22:27,032 WARN L178 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-10-04 09:22:27,061 INFO L421 ceAbstractionStarter]: At program point L444(lines 441 466) the Hoare annotation is: (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) [2018-10-04 09:22:27,062 INFO L421 ceAbstractionStarter]: At program point L337(lines 337 355) the Hoare annotation is: (let ((.cse1 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse1 .cse2 .cse3) (and .cse4 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse1 .cse2 .cse3) (and .cse4 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-10-04 09:22:27,062 INFO L421 ceAbstractionStarter]: At program point L465(lines 465 487) the Hoare annotation is: (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) [2018-10-04 09:22:27,062 INFO L421 ceAbstractionStarter]: At program point L457(lines 457 478) the Hoare annotation is: (and (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) [2018-10-04 09:22:27,063 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 516) no Hoare annotation was computed. [2018-10-04 09:22:27,063 INFO L421 ceAbstractionStarter]: At program point L511(lines 511 515) the Hoare annotation is: false [2018-10-04 09:22:27,063 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 517) no Hoare annotation was computed. [2018-10-04 09:22:27,064 INFO L421 ceAbstractionStarter]: At program point L317(lines 317 334) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse2 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse1 .cse2) (and .cse3 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse1 .cse2) (and .cse3 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-10-04 09:22:27,064 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 517) no Hoare annotation was computed. [2018-10-04 09:22:27,064 INFO L421 ceAbstractionStarter]: At program point L408(lines 408 420) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 8576) .cse1 .cse2 .cse3) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) .cse3))) [2018-10-04 09:22:27,064 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 517) no Hoare annotation was computed. [2018-10-04 09:22:27,064 INFO L421 ceAbstractionStarter]: At program point L285(lines 248 285) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse2) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse2) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-10-04 09:22:27,064 INFO L421 ceAbstractionStarter]: At program point L281(lines 281 300) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse2) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse2) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-10-04 09:22:27,064 INFO L421 ceAbstractionStarter]: At program point L393(lines 393 405) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 8576) .cse1 .cse2 .cse3) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) .cse3))) [2018-10-04 09:22:27,065 INFO L421 ceAbstractionStarter]: At program point L360(lines 360 371) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (.cse2 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse5 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse2 .cse3 .cse4 .cse5) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse2 .cse3 .cse4 .cse5))) [2018-10-04 09:22:27,065 INFO L421 ceAbstractionStarter]: At program point L261(lines 261 277) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse2) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse2) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-10-04 09:22:27,065 INFO L421 ceAbstractionStarter]: At program point L480(lines 477 490) the Hoare annotation is: (and (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) [2018-10-04 09:22:27,065 INFO L421 ceAbstractionStarter]: At program point L505(lines 276 505) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse2) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse2) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-10-04 09:22:27,065 INFO L421 ceAbstractionStarter]: At program point L373(lines 373 390) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)))) [2018-10-04 09:22:27,066 INFO L421 ceAbstractionStarter]: At program point L435(lines 435 458) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (and .cse0 .cse1 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~6))))) [2018-10-04 09:22:27,066 INFO L421 ceAbstractionStarter]: At program point L303(lines 303 314) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) .cse0) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse2) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse2) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-10-04 09:22:27,066 INFO L421 ceAbstractionStarter]: At program point L431(lines 431 442) the Hoare annotation is: (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) [2018-10-04 09:22:27,066 INFO L421 ceAbstractionStarter]: At program point L489(lines 489 512) the Hoare annotation is: (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) [2018-10-04 09:22:27,066 INFO L421 ceAbstractionStarter]: At program point L423(lines 423 432) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse0 .cse1 .cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse3) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) .cse3))) [2018-10-04 09:22:27,067 INFO L421 ceAbstractionStarter]: At program point L514(lines 486 514) the Hoare annotation is: (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) [2018-10-04 09:22:27,086 INFO L202 PluginConnector]: Adding new model s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:22:27 BoogieIcfgContainer [2018-10-04 09:22:27,086 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:22:27,087 INFO L168 Benchmark]: Toolchain (without parser) took 15320.99 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 118.5 MB). Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 169.3 MB). Peak memory consumption was 588.7 MB. Max. memory is 7.1 GB. [2018-10-04 09:22:27,088 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:22:27,089 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.90 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:22:27,089 INFO L168 Benchmark]: Boogie Preprocessor took 63.42 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:22:27,090 INFO L168 Benchmark]: RCFGBuilder took 776.25 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-04 09:22:27,091 INFO L168 Benchmark]: TraceAbstraction took 14421.91 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 118.5 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 137.6 MB). Peak memory consumption was 557.0 MB. Max. memory is 7.1 GB. [2018-10-04 09:22:27,095 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 54.90 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 63.42 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 776.25 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14421.91 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 118.5 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 137.6 MB). Peak memory consumption was 557.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 516]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 276]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: ((((((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && !(8448 == ssl3_accept_~s__state~6)) && ssl3_accept_~s__state~6 <= 8576) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8512 == ssl3_accept_~s__state~6)) || (8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3)) || ((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 486]: Loop Invariant Derived loop invariant: 8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3 - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 477]: Loop Invariant Derived loop invariant: (((((!(8640 == ssl3_accept_~s__state~6) && !(8448 == ssl3_accept_~s__state~6)) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8672 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 3) && !(8512 == ssl3_accept_~s__state~6) - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3) - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: ((((((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && !(8448 == ssl3_accept_~s__state~6)) && ssl3_accept_~s__state~6 <= 8576) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8512 == ssl3_accept_~s__state~6)) || (8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3)) || ((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: (((((!(8640 == ssl3_accept_~s__state~6) && !(8448 == ssl3_accept_~s__state~6)) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8672 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6) - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: 8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3 - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2)) || (((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8672 == ssl3_accept_~s__state~6)) && !(8656 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 360]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || ((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || ((((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || ((!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 423]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((((((!(8640 == ssl3_accept_~s__state~6) && !(8448 == ssl3_accept_~s__state~6)) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8672 == ssl3_accept_~s__state~6)) && !(8656 == ssl3_accept_~s__state~6)) && !(8512 == ssl3_accept_~s__state~6))) || ((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 441]: Loop Invariant Derived loop invariant: (((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8672 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8656 == ssl3_accept_~s__state~6)) && !(8512 == ssl3_accept_~s__state~6) - InvariantResult [Line: 337]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || (((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || (((!(8448 == ssl3_accept_~s__state~6) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 465]: Loop Invariant Derived loop invariant: 8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3 - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 <= 3)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~blastFlag~6 <= 3) && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 431]: Loop Invariant Derived loop invariant: (((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8672 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8656 == ssl3_accept_~s__state~6)) && !(8512 == ssl3_accept_~s__state~6) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 1 error locations. SAFE Result, 14.3s OverallTime, 18 OverallIterations, 19 TraceHistogramMax, 6.2s AutomataDifference, 0.0s DeadEndRemovalTime, 4.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 507 SDtfs, 212 SDslu, 262 SDs, 0 SdLazy, 683 SolverSat, 191 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 295 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=403occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 206 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 21 PreInvPairs, 292 NumberOfFragments, 760 HoareAnnotationTreeSize, 21 FomulaSimplifications, 12583 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 21 FomulaSimplificationsInter, 2497 FormulaSimplificationTreeSizeReductionInter, 4.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1496 NumberOfCodeBlocks, 1496 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1476 ConstructedInterpolants, 0 QuantifiedInterpolants, 201255 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1211 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 20 InterpolantComputations, 18 PerfectInterpolantSequences, 5308/5324 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_1.cil.c_23.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_09-22-27-114.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_1.cil.c_23.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_09-22-27-114.csv Received shutdown request...