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_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_4.cil.c_14.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:53:21,402 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:53:21,404 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:53:21,419 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:53:21,419 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:53:21,420 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:53:21,422 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:53:21,423 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:53:21,426 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:53:21,429 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:53:21,430 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:53:21,430 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:53:21,431 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:53:21,436 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:53:21,437 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:53:21,438 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:53:21,443 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:53:21,446 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:53:21,448 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:53:21,450 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:53:21,451 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:53:21,452 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:53:21,454 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:53:21,454 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:53:21,454 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:53:21,455 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:53:21,456 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:53:21,457 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:53:21,458 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:53:21,459 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:53:21,459 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:53:21,460 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:53:21,460 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:53:21,460 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:53:21,462 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:53:21,463 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:53:21,463 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 12:53:21,487 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:53:21,488 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:53:21,488 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:53:21,489 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:53:21,490 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:53:21,490 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:53:21,490 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:53:21,491 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:53:21,492 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:53:21,492 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:53:21,492 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:53:21,492 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:53:21,493 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:53:21,493 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:53:21,493 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:53:21,493 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:53:21,493 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:53:21,493 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:53:21,495 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:53:21,495 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:53:21,495 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:53:21,495 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:53:21,496 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:53:21,496 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:53:21,496 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:53:21,496 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:53:21,496 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:53:21,497 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:53:21,497 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:53:21,497 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:53:21,497 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 12:53:21,540 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:53:21,553 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:53:21,560 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:53:21,562 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:53:21,562 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:53:21,563 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_4.cil.c_14.bpl [2018-10-04 12:53:21,564 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_4.cil.c_14.bpl' [2018-10-04 12:53:21,663 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:53:21,665 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:53:21,665 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:53:21,666 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:53:21,666 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:53:21,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:21" (1/1) ... [2018-10-04 12:53:21,702 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:21" (1/1) ... [2018-10-04 12:53:21,709 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:53:21,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:53:21,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:53:21,711 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:53:21,722 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:21" (1/1) ... [2018-10-04 12:53:21,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:21" (1/1) ... [2018-10-04 12:53:21,727 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:21" (1/1) ... [2018-10-04 12:53:21,727 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:21" (1/1) ... [2018-10-04 12:53:21,741 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:21" (1/1) ... [2018-10-04 12:53:21,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:21" (1/1) ... [2018-10-04 12:53:21,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:21" (1/1) ... [2018-10-04 12:53:21,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:53:21,761 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:53:21,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:53:21,761 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:53:21,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:21" (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 12:53:21,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:53:21,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:53:22,438 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:53:22,439 INFO L202 PluginConnector]: Adding new model s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:53:22 BoogieIcfgContainer [2018-10-04 12:53:22,439 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:53:22,440 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:53:22,440 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:53:22,443 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:53:22,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:21" (1/2) ... [2018-10-04 12:53:22,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232cf55b and model type s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:53:22, skipping insertion in model container [2018-10-04 12:53:22,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:53:22" (2/2) ... [2018-10-04 12:53:22,447 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_4.cil.c_14.bpl [2018-10-04 12:53:22,456 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:53:22,465 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:53:22,514 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:53:22,515 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:53:22,515 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:53:22,515 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:53:22,515 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:53:22,515 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:53:22,515 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:53:22,516 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:53:22,516 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:53:22,531 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-10-04 12:53:22,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:53:22,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:22,539 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:22,540 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:22,547 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:22,547 INFO L82 PathProgramCache]: Analyzing trace with hash 212045975, now seen corresponding path program 1 times [2018-10-04 12:53:22,549 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:22,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:22,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:22,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:22,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:22,783 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 12:53:22,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:22,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:53:22,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:22,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:22,805 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:22,807 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2018-10-04 12:53:22,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:22,912 INFO L93 Difference]: Finished difference Result 27 states and 39 transitions. [2018-10-04 12:53:22,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:22,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-10-04 12:53:22,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:22,948 INFO L225 Difference]: With dead ends: 27 [2018-10-04 12:53:22,948 INFO L226 Difference]: Without dead ends: 14 [2018-10-04 12:53:22,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:22,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-04 12:53:22,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-10-04 12:53:22,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 12:53:22,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-10-04 12:53:22,986 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 8 [2018-10-04 12:53:22,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:22,986 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-10-04 12:53:22,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:22,987 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2018-10-04 12:53:22,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:53:22,987 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:22,988 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:22,988 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:22,988 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:22,989 INFO L82 PathProgramCache]: Analyzing trace with hash -251001873, now seen corresponding path program 1 times [2018-10-04 12:53:22,989 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:22,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:22,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:22,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:22,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:23,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:53:23,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:23,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:23,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:23,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:23,152 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:23,152 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 3 states. [2018-10-04 12:53:23,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:23,257 INFO L93 Difference]: Finished difference Result 29 states and 41 transitions. [2018-10-04 12:53:23,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:23,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-10-04 12:53:23,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:23,261 INFO L225 Difference]: With dead ends: 29 [2018-10-04 12:53:23,261 INFO L226 Difference]: Without dead ends: 18 [2018-10-04 12:53:23,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:23,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-04 12:53:23,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-10-04 12:53:23,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 12:53:23,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2018-10-04 12:53:23,267 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 11 [2018-10-04 12:53:23,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:23,268 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2018-10-04 12:53:23,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:23,268 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2018-10-04 12:53:23,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:53:23,269 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:23,269 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:23,270 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:23,270 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:23,270 INFO L82 PathProgramCache]: Analyzing trace with hash -129109843, now seen corresponding path program 1 times [2018-10-04 12:53:23,270 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:23,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:23,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:23,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:23,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:23,385 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:53:23,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:23,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:23,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:23,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:23,387 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:23,387 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand 3 states. [2018-10-04 12:53:23,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:23,479 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2018-10-04 12:53:23,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:23,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-04 12:53:23,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:23,481 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:53:23,481 INFO L226 Difference]: Without dead ends: 24 [2018-10-04 12:53:23,481 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:23,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-04 12:53:23,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-04 12:53:23,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:53:23,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2018-10-04 12:53:23,488 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 15 [2018-10-04 12:53:23,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:23,488 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-10-04 12:53:23,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:23,489 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2018-10-04 12:53:23,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 12:53:23,490 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:23,490 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:23,490 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:23,490 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:23,491 INFO L82 PathProgramCache]: Analyzing trace with hash 817687483, now seen corresponding path program 1 times [2018-10-04 12:53:23,491 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:23,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:23,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:23,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:23,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:23,605 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 12:53:23,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:23,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:23,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:23,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:23,607 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:23,607 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 3 states. [2018-10-04 12:53:23,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:23,719 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2018-10-04 12:53:23,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:23,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-04 12:53:23,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:23,721 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:53:23,721 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:53:23,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:23,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:53:23,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-10-04 12:53:23,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:53:23,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2018-10-04 12:53:23,731 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 23 [2018-10-04 12:53:23,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:23,732 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2018-10-04 12:53:23,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:23,732 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2018-10-04 12:53:23,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 12:53:23,733 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:23,733 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:23,734 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:23,734 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:23,734 INFO L82 PathProgramCache]: Analyzing trace with hash 424660473, now seen corresponding path program 1 times [2018-10-04 12:53:23,734 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:23,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:23,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:23,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:23,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:23,865 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:53:23,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:23,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:23,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:23,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:23,868 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:23,868 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand 3 states. [2018-10-04 12:53:23,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:23,935 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2018-10-04 12:53:23,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:23,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-04 12:53:23,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:23,936 INFO L225 Difference]: With dead ends: 62 [2018-10-04 12:53:23,937 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:53:23,937 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:23,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:53:23,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-04 12:53:23,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-04 12:53:23,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2018-10-04 12:53:23,950 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 23 [2018-10-04 12:53:23,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:23,951 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2018-10-04 12:53:23,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:23,951 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2018-10-04 12:53:23,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-04 12:53:23,952 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:23,952 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:23,953 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:23,953 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:23,953 INFO L82 PathProgramCache]: Analyzing trace with hash 944888583, now seen corresponding path program 1 times [2018-10-04 12:53:23,953 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:23,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:23,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:23,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:23,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:24,079 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-04 12:53:24,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:24,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:24,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:24,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:24,080 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:24,080 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 3 states. [2018-10-04 12:53:24,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:24,214 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2018-10-04 12:53:24,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:24,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-04 12:53:24,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:24,219 INFO L225 Difference]: With dead ends: 75 [2018-10-04 12:53:24,219 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:53:24,220 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:24,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:53:24,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-10-04 12:53:24,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-04 12:53:24,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2018-10-04 12:53:24,229 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 31 [2018-10-04 12:53:24,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:24,230 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-10-04 12:53:24,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:24,230 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2018-10-04 12:53:24,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-04 12:53:24,231 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:24,231 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:24,232 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:24,232 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:24,232 INFO L82 PathProgramCache]: Analyzing trace with hash -680849109, now seen corresponding path program 1 times [2018-10-04 12:53:24,232 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:24,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:24,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:24,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:24,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:24,302 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-04 12:53:24,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:24,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:24,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:24,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:24,304 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:24,304 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand 3 states. [2018-10-04 12:53:24,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:24,410 INFO L93 Difference]: Finished difference Result 97 states and 121 transitions. [2018-10-04 12:53:24,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:24,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-10-04 12:53:24,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:24,412 INFO L225 Difference]: With dead ends: 97 [2018-10-04 12:53:24,412 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:53:24,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:24,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:53:24,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-10-04 12:53:24,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-04 12:53:24,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2018-10-04 12:53:24,422 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 38 [2018-10-04 12:53:24,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:24,422 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2018-10-04 12:53:24,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:24,423 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-10-04 12:53:24,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-04 12:53:24,424 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:24,424 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:24,424 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:24,424 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:24,425 INFO L82 PathProgramCache]: Analyzing trace with hash -625573959, now seen corresponding path program 1 times [2018-10-04 12:53:24,425 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:24,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:24,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:24,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:24,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:24,635 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 66 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-04 12:53:24,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:53:24,636 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 12:53:24,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:24,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:53:25,066 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 66 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-04 12:53:25,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:53:25,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 12:53:25,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:53:25,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:53:25,100 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:25,101 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 4 states. [2018-10-04 12:53:25,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:25,641 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2018-10-04 12:53:25,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:53:25,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-10-04 12:53:25,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:25,643 INFO L225 Difference]: With dead ends: 104 [2018-10-04 12:53:25,643 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:53:25,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.1s impTime 3 [2018-10-04 12:53:25,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:53:25,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:53:25,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:53:25,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:53:25,645 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2018-10-04 12:53:25,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:25,645 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:53:25,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:53:25,645 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:53:25,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:53:25,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:53:26,226 WARN L178 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 21 [2018-10-04 12:53:26,404 WARN L178 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 24 [2018-10-04 12:53:26,732 WARN L178 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 24 [2018-10-04 12:53:26,864 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 391) no Hoare annotation was computed. [2018-10-04 12:53:26,865 INFO L421 ceAbstractionStarter]: At program point L349(lines 349 364) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) [2018-10-04 12:53:26,865 INFO L421 ceAbstractionStarter]: At program point L374(lines 374 389) the Hoare annotation is: false [2018-10-04 12:53:26,865 INFO L421 ceAbstractionStarter]: At program point L339(lines 339 350) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640)))) [2018-10-04 12:53:26,865 INFO L421 ceAbstractionStarter]: At program point L368(lines 363 383) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) [2018-10-04 12:53:26,865 INFO L421 ceAbstractionStarter]: At program point L271(lines 271 287) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8464)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8496)) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640)))) [2018-10-04 12:53:26,865 INFO L421 ceAbstractionStarter]: At program point L321(lines 321 329) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640)))) [2018-10-04 12:53:26,866 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 391) no Hoare annotation was computed. [2018-10-04 12:53:26,866 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 391) no Hoare annotation was computed. [2018-10-04 12:53:26,866 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 390) no Hoare annotation was computed. [2018-10-04 12:53:26,866 INFO L421 ceAbstractionStarter]: At program point L295(lines 258 295) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8464)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8496)) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640)))) [2018-10-04 12:53:26,866 INFO L421 ceAbstractionStarter]: At program point L357(lines 357 375) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) [2018-10-04 12:53:26,867 INFO L421 ceAbstractionStarter]: At program point L388(lines 286 388) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8496)) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640)))) [2018-10-04 12:53:26,867 INFO L421 ceAbstractionStarter]: At program point L291(lines 291 310) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8496)) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640)))) [2018-10-04 12:53:26,880 INFO L202 PluginConnector]: Adding new model s3_srvr_4.cil.c_14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:53:26 BoogieIcfgContainer [2018-10-04 12:53:26,880 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:53:26,881 INFO L168 Benchmark]: Toolchain (without parser) took 5217.52 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 224.7 MB). Peak memory consumption was 224.7 MB. Max. memory is 7.1 GB. [2018-10-04 12:53:26,883 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.27 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 12:53:26,884 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.39 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 12:53:26,884 INFO L168 Benchmark]: Boogie Preprocessor took 50.30 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 12:53:26,885 INFO L168 Benchmark]: RCFGBuilder took 678.37 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 12:53:26,886 INFO L168 Benchmark]: TraceAbstraction took 4440.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 193.0 MB). Peak memory consumption was 193.0 MB. Max. memory is 7.1 GB. [2018-10-04 12:53:26,892 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.27 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 44.39 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 50.30 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 678.37 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 4440.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 193.0 MB). Peak memory consumption was 193.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 390]: 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: 271]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) || (ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 == 8464)) || (ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 == 8496)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__state~5 <= 8640) - InvariantResult [Line: 286]: Loop Invariant Derived loop invariant: (((ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) || (ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 == 8496)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__state~5 <= 8640) - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: ((ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__state~5 <= 8640) - InvariantResult [Line: 349]: Loop Invariant Derived loop invariant: ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656 - InvariantResult [Line: 258]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) || (ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 == 8464)) || (ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 == 8496)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__state~5 <= 8640) - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: ((ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__state~5 <= 8640) - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 291]: Loop Invariant Derived loop invariant: (((ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) || (ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 == 8496)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__state~5 <= 8640) - InvariantResult [Line: 363]: Loop Invariant Derived loop invariant: ssl3_accept_~blastFlag~5 <= 3 && ssl3_accept_~s__state~5 == 8656 - InvariantResult [Line: 357]: Loop Invariant Derived loop invariant: ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. SAFE Result, 4.3s OverallTime, 8 OverallIterations, 7 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 125 SDtfs, 15 SDslu, 52 SDs, 0 SdLazy, 119 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=7, 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.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 61 NumberOfFragments, 214 HoareAnnotationTreeSize, 10 FomulaSimplifications, 304 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 36 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 235 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 10624 SizeOfPredicates, 2 NumberOfNonLiveVariables, 381 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 327/337 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_4.cil.c_14.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-53-26-909.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_4.cil.c_14.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-53-26-909.csv Received shutdown request...