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/real-life/s3_clnt_1_Safe.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:41:56,467 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:41:56,470 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:41:56,482 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:41:56,482 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:41:56,483 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:41:56,485 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:41:56,487 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:41:56,488 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:41:56,489 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:41:56,490 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:41:56,490 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:41:56,491 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:41:56,492 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:41:56,493 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:41:56,494 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:41:56,495 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:41:56,497 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:41:56,499 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:41:56,501 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:41:56,502 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:41:56,503 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:41:56,506 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:41:56,506 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:41:56,507 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:41:56,508 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:41:56,509 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:41:56,509 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:41:56,514 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:41:56,518 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:41:56,518 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:41:56,519 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:41:56,519 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:41:56,519 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:41:56,520 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:41:56,521 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:41:56,521 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:41:56,536 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:41:56,537 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:41:56,538 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:41:56,538 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:41:56,538 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:41:56,539 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:41:56,539 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:41:56,539 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:41:56,539 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:41:56,540 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:41:56,540 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:41:56,540 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:41:56,540 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:41:56,540 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:41:56,540 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:41:56,541 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:41:56,541 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:41:56,541 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:41:56,541 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:41:56,541 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:41:56,542 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:41:56,542 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:41:56,542 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:41:56,542 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:41:56,542 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:41:56,543 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:41:56,543 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:41:56,543 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:41:56,543 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:41:56,543 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:41:56,543 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 12:41:56,600 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:41:56,621 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:41:56,627 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:41:56,629 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:41:56,629 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:41:56,630 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/s3_clnt_1_Safe.bpl [2018-10-04 12:41:56,631 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/s3_clnt_1_Safe.bpl' [2018-10-04 12:41:56,732 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:41:56,734 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:41:56,735 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:41:56,735 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:41:56,736 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:41:56,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:56" (1/1) ... [2018-10-04 12:41:56,775 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:56" (1/1) ... [2018-10-04 12:41:56,790 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 12:41:56,790 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 12:41:56,791 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 12:41:56,794 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:41:56,794 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:41:56,794 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:41:56,795 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:41:56,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:56" (1/1) ... [2018-10-04 12:41:56,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:56" (1/1) ... [2018-10-04 12:41:56,809 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:56" (1/1) ... [2018-10-04 12:41:56,810 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:56" (1/1) ... [2018-10-04 12:41:56,820 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:56" (1/1) ... [2018-10-04 12:41:56,832 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:56" (1/1) ... [2018-10-04 12:41:56,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:56" (1/1) ... [2018-10-04 12:41:56,840 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:41:56,841 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:41:56,841 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:41:56,841 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:41:56,842 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:56" (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:41:56,913 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-10-04 12:41:56,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-10-04 12:41:57,071 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-10-04 12:41:57,072 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-10-04 12:41:58,051 INFO L338 CfgBuilder]: Using library mode [2018-10-04 12:41:58,052 INFO L202 PluginConnector]: Adding new model s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:41:58 BoogieIcfgContainer [2018-10-04 12:41:58,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:41:58,057 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:41:58,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:41:58,061 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:41:58,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:56" (1/2) ... [2018-10-04 12:41:58,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@635adf19 and model type s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:41:58, skipping insertion in model container [2018-10-04 12:41:58,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:41:58" (2/2) ... [2018-10-04 12:41:58,072 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_1_Safe.bpl [2018-10-04 12:41:58,082 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:41:58,095 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:41:58,160 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:41:58,161 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:41:58,161 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:41:58,161 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:41:58,161 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:41:58,161 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:41:58,161 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:41:58,162 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:41:58,162 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:41:58,193 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2018-10-04 12:41:58,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 12:41:58,205 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:41:58,206 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:41:58,207 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:41:58,214 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:41:58,214 INFO L82 PathProgramCache]: Analyzing trace with hash 2094316450, now seen corresponding path program 1 times [2018-10-04 12:41:58,216 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:41:58,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:41:58,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:58,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:41:58,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:58,430 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:41:58,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:41:58,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:41:58,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:41:58,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:41:58,458 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:41:58,461 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 3 states. [2018-10-04 12:41:58,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:41:58,719 INFO L93 Difference]: Finished difference Result 363 states and 621 transitions. [2018-10-04 12:41:58,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:41:58,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-04 12:41:58,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:41:58,744 INFO L225 Difference]: With dead ends: 363 [2018-10-04 12:41:58,744 INFO L226 Difference]: Without dead ends: 214 [2018-10-04 12:41:58,748 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:41:58,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-10-04 12:41:58,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2018-10-04 12:41:58,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-10-04 12:41:58,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 320 transitions. [2018-10-04 12:41:58,809 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 320 transitions. Word has length 24 [2018-10-04 12:41:58,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:41:58,810 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 320 transitions. [2018-10-04 12:41:58,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:41:58,811 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 320 transitions. [2018-10-04 12:41:58,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-04 12:41:58,814 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:41:58,814 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:41:58,815 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:41:58,815 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:41:58,815 INFO L82 PathProgramCache]: Analyzing trace with hash 59798678, now seen corresponding path program 1 times [2018-10-04 12:41:58,816 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:41:58,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:41:58,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:58,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:41:58,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:58,889 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:41:58,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:41:58,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:41:58,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:41:58,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:41:58,893 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:41:58,893 INFO L87 Difference]: Start difference. First operand 214 states and 320 transitions. Second operand 3 states. [2018-10-04 12:41:59,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:41:59,426 INFO L93 Difference]: Finished difference Result 466 states and 703 transitions. [2018-10-04 12:41:59,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:41:59,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-10-04 12:41:59,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:41:59,435 INFO L225 Difference]: With dead ends: 466 [2018-10-04 12:41:59,439 INFO L226 Difference]: Without dead ends: 258 [2018-10-04 12:41:59,441 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:41:59,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-10-04 12:41:59,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 250. [2018-10-04 12:41:59,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-10-04 12:41:59,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 366 transitions. [2018-10-04 12:41:59,485 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 366 transitions. Word has length 39 [2018-10-04 12:41:59,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:41:59,489 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 366 transitions. [2018-10-04 12:41:59,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:41:59,490 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 366 transitions. [2018-10-04 12:41:59,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-04 12:41:59,496 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:41:59,497 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:41:59,497 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:41:59,497 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:41:59,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1333096252, now seen corresponding path program 1 times [2018-10-04 12:41:59,498 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:41:59,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:41:59,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:59,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:41:59,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:59,621 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-04 12:41:59,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:41:59,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:41:59,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:41:59,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:41:59,622 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:41:59,623 INFO L87 Difference]: Start difference. First operand 250 states and 366 transitions. Second operand 3 states. [2018-10-04 12:41:59,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:41:59,995 INFO L93 Difference]: Finished difference Result 598 states and 902 transitions. [2018-10-04 12:41:59,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:41:59,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2018-10-04 12:41:59,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:00,000 INFO L225 Difference]: With dead ends: 598 [2018-10-04 12:42:00,000 INFO L226 Difference]: Without dead ends: 352 [2018-10-04 12:42:00,002 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:42:00,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-10-04 12:42:00,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 334. [2018-10-04 12:42:00,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-10-04 12:42:00,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 468 transitions. [2018-10-04 12:42:00,022 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 468 transitions. Word has length 57 [2018-10-04 12:42:00,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:00,023 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 468 transitions. [2018-10-04 12:42:00,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:42:00,023 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 468 transitions. [2018-10-04 12:42:00,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-04 12:42:00,026 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:00,026 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:00,026 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:00,027 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:00,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1199082746, now seen corresponding path program 1 times [2018-10-04 12:42:00,027 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:00,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:00,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:00,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:00,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:00,114 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-04 12:42:00,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:00,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:42:00,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:42:00,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:42:00,116 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:00,116 INFO L87 Difference]: Start difference. First operand 334 states and 468 transitions. Second operand 3 states. [2018-10-04 12:42:00,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:00,369 INFO L93 Difference]: Finished difference Result 710 states and 1007 transitions. [2018-10-04 12:42:00,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:42:00,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2018-10-04 12:42:00,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:00,374 INFO L225 Difference]: With dead ends: 710 [2018-10-04 12:42:00,374 INFO L226 Difference]: Without dead ends: 382 [2018-10-04 12:42:00,375 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:42:00,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-10-04 12:42:00,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 374. [2018-10-04 12:42:00,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-10-04 12:42:00,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 518 transitions. [2018-10-04 12:42:00,392 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 518 transitions. Word has length 57 [2018-10-04 12:42:00,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:00,393 INFO L480 AbstractCegarLoop]: Abstraction has 374 states and 518 transitions. [2018-10-04 12:42:00,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:42:00,393 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 518 transitions. [2018-10-04 12:42:00,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-04 12:42:00,396 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:00,396 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:00,396 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:00,396 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:00,397 INFO L82 PathProgramCache]: Analyzing trace with hash 309535550, now seen corresponding path program 1 times [2018-10-04 12:42:00,397 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:00,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:00,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:00,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:00,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:00,494 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-04 12:42:00,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:00,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:42:00,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:42:00,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:42:00,496 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:00,496 INFO L87 Difference]: Start difference. First operand 374 states and 518 transitions. Second operand 3 states. [2018-10-04 12:42:00,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:00,869 INFO L93 Difference]: Finished difference Result 850 states and 1212 transitions. [2018-10-04 12:42:00,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:42:00,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-10-04 12:42:00,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:00,873 INFO L225 Difference]: With dead ends: 850 [2018-10-04 12:42:00,873 INFO L226 Difference]: Without dead ends: 480 [2018-10-04 12:42:00,874 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:42:00,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2018-10-04 12:42:00,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 454. [2018-10-04 12:42:00,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2018-10-04 12:42:00,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 654 transitions. [2018-10-04 12:42:00,892 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 654 transitions. Word has length 71 [2018-10-04 12:42:00,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:00,892 INFO L480 AbstractCegarLoop]: Abstraction has 454 states and 654 transitions. [2018-10-04 12:42:00,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:42:00,893 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 654 transitions. [2018-10-04 12:42:00,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-04 12:42:00,895 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:00,895 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:00,896 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:00,896 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:00,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1385992431, now seen corresponding path program 1 times [2018-10-04 12:42:00,896 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:00,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:00,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:00,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:00,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:00,967 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-04 12:42:00,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:00,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:42:00,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:42:00,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:42:00,969 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:00,969 INFO L87 Difference]: Start difference. First operand 454 states and 654 transitions. Second operand 3 states. [2018-10-04 12:42:01,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:01,279 INFO L93 Difference]: Finished difference Result 952 states and 1377 transitions. [2018-10-04 12:42:01,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:42:01,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-10-04 12:42:01,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:01,283 INFO L225 Difference]: With dead ends: 952 [2018-10-04 12:42:01,284 INFO L226 Difference]: Without dead ends: 504 [2018-10-04 12:42:01,285 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:42:01,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2018-10-04 12:42:01,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 498. [2018-10-04 12:42:01,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2018-10-04 12:42:01,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 708 transitions. [2018-10-04 12:42:01,303 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 708 transitions. Word has length 74 [2018-10-04 12:42:01,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:01,303 INFO L480 AbstractCegarLoop]: Abstraction has 498 states and 708 transitions. [2018-10-04 12:42:01,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:42:01,303 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 708 transitions. [2018-10-04 12:42:01,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-04 12:42:01,305 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:01,306 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:01,306 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:01,306 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:01,306 INFO L82 PathProgramCache]: Analyzing trace with hash -931646216, now seen corresponding path program 1 times [2018-10-04 12:42:01,307 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:01,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:01,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:01,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:01,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:01,433 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-04 12:42:01,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:01,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:42:01,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:42:01,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:42:01,435 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:01,435 INFO L87 Difference]: Start difference. First operand 498 states and 708 transitions. Second operand 3 states. [2018-10-04 12:42:01,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:01,761 INFO L93 Difference]: Finished difference Result 990 states and 1411 transitions. [2018-10-04 12:42:01,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:42:01,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2018-10-04 12:42:01,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:01,768 INFO L225 Difference]: With dead ends: 990 [2018-10-04 12:42:01,769 INFO L226 Difference]: Without dead ends: 743 [2018-10-04 12:42:01,769 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:42:01,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-10-04 12:42:01,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 743. [2018-10-04 12:42:01,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2018-10-04 12:42:01,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1056 transitions. [2018-10-04 12:42:01,796 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1056 transitions. Word has length 95 [2018-10-04 12:42:01,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:01,796 INFO L480 AbstractCegarLoop]: Abstraction has 743 states and 1056 transitions. [2018-10-04 12:42:01,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:42:01,797 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1056 transitions. [2018-10-04 12:42:01,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-04 12:42:01,799 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:01,799 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:01,799 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:01,799 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:01,800 INFO L82 PathProgramCache]: Analyzing trace with hash -664650302, now seen corresponding path program 1 times [2018-10-04 12:42:01,804 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:01,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:01,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:01,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:01,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:01,927 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-04 12:42:01,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:01,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:42:01,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:42:01,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:42:01,929 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:01,929 INFO L87 Difference]: Start difference. First operand 743 states and 1056 transitions. Second operand 3 states. [2018-10-04 12:42:02,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:02,211 INFO L93 Difference]: Finished difference Result 990 states and 1408 transitions. [2018-10-04 12:42:02,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:42:02,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2018-10-04 12:42:02,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:02,217 INFO L225 Difference]: With dead ends: 990 [2018-10-04 12:42:02,217 INFO L226 Difference]: Without dead ends: 988 [2018-10-04 12:42:02,218 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:42:02,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-10-04 12:42:02,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 988. [2018-10-04 12:42:02,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2018-10-04 12:42:02,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1406 transitions. [2018-10-04 12:42:02,248 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1406 transitions. Word has length 97 [2018-10-04 12:42:02,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:02,248 INFO L480 AbstractCegarLoop]: Abstraction has 988 states and 1406 transitions. [2018-10-04 12:42:02,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:42:02,249 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1406 transitions. [2018-10-04 12:42:02,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-04 12:42:02,252 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:02,252 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:02,252 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:02,252 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:02,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1840260967, now seen corresponding path program 1 times [2018-10-04 12:42:02,253 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:02,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:02,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:02,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:02,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:02,392 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-04 12:42:02,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:02,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:42:02,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:42:02,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:42:02,394 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:02,394 INFO L87 Difference]: Start difference. First operand 988 states and 1406 transitions. Second operand 3 states. [2018-10-04 12:42:02,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:02,580 INFO L93 Difference]: Finished difference Result 2080 states and 2976 transitions. [2018-10-04 12:42:02,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:42:02,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2018-10-04 12:42:02,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:02,591 INFO L225 Difference]: With dead ends: 2080 [2018-10-04 12:42:02,591 INFO L226 Difference]: Without dead ends: 1098 [2018-10-04 12:42:02,593 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:42:02,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2018-10-04 12:42:02,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 1084. [2018-10-04 12:42:02,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1084 states. [2018-10-04 12:42:02,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1522 transitions. [2018-10-04 12:42:02,624 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1522 transitions. Word has length 123 [2018-10-04 12:42:02,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:02,625 INFO L480 AbstractCegarLoop]: Abstraction has 1084 states and 1522 transitions. [2018-10-04 12:42:02,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:42:02,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1522 transitions. [2018-10-04 12:42:02,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-04 12:42:02,628 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:02,629 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:02,629 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:02,629 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:02,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1854917982, now seen corresponding path program 1 times [2018-10-04 12:42:02,630 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:02,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:02,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:02,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:02,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:02,772 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2018-10-04 12:42:02,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:02,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:42:02,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:42:02,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:42:02,773 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:02,774 INFO L87 Difference]: Start difference. First operand 1084 states and 1522 transitions. Second operand 3 states. [2018-10-04 12:42:03,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:03,358 INFO L93 Difference]: Finished difference Result 2370 states and 3378 transitions. [2018-10-04 12:42:03,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:42:03,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2018-10-04 12:42:03,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:03,365 INFO L225 Difference]: With dead ends: 2370 [2018-10-04 12:42:03,365 INFO L226 Difference]: Without dead ends: 1284 [2018-10-04 12:42:03,367 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:42:03,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2018-10-04 12:42:03,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1244. [2018-10-04 12:42:03,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1244 states. [2018-10-04 12:42:03,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1750 transitions. [2018-10-04 12:42:03,401 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 1750 transitions. Word has length 145 [2018-10-04 12:42:03,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:03,401 INFO L480 AbstractCegarLoop]: Abstraction has 1244 states and 1750 transitions. [2018-10-04 12:42:03,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:42:03,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1750 transitions. [2018-10-04 12:42:03,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-04 12:42:03,406 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:03,406 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:03,406 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:03,406 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:03,407 INFO L82 PathProgramCache]: Analyzing trace with hash -109848754, now seen corresponding path program 1 times [2018-10-04 12:42:03,407 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:03,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:03,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:03,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:03,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:03,580 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2018-10-04 12:42:03,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:03,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:42:03,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:42:03,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:42:03,582 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:03,582 INFO L87 Difference]: Start difference. First operand 1244 states and 1750 transitions. Second operand 3 states. [2018-10-04 12:42:03,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:03,853 INFO L93 Difference]: Finished difference Result 2606 states and 3638 transitions. [2018-10-04 12:42:03,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:42:03,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2018-10-04 12:42:03,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:03,860 INFO L225 Difference]: With dead ends: 2606 [2018-10-04 12:42:03,861 INFO L226 Difference]: Without dead ends: 1368 [2018-10-04 12:42:03,862 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:42:03,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2018-10-04 12:42:03,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1360. [2018-10-04 12:42:03,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1360 states. [2018-10-04 12:42:03,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1886 transitions. [2018-10-04 12:42:03,891 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1886 transitions. Word has length 182 [2018-10-04 12:42:03,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:03,892 INFO L480 AbstractCegarLoop]: Abstraction has 1360 states and 1886 transitions. [2018-10-04 12:42:03,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:42:03,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1886 transitions. [2018-10-04 12:42:03,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-04 12:42:03,896 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:03,896 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:03,896 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:03,896 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:03,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1851725904, now seen corresponding path program 1 times [2018-10-04 12:42:03,897 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:03,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:03,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:03,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:03,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:03,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:03,996 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2018-10-04 12:42:03,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:03,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:42:03,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:42:03,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:42:03,997 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:03,997 INFO L87 Difference]: Start difference. First operand 1360 states and 1886 transitions. Second operand 3 states. [2018-10-04 12:42:04,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:04,245 INFO L93 Difference]: Finished difference Result 2854 states and 3946 transitions. [2018-10-04 12:42:04,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:42:04,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2018-10-04 12:42:04,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:04,252 INFO L225 Difference]: With dead ends: 2854 [2018-10-04 12:42:04,252 INFO L226 Difference]: Without dead ends: 1500 [2018-10-04 12:42:04,254 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:42:04,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2018-10-04 12:42:04,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1488. [2018-10-04 12:42:04,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1488 states. [2018-10-04 12:42:04,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 2034 transitions. [2018-10-04 12:42:04,287 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 2034 transitions. Word has length 182 [2018-10-04 12:42:04,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:04,288 INFO L480 AbstractCegarLoop]: Abstraction has 1488 states and 2034 transitions. [2018-10-04 12:42:04,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:42:04,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 2034 transitions. [2018-10-04 12:42:04,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-10-04 12:42:04,293 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:04,293 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:04,293 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:04,294 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:04,294 INFO L82 PathProgramCache]: Analyzing trace with hash -853360977, now seen corresponding path program 1 times [2018-10-04 12:42:04,294 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:04,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:04,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:04,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:04,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:04,458 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-10-04 12:42:04,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:04,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:42:04,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:42:04,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:42:04,460 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:04,460 INFO L87 Difference]: Start difference. First operand 1488 states and 2034 transitions. Second operand 3 states. [2018-10-04 12:42:04,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:04,924 INFO L93 Difference]: Finished difference Result 3126 states and 4270 transitions. [2018-10-04 12:42:04,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:42:04,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2018-10-04 12:42:04,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:04,932 INFO L225 Difference]: With dead ends: 3126 [2018-10-04 12:42:04,932 INFO L226 Difference]: Without dead ends: 1644 [2018-10-04 12:42:04,934 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:42:04,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2018-10-04 12:42:04,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1636. [2018-10-04 12:42:04,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1636 states. [2018-10-04 12:42:04,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 2202 transitions. [2018-10-04 12:42:04,966 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 2202 transitions. Word has length 213 [2018-10-04 12:42:04,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:04,967 INFO L480 AbstractCegarLoop]: Abstraction has 1636 states and 2202 transitions. [2018-10-04 12:42:04,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:42:04,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2202 transitions. [2018-10-04 12:42:04,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-10-04 12:42:04,971 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:04,972 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:04,972 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:04,972 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:04,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1480031661, now seen corresponding path program 1 times [2018-10-04 12:42:04,972 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:04,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:04,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:04,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:04,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:05,099 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 328 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-10-04 12:42:05,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:05,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:42:05,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:42:05,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:42:05,100 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:05,100 INFO L87 Difference]: Start difference. First operand 1636 states and 2202 transitions. Second operand 3 states. [2018-10-04 12:42:05,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:05,222 INFO L93 Difference]: Finished difference Result 4772 states and 6442 transitions. [2018-10-04 12:42:05,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:42:05,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2018-10-04 12:42:05,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:05,232 INFO L225 Difference]: With dead ends: 4772 [2018-10-04 12:42:05,233 INFO L226 Difference]: Without dead ends: 3142 [2018-10-04 12:42:05,235 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:42:05,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3142 states. [2018-10-04 12:42:05,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3142 to 3140. [2018-10-04 12:42:05,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2018-10-04 12:42:05,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 4241 transitions. [2018-10-04 12:42:05,294 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 4241 transitions. Word has length 213 [2018-10-04 12:42:05,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:05,295 INFO L480 AbstractCegarLoop]: Abstraction has 3140 states and 4241 transitions. [2018-10-04 12:42:05,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:42:05,295 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 4241 transitions. [2018-10-04 12:42:05,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-10-04 12:42:05,302 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:05,302 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:05,303 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:05,303 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:05,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1955375200, now seen corresponding path program 1 times [2018-10-04 12:42:05,303 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:05,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:05,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:05,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:05,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:05,436 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-10-04 12:42:05,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:05,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:42:05,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:42:05,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:42:05,438 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:05,438 INFO L87 Difference]: Start difference. First operand 3140 states and 4241 transitions. Second operand 3 states. [2018-10-04 12:42:06,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:06,404 INFO L93 Difference]: Finished difference Result 6426 states and 8672 transitions. [2018-10-04 12:42:06,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:42:06,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 238 [2018-10-04 12:42:06,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:06,420 INFO L225 Difference]: With dead ends: 6426 [2018-10-04 12:42:06,420 INFO L226 Difference]: Without dead ends: 3292 [2018-10-04 12:42:06,424 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:42:06,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3292 states. [2018-10-04 12:42:06,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3292 to 3276. [2018-10-04 12:42:06,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3276 states. [2018-10-04 12:42:06,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3276 states to 3276 states and 4397 transitions. [2018-10-04 12:42:06,509 INFO L78 Accepts]: Start accepts. Automaton has 3276 states and 4397 transitions. Word has length 238 [2018-10-04 12:42:06,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:06,510 INFO L480 AbstractCegarLoop]: Abstraction has 3276 states and 4397 transitions. [2018-10-04 12:42:06,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:42:06,510 INFO L276 IsEmpty]: Start isEmpty. Operand 3276 states and 4397 transitions. [2018-10-04 12:42:06,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-10-04 12:42:06,519 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:06,519 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:06,519 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:06,520 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:06,520 INFO L82 PathProgramCache]: Analyzing trace with hash 2043312965, now seen corresponding path program 1 times [2018-10-04 12:42:06,520 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:06,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:06,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:06,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:06,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:06,722 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2018-10-04 12:42:06,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:06,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:42:06,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:42:06,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:42:06,724 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:06,727 INFO L87 Difference]: Start difference. First operand 3276 states and 4397 transitions. Second operand 3 states. [2018-10-04 12:42:07,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:07,473 INFO L93 Difference]: Finished difference Result 6954 states and 9464 transitions. [2018-10-04 12:42:07,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:42:07,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2018-10-04 12:42:07,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:07,487 INFO L225 Difference]: With dead ends: 6954 [2018-10-04 12:42:07,487 INFO L226 Difference]: Without dead ends: 3684 [2018-10-04 12:42:07,491 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:42:07,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3684 states. [2018-10-04 12:42:07,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3684 to 3596. [2018-10-04 12:42:07,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3596 states. [2018-10-04 12:42:07,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3596 states to 3596 states and 4773 transitions. [2018-10-04 12:42:07,554 INFO L78 Accepts]: Start accepts. Automaton has 3596 states and 4773 transitions. Word has length 249 [2018-10-04 12:42:07,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:07,554 INFO L480 AbstractCegarLoop]: Abstraction has 3596 states and 4773 transitions. [2018-10-04 12:42:07,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:42:07,555 INFO L276 IsEmpty]: Start isEmpty. Operand 3596 states and 4773 transitions. [2018-10-04 12:42:07,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-10-04 12:42:07,562 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:07,563 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:07,563 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:07,563 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:07,563 INFO L82 PathProgramCache]: Analyzing trace with hash 713372088, now seen corresponding path program 1 times [2018-10-04 12:42:07,563 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:07,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:07,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:07,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:07,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:07,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:07,683 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2018-10-04 12:42:07,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:07,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:42:07,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:42:07,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:42:07,685 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:07,685 INFO L87 Difference]: Start difference. First operand 3596 states and 4773 transitions. Second operand 3 states. [2018-10-04 12:42:08,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:08,882 INFO L93 Difference]: Finished difference Result 7602 states and 10024 transitions. [2018-10-04 12:42:08,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:42:08,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 264 [2018-10-04 12:42:08,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:08,900 INFO L225 Difference]: With dead ends: 7602 [2018-10-04 12:42:08,900 INFO L226 Difference]: Without dead ends: 4012 [2018-10-04 12:42:08,904 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:42:08,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4012 states. [2018-10-04 12:42:08,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4012 to 3724. [2018-10-04 12:42:08,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3724 states. [2018-10-04 12:42:08,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3724 states to 3724 states and 4925 transitions. [2018-10-04 12:42:08,982 INFO L78 Accepts]: Start accepts. Automaton has 3724 states and 4925 transitions. Word has length 264 [2018-10-04 12:42:08,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:08,983 INFO L480 AbstractCegarLoop]: Abstraction has 3724 states and 4925 transitions. [2018-10-04 12:42:08,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:42:08,983 INFO L276 IsEmpty]: Start isEmpty. Operand 3724 states and 4925 transitions. [2018-10-04 12:42:08,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-10-04 12:42:08,989 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:08,989 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:08,989 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:08,990 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:08,990 INFO L82 PathProgramCache]: Analyzing trace with hash -2057089708, now seen corresponding path program 1 times [2018-10-04 12:42:08,990 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:08,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:08,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:08,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:08,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:09,156 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 375 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2018-10-04 12:42:09,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:09,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:42:09,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:42:09,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:42:09,158 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:09,158 INFO L87 Difference]: Start difference. First operand 3724 states and 4925 transitions. Second operand 3 states. [2018-10-04 12:42:09,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:09,345 INFO L93 Difference]: Finished difference Result 10640 states and 14147 transitions. [2018-10-04 12:42:09,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:42:09,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2018-10-04 12:42:09,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:09,385 INFO L225 Difference]: With dead ends: 10640 [2018-10-04 12:42:09,385 INFO L226 Difference]: Without dead ends: 6922 [2018-10-04 12:42:09,394 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:42:09,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6922 states. [2018-10-04 12:42:09,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6922 to 6920. [2018-10-04 12:42:09,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6920 states. [2018-10-04 12:42:09,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6920 states to 6920 states and 9207 transitions. [2018-10-04 12:42:09,504 INFO L78 Accepts]: Start accepts. Automaton has 6920 states and 9207 transitions. Word has length 265 [2018-10-04 12:42:09,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:09,504 INFO L480 AbstractCegarLoop]: Abstraction has 6920 states and 9207 transitions. [2018-10-04 12:42:09,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:42:09,505 INFO L276 IsEmpty]: Start isEmpty. Operand 6920 states and 9207 transitions. [2018-10-04 12:42:09,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-04 12:42:09,512 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:09,513 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:09,513 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:09,513 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:09,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1026771827, now seen corresponding path program 1 times [2018-10-04 12:42:09,514 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:09,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:09,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:09,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:09,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:09,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:09,657 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 373 proven. 0 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2018-10-04 12:42:09,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:09,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:42:09,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:42:09,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:42:09,658 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:09,658 INFO L87 Difference]: Start difference. First operand 6920 states and 9207 transitions. Second operand 3 states. [2018-10-04 12:42:10,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:10,074 INFO L93 Difference]: Finished difference Result 13842 states and 18396 transitions. [2018-10-04 12:42:10,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:42:10,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 266 [2018-10-04 12:42:10,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:10,089 INFO L225 Difference]: With dead ends: 13842 [2018-10-04 12:42:10,089 INFO L226 Difference]: Without dead ends: 6928 [2018-10-04 12:42:10,096 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:42:10,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6928 states. [2018-10-04 12:42:10,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6928 to 6896. [2018-10-04 12:42:10,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6896 states. [2018-10-04 12:42:10,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6896 states to 6896 states and 8991 transitions. [2018-10-04 12:42:10,229 INFO L78 Accepts]: Start accepts. Automaton has 6896 states and 8991 transitions. Word has length 266 [2018-10-04 12:42:10,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:10,230 INFO L480 AbstractCegarLoop]: Abstraction has 6896 states and 8991 transitions. [2018-10-04 12:42:10,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:42:10,230 INFO L276 IsEmpty]: Start isEmpty. Operand 6896 states and 8991 transitions. [2018-10-04 12:42:10,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-10-04 12:42:10,240 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:10,240 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:10,240 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:10,241 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:10,241 INFO L82 PathProgramCache]: Analyzing trace with hash 2111243411, now seen corresponding path program 1 times [2018-10-04 12:42:10,241 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:10,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:10,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:10,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:10,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:10,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:10,526 INFO L134 CoverageAnalysis]: Checked inductivity of 917 backedges. 336 proven. 19 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2018-10-04 12:42:10,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:10,526 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:42:10,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:10,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:12,147 INFO L134 CoverageAnalysis]: Checked inductivity of 917 backedges. 336 proven. 19 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2018-10-04 12:42:12,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:12,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 12:42:12,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:42:12,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:42:12,179 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:12,179 INFO L87 Difference]: Start difference. First operand 6896 states and 8991 transitions. Second operand 4 states. [2018-10-04 12:42:14,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:14,864 INFO L93 Difference]: Finished difference Result 13708 states and 17869 transitions. [2018-10-04 12:42:14,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:42:14,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 289 [2018-10-04 12:42:14,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:14,882 INFO L225 Difference]: With dead ends: 13708 [2018-10-04 12:42:14,882 INFO L226 Difference]: Without dead ends: 10342 [2018-10-04 12:42:14,888 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 0.0s impTime 3 [2018-10-04 12:42:14,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10342 states. [2018-10-04 12:42:15,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10342 to 8856. [2018-10-04 12:42:15,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8856 states. [2018-10-04 12:42:15,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8856 states to 8856 states and 11545 transitions. [2018-10-04 12:42:15,081 INFO L78 Accepts]: Start accepts. Automaton has 8856 states and 11545 transitions. Word has length 289 [2018-10-04 12:42:15,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:15,082 INFO L480 AbstractCegarLoop]: Abstraction has 8856 states and 11545 transitions. [2018-10-04 12:42:15,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:42:15,082 INFO L276 IsEmpty]: Start isEmpty. Operand 8856 states and 11545 transitions. [2018-10-04 12:42:15,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-10-04 12:42:15,097 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:15,098 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:15,098 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:15,098 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:15,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1098716245, now seen corresponding path program 1 times [2018-10-04 12:42:15,098 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:15,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:15,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:15,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:15,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:15,335 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 413 proven. 6 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2018-10-04 12:42:15,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:15,335 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) [2018-10-04 12:42:15,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:42:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:15,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:15,627 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2018-10-04 12:42:15,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 12:42:15,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-04 12:42:15,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:42:15,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:42:15,650 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:15,650 INFO L87 Difference]: Start difference. First operand 8856 states and 11545 transitions. Second operand 5 states. [2018-10-04 12:42:16,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:16,786 INFO L93 Difference]: Finished difference Result 20921 states and 27145 transitions. [2018-10-04 12:42:16,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:42:16,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 303 [2018-10-04 12:42:16,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:16,810 INFO L225 Difference]: With dead ends: 20921 [2018-10-04 12:42:16,810 INFO L226 Difference]: Without dead ends: 12063 [2018-10-04 12:42:16,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 5 [2018-10-04 12:42:16,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12063 states. [2018-10-04 12:42:17,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12063 to 9883. [2018-10-04 12:42:17,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9883 states. [2018-10-04 12:42:17,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9883 states to 9883 states and 12626 transitions. [2018-10-04 12:42:17,062 INFO L78 Accepts]: Start accepts. Automaton has 9883 states and 12626 transitions. Word has length 303 [2018-10-04 12:42:17,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:17,062 INFO L480 AbstractCegarLoop]: Abstraction has 9883 states and 12626 transitions. [2018-10-04 12:42:17,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:42:17,063 INFO L276 IsEmpty]: Start isEmpty. Operand 9883 states and 12626 transitions. [2018-10-04 12:42:17,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-10-04 12:42:17,080 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:17,080 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:17,081 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:17,081 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:17,081 INFO L82 PathProgramCache]: Analyzing trace with hash -708971903, now seen corresponding path program 1 times [2018-10-04 12:42:17,081 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:17,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:17,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:17,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:17,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:17,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 918 proven. 0 refuted. 0 times theorem prover too weak. 1097 trivial. 0 not checked. [2018-10-04 12:42:17,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:17,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:42:17,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:42:17,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:42:17,406 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:17,406 INFO L87 Difference]: Start difference. First operand 9883 states and 12626 transitions. Second operand 3 states. [2018-10-04 12:42:17,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:17,718 INFO L93 Difference]: Finished difference Result 18554 states and 23425 transitions. [2018-10-04 12:42:17,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:42:17,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 414 [2018-10-04 12:42:17,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:17,729 INFO L225 Difference]: With dead ends: 18554 [2018-10-04 12:42:17,730 INFO L226 Difference]: Without dead ends: 4012 [2018-10-04 12:42:17,741 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:42:17,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4012 states. [2018-10-04 12:42:17,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4012 to 3659. [2018-10-04 12:42:17,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3659 states. [2018-10-04 12:42:17,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3659 states to 3659 states and 4577 transitions. [2018-10-04 12:42:17,801 INFO L78 Accepts]: Start accepts. Automaton has 3659 states and 4577 transitions. Word has length 414 [2018-10-04 12:42:17,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:17,801 INFO L480 AbstractCegarLoop]: Abstraction has 3659 states and 4577 transitions. [2018-10-04 12:42:17,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:42:17,802 INFO L276 IsEmpty]: Start isEmpty. Operand 3659 states and 4577 transitions. [2018-10-04 12:42:17,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2018-10-04 12:42:17,808 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:17,808 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:17,809 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:17,809 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:17,809 INFO L82 PathProgramCache]: Analyzing trace with hash -2022233952, now seen corresponding path program 1 times [2018-10-04 12:42:17,809 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:17,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:17,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:17,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:17,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:18,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2074 backedges. 1299 proven. 15 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-10-04 12:42:18,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:18,061 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:42:18,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:18,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:18,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2074 backedges. 1299 proven. 15 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-10-04 12:42:18,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:18,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 12:42:18,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:42:18,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:42:18,439 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:18,439 INFO L87 Difference]: Start difference. First operand 3659 states and 4577 transitions. Second operand 4 states. [2018-10-04 12:42:18,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:18,672 INFO L93 Difference]: Finished difference Result 4485 states and 5603 transitions. [2018-10-04 12:42:18,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:42:18,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 443 [2018-10-04 12:42:18,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:18,673 INFO L225 Difference]: With dead ends: 4485 [2018-10-04 12:42:18,674 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:42:18,679 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.0s impTime 3 [2018-10-04 12:42:18,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:42:18,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:42:18,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:42:18,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:42:18,680 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 443 [2018-10-04 12:42:18,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:18,680 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:42:18,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:42:18,680 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:42:18,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:42:18,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:42:18,805 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 41 [2018-10-04 12:42:18,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:18,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:18,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:18,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:18,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:18,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:18,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:18,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:18,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:18,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:19,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:19,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:19,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:19,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:19,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:19,283 WARN L178 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 352 DAG size of output: 63 [2018-10-04 12:42:19,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:19,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:19,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:19,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:19,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:19,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:19,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:19,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:19,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:19,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:19,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:19,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:19,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:19,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:19,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:19,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:19,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:19,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:19,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:19,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:19,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:19,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:19,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:19,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:19,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:19,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:19,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:19,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:19,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:20,602 WARN L178 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 41 DAG size of output: 9 [2018-10-04 12:42:21,168 WARN L178 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-10-04 12:42:22,021 WARN L178 SmtUtils]: Spent 852.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2018-10-04 12:42:22,281 WARN L178 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2018-10-04 12:42:23,352 WARN L178 SmtUtils]: Spent 912.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2018-10-04 12:42:23,522 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 14 [2018-10-04 12:42:23,793 WARN L178 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 13 [2018-10-04 12:42:24,028 INFO L425 ceAbstractionStarter]: For program point L432(lines 432 434) no Hoare annotation was computed. [2018-10-04 12:42:24,029 INFO L425 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2018-10-04 12:42:24,029 INFO L425 ceAbstractionStarter]: For program point L300(lines 300 603) no Hoare annotation was computed. [2018-10-04 12:42:24,029 INFO L425 ceAbstractionStarter]: For program point L366-2(lines 366 371) no Hoare annotation was computed. [2018-10-04 12:42:24,029 INFO L421 ceAbstractionStarter]: At program point L267(lines 265 407) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~7 4560)) (.cse1 (<= 4352 ssl3_connect_~s__state~7))) (or (and .cse0 (<= ssl3_connect_~blastFlag~7 4) .cse1 (= ssl3_connect_~s__hit~7 0)) (and .cse0 (<= ssl3_connect_~blastFlag~7 0) .cse1))) [2018-10-04 12:42:24,029 INFO L425 ceAbstractionStarter]: For program point L532(lines 532 544) no Hoare annotation was computed. [2018-10-04 12:42:24,029 INFO L425 ceAbstractionStarter]: For program point L532-1(lines 532 544) no Hoare annotation was computed. [2018-10-04 12:42:24,029 INFO L421 ceAbstractionStarter]: At program point L433(lines 433 636) the Hoare annotation is: false [2018-10-04 12:42:24,029 INFO L425 ceAbstractionStarter]: For program point L334(lines 334 346) no Hoare annotation was computed. [2018-10-04 12:42:24,030 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 603) no Hoare annotation was computed. [2018-10-04 12:42:24,030 INFO L425 ceAbstractionStarter]: For program point L334-2(lines 334 350) no Hoare annotation was computed. [2018-10-04 12:42:24,030 INFO L425 ceAbstractionStarter]: For program point L235(lines 235 238) no Hoare annotation was computed. [2018-10-04 12:42:24,030 INFO L425 ceAbstractionStarter]: For program point L401(lines 401 403) no Hoare annotation was computed. [2018-10-04 12:42:24,030 INFO L425 ceAbstractionStarter]: For program point L401-2(lines 401 406) no Hoare annotation was computed. [2018-10-04 12:42:24,030 INFO L425 ceAbstractionStarter]: For program point L302(lines 302 603) no Hoare annotation was computed. [2018-10-04 12:42:24,030 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 237) no Hoare annotation was computed. [2018-10-04 12:42:24,030 INFO L425 ceAbstractionStarter]: For program point L567(lines 567 570) no Hoare annotation was computed. [2018-10-04 12:42:24,030 INFO L425 ceAbstractionStarter]: For program point L501(lines 501 503) no Hoare annotation was computed. [2018-10-04 12:42:24,030 INFO L425 ceAbstractionStarter]: For program point L435(lines 435 437) no Hoare annotation was computed. [2018-10-04 12:42:24,030 INFO L421 ceAbstractionStarter]: At program point L303(lines 301 521) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~7 4560)) (.cse1 (<= 4464 ssl3_connect_~s__state~7))) (or (and .cse0 .cse1 (= ssl3_connect_~s__hit~7 0)) (and (<= ssl3_connect_~blastFlag~7 2) .cse0 .cse1))) [2018-10-04 12:42:24,030 INFO L425 ceAbstractionStarter]: For program point L270(lines 270 603) no Hoare annotation was computed. [2018-10-04 12:42:24,030 INFO L425 ceAbstractionStarter]: For program point L634(lines 634 636) no Hoare annotation was computed. [2018-10-04 12:42:24,030 INFO L421 ceAbstractionStarter]: At program point L601(lines 360 621) the Hoare annotation is: (let ((.cse7 (<= 4560 ssl3_connect_~s__state~7)) (.cse8 (<= ssl3_connect_~s__state~7 4560)) (.cse4 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~7)) (.cse3 (<= ssl3_connect_~s__s3__tmp__next_state___0~7 4560)) (.cse2 (<= ssl3_connect_~s__state~7 4352)) (.cse5 (<= 4352 ssl3_connect_~s__state~7)) (.cse6 (<= ssl3_connect_~blastFlag~7 2)) (.cse0 (= ssl3_connect_~s__state~7 4512)) (.cse9 (= ssl3_connect_~s__state~7 4528)) (.cse1 (= ssl3_connect_~s__hit~7 0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse1) (and .cse6 .cse7 .cse8) (and .cse7 .cse8 .cse3 .cse4 .cse1) (and (<= ssl3_connect_~s__state~7 3) .cse3) (<= ssl3_connect_~blastFlag~7 0) (and (= ssl3_connect_~s__state~7 4480) .cse1) (and .cse2 .cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~7 3) .cse5) (and .cse6 (= ssl3_connect_~s__state~7 4384)) (and .cse6 .cse9) (and (= ssl3_connect_~s__state~7 4464) .cse1) (and .cse6 .cse0) (and (<= ssl3_connect_~blastFlag~7 4) .cse1) (and .cse9 .cse1) (and (= ssl3_connect_~s__state~7 4496) .cse1))) [2018-10-04 12:42:24,031 INFO L425 ceAbstractionStarter]: For program point L535(lines 535 541) no Hoare annotation was computed. [2018-10-04 12:42:24,031 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 340) no Hoare annotation was computed. [2018-10-04 12:42:24,031 INFO L425 ceAbstractionStarter]: For program point L304(lines 304 603) no Hoare annotation was computed. [2018-10-04 12:42:24,031 INFO L421 ceAbstractionStarter]: At program point L271(lines 269 411) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~7 4560)) (.cse1 (<= 4352 ssl3_connect_~s__state~7))) (or (and .cse0 (<= ssl3_connect_~blastFlag~7 4) .cse1 (= ssl3_connect_~s__hit~7 0)) (and .cse0 (<= ssl3_connect_~blastFlag~7 0) .cse1))) [2018-10-04 12:42:24,031 INFO L425 ceAbstractionStarter]: For program point L272(lines 272 603) no Hoare annotation was computed. [2018-10-04 12:42:24,031 INFO L425 ceAbstractionStarter]: For program point L239(lines 235 623) no Hoare annotation was computed. [2018-10-04 12:42:24,031 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 603) no Hoare annotation was computed. [2018-10-04 12:42:24,031 INFO L425 ceAbstractionStarter]: For program point L604(lines 604 621) no Hoare annotation was computed. [2018-10-04 12:42:24,031 INFO L421 ceAbstractionStarter]: At program point L307(lines 305 547) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~7 0)) (.cse0 (<= 4560 ssl3_connect_~s__state~7)) (.cse2 (<= ssl3_connect_~s__state~7 4560))) (or (and .cse0 (<= ssl3_connect_~blastFlag~7 4) .cse1) (and .cse0 .cse2 (<= ssl3_connect_~s__s3__tmp__next_state___0~7 4560) .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~7 0)) (and (<= ssl3_connect_~blastFlag~7 2) .cse0 .cse2))) [2018-10-04 12:42:24,031 INFO L425 ceAbstractionStarter]: For program point L274(lines 274 603) no Hoare annotation was computed. [2018-10-04 12:42:24,031 INFO L425 ceAbstractionStarter]: For program point L241(lines 241 243) no Hoare annotation was computed. [2018-10-04 12:42:24,031 INFO L425 ceAbstractionStarter]: For program point L605(lines 605 620) no Hoare annotation was computed. [2018-10-04 12:42:24,031 INFO L425 ceAbstractionStarter]: For program point L374(lines 374 375) no Hoare annotation was computed. [2018-10-04 12:42:24,031 INFO L425 ceAbstractionStarter]: For program point L341(lines 341 344) no Hoare annotation was computed. [2018-10-04 12:42:24,032 INFO L425 ceAbstractionStarter]: For program point L308(lines 308 603) no Hoare annotation was computed. [2018-10-04 12:42:24,032 INFO L421 ceAbstractionStarter]: At program point L275(lines 273 428) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~7 4560)) (.cse1 (<= 4352 ssl3_connect_~s__state~7))) (or (and .cse0 (<= ssl3_connect_~blastFlag~7 4) .cse1 (= ssl3_connect_~s__hit~7 0)) (and .cse0 (<= ssl3_connect_~blastFlag~7 0) .cse1))) [2018-10-04 12:42:24,032 INFO L425 ceAbstractionStarter]: For program point L606(lines 606 612) no Hoare annotation was computed. [2018-10-04 12:42:24,032 INFO L425 ceAbstractionStarter]: For program point L606-2(lines 606 619) no Hoare annotation was computed. [2018-10-04 12:42:24,032 INFO L425 ceAbstractionStarter]: For program point L507(lines 507 511) no Hoare annotation was computed. [2018-10-04 12:42:24,032 INFO L425 ceAbstractionStarter]: For program point L474(lines 474 476) no Hoare annotation was computed. [2018-10-04 12:42:24,032 INFO L425 ceAbstractionStarter]: For program point L507-2(lines 507 515) no Hoare annotation was computed. [2018-10-04 12:42:24,032 INFO L421 ceAbstractionStarter]: At program point L309(lines 309 561) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~7 0)) (.cse0 (<= ssl3_connect_~s__state~7 4352)) (.cse1 (<= 4352 ssl3_connect_~s__state~7))) (or (and .cse0 (<= ssl3_connect_~blastFlag~7 4) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~7 4560) (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~7) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~7 2) (<= ssl3_connect_~s__s3__tmp__next_state___0~7 3) .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~7 0) .cse1))) [2018-10-04 12:42:24,032 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 603) no Hoare annotation was computed. [2018-10-04 12:42:24,032 INFO L425 ceAbstractionStarter]: For program point L310(lines 310 603) no Hoare annotation was computed. [2018-10-04 12:42:24,032 INFO L425 ceAbstractionStarter]: For program point L244(line 244) no Hoare annotation was computed. [2018-10-04 12:42:24,032 INFO L428 ceAbstractionStarter]: At program point L311(lines 311 578) the Hoare annotation is: true [2018-10-04 12:42:24,032 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 603) no Hoare annotation was computed. [2018-10-04 12:42:24,032 INFO L425 ceAbstractionStarter]: For program point L609(lines 609 611) no Hoare annotation was computed. [2018-10-04 12:42:24,033 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 576 578) no Hoare annotation was computed. [2018-10-04 12:42:24,033 INFO L421 ceAbstractionStarter]: At program point L279(lines 277 441) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~7 0)) (.cse0 (<= ssl3_connect_~s__state~7 4560)) (.cse1 (<= 4352 ssl3_connect_~s__state~7))) (or (and (<= ssl3_connect_~s__s3__tmp__next_state___0~7 4560) .cse0 .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~7 4) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~7 0) .cse1))) [2018-10-04 12:42:24,033 INFO L425 ceAbstractionStarter]: For program point L246(lines 246 603) no Hoare annotation was computed. [2018-10-04 12:42:24,033 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 483) no Hoare annotation was computed. [2018-10-04 12:42:24,033 INFO L425 ceAbstractionStarter]: For program point L445(lines 445 447) no Hoare annotation was computed. [2018-10-04 12:42:24,033 INFO L425 ceAbstractionStarter]: For program point L478-2(lines 478 483) no Hoare annotation was computed. [2018-10-04 12:42:24,033 INFO L425 ceAbstractionStarter]: For program point L445-2(lines 445 450) no Hoare annotation was computed. [2018-10-04 12:42:24,033 INFO L428 ceAbstractionStarter]: At program point L313(lines 313 597) the Hoare annotation is: true [2018-10-04 12:42:24,033 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 603) no Hoare annotation was computed. [2018-10-04 12:42:24,033 INFO L421 ceAbstractionStarter]: At program point L247(lines 247 315) the Hoare annotation is: (let ((.cse0 (<= 4560 ssl3_connect_~s__state~7))) (or (and .cse0 (<= ssl3_connect_~blastFlag~7 4) (= ssl3_connect_~s__hit~7 0)) (and .cse0 (<= ssl3_connect_~blastFlag~7 0)))) [2018-10-04 12:42:24,033 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 603) no Hoare annotation was computed. [2018-10-04 12:42:24,034 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 383) no Hoare annotation was computed. [2018-10-04 12:42:24,034 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 386) no Hoare annotation was computed. [2018-10-04 12:42:24,034 INFO L425 ceAbstractionStarter]: For program point L282(lines 282 603) no Hoare annotation was computed. [2018-10-04 12:42:24,034 INFO L425 ceAbstractionStarter]: For program point ssl3_connectENTRY(lines 15 640) no Hoare annotation was computed. [2018-10-04 12:42:24,034 INFO L425 ceAbstractionStarter]: For program point L415(lines 415 417) no Hoare annotation was computed. [2018-10-04 12:42:24,034 INFO L425 ceAbstractionStarter]: For program point L415-2(lines 415 420) no Hoare annotation was computed. [2018-10-04 12:42:24,034 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 603) no Hoare annotation was computed. [2018-10-04 12:42:24,034 INFO L425 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONASSERT(line 635) no Hoare annotation was computed. [2018-10-04 12:42:24,034 INFO L425 ceAbstractionStarter]: For program point L614(lines 614 618) no Hoare annotation was computed. [2018-10-04 12:42:24,035 INFO L425 ceAbstractionStarter]: For program point L581(lines 581 582) no Hoare annotation was computed. [2018-10-04 12:42:24,035 INFO L425 ceAbstractionStarter]: For program point L581-2(lines 581 582) no Hoare annotation was computed. [2018-10-04 12:42:24,035 INFO L425 ceAbstractionStarter]: For program point L284(lines 284 603) no Hoare annotation was computed. [2018-10-04 12:42:24,035 INFO L425 ceAbstractionStarter]: For program point L516(lines 516 519) no Hoare annotation was computed. [2018-10-04 12:42:24,035 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 354) no Hoare annotation was computed. [2018-10-04 12:42:24,035 INFO L425 ceAbstractionStarter]: For program point L252(lines 252 603) no Hoare annotation was computed. [2018-10-04 12:42:24,035 INFO L425 ceAbstractionStarter]: For program point L451(lines 451 455) no Hoare annotation was computed. [2018-10-04 12:42:24,035 INFO L425 ceAbstractionStarter]: For program point L451-2(lines 451 455) no Hoare annotation was computed. [2018-10-04 12:42:24,035 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 603) no Hoare annotation was computed. [2018-10-04 12:42:24,035 INFO L425 ceAbstractionStarter]: For program point L551(lines 551 553) no Hoare annotation was computed. [2018-10-04 12:42:24,035 INFO L425 ceAbstractionStarter]: For program point $Ultimate##85(lines 314 602) no Hoare annotation was computed. [2018-10-04 12:42:24,036 INFO L425 ceAbstractionStarter]: For program point $Ultimate##84(lines 314 602) no Hoare annotation was computed. [2018-10-04 12:42:24,036 INFO L421 ceAbstractionStarter]: At program point L287(lines 281 458) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~7 4560)) (.cse1 (<= 4464 ssl3_connect_~s__state~7))) (or (and .cse0 .cse1 (= ssl3_connect_~s__hit~7 0)) (and .cse0 .cse1 (<= ssl3_connect_~blastFlag~7 0)))) [2018-10-04 12:42:24,036 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 603) no Hoare annotation was computed. [2018-10-04 12:42:24,036 INFO L425 ceAbstractionStarter]: For program point L585(lines 585 589) no Hoare annotation was computed. [2018-10-04 12:42:24,036 INFO L425 ceAbstractionStarter]: For program point L585-2(lines 585 589) no Hoare annotation was computed. [2018-10-04 12:42:24,036 INFO L425 ceAbstractionStarter]: For program point L387(lines 387 391) no Hoare annotation was computed. [2018-10-04 12:42:24,036 INFO L421 ceAbstractionStarter]: At program point L321(lines 249 321) the Hoare annotation is: (or (and (<= ssl3_connect_~blastFlag~7 4) (= ssl3_connect_~s__hit~7 0)) (<= ssl3_connect_~blastFlag~7 0)) [2018-10-04 12:42:24,036 INFO L425 ceAbstractionStarter]: For program point L387-2(lines 387 391) no Hoare annotation was computed. [2018-10-04 12:42:24,036 INFO L425 ceAbstractionStarter]: For program point L288(lines 288 603) no Hoare annotation was computed. [2018-10-04 12:42:24,036 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 603) no Hoare annotation was computed. [2018-10-04 12:42:24,037 INFO L425 ceAbstractionStarter]: For program point L554(lines 554 558) no Hoare annotation was computed. [2018-10-04 12:42:24,037 INFO L425 ceAbstractionStarter]: For program point L554-2(lines 554 558) no Hoare annotation was computed. [2018-10-04 12:42:24,037 INFO L425 ceAbstractionStarter]: For program point L290(lines 290 603) no Hoare annotation was computed. [2018-10-04 12:42:24,037 INFO L425 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 15 640) no Hoare annotation was computed. [2018-10-04 12:42:24,037 INFO L425 ceAbstractionStarter]: For program point L423(lines 423 426) no Hoare annotation was computed. [2018-10-04 12:42:24,037 INFO L421 ceAbstractionStarter]: At program point L291(lines 289 470) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~7 4560)) (.cse1 (<= 4464 ssl3_connect_~s__state~7))) (or (and .cse0 .cse1 (= ssl3_connect_~s__hit~7 0)) (and .cse0 .cse1 (<= ssl3_connect_~blastFlag~7 0)))) [2018-10-04 12:42:24,037 INFO L425 ceAbstractionStarter]: For program point L258(lines 258 603) no Hoare annotation was computed. [2018-10-04 12:42:24,037 INFO L425 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 15 640) no Hoare annotation was computed. [2018-10-04 12:42:24,037 INFO L425 ceAbstractionStarter]: For program point L490(lines 490 492) no Hoare annotation was computed. [2018-10-04 12:42:24,037 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 603) no Hoare annotation was computed. [2018-10-04 12:42:24,038 INFO L421 ceAbstractionStarter]: At program point L259(lines 257 361) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~7 4560)) (.cse1 (<= 4352 ssl3_connect_~s__state~7))) (or (and .cse0 (<= ssl3_connect_~blastFlag~7 4) .cse1 (= ssl3_connect_~s__hit~7 0)) (and .cse0 (<= ssl3_connect_~blastFlag~7 0) .cse1))) [2018-10-04 12:42:24,038 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 327) no Hoare annotation was computed. [2018-10-04 12:42:24,038 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 603) no Hoare annotation was computed. [2018-10-04 12:42:24,038 INFO L425 ceAbstractionStarter]: For program point L326-2(lines 326 327) no Hoare annotation was computed. [2018-10-04 12:42:24,038 INFO L425 ceAbstractionStarter]: For program point L227(lines 227 231) no Hoare annotation was computed. [2018-10-04 12:42:24,038 INFO L428 ceAbstractionStarter]: At program point L624(lines 242 624) the Hoare annotation is: true [2018-10-04 12:42:24,038 INFO L425 ceAbstractionStarter]: For program point L525(lines 525 527) no Hoare annotation was computed. [2018-10-04 12:42:24,038 INFO L425 ceAbstractionStarter]: For program point L294(lines 294 603) no Hoare annotation was computed. [2018-10-04 12:42:24,038 INFO L421 ceAbstractionStarter]: At program point L295(lines 293 486) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~7 4560)) (.cse1 (<= 4464 ssl3_connect_~s__state~7))) (or (and .cse0 .cse1 (= ssl3_connect_~s__hit~7 0)) (and .cse0 .cse1 (<= ssl3_connect_~blastFlag~7 0)))) [2018-10-04 12:42:24,038 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 603) no Hoare annotation was computed. [2018-10-04 12:42:24,038 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 231) no Hoare annotation was computed. [2018-10-04 12:42:24,039 INFO L425 ceAbstractionStarter]: For program point L229-2(lines 227 231) no Hoare annotation was computed. [2018-10-04 12:42:24,039 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 332) no Hoare annotation was computed. [2018-10-04 12:42:24,039 INFO L425 ceAbstractionStarter]: For program point L296(lines 296 603) no Hoare annotation was computed. [2018-10-04 12:42:24,039 INFO L421 ceAbstractionStarter]: At program point L263(lines 261 377) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~7 4560)) (.cse1 (<= 4352 ssl3_connect_~s__state~7))) (or (and (<= ssl3_connect_~blastFlag~7 2) .cse0 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~7 4) .cse1 (= ssl3_connect_~s__hit~7 0)))) [2018-10-04 12:42:24,039 INFO L425 ceAbstractionStarter]: For program point L594(lines 594 595) no Hoare annotation was computed. [2018-10-04 12:42:24,039 INFO L425 ceAbstractionStarter]: For program point L396-1(lines 396 407) no Hoare annotation was computed. [2018-10-04 12:42:24,039 INFO L425 ceAbstractionStarter]: For program point L264(lines 264 603) no Hoare annotation was computed. [2018-10-04 12:42:24,039 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 603) no Hoare annotation was computed. [2018-10-04 12:42:24,039 INFO L425 ceAbstractionStarter]: For program point L629(lines 629 630) no Hoare annotation was computed. [2018-10-04 12:42:24,039 INFO L425 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-10-04 12:42:24,040 INFO L425 ceAbstractionStarter]: For program point L629-2(lines 629 630) no Hoare annotation was computed. [2018-10-04 12:42:24,040 INFO L425 ceAbstractionStarter]: For program point L563-2(lines 563 572) no Hoare annotation was computed. [2018-10-04 12:42:24,040 INFO L425 ceAbstractionStarter]: For program point L464(lines 464 466) no Hoare annotation was computed. [2018-10-04 12:42:24,040 INFO L421 ceAbstractionStarter]: At program point L299(lines 297 497) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~7 4560)) (.cse1 (<= 4464 ssl3_connect_~s__state~7))) (or (and (<= ssl3_connect_~blastFlag~7 2) .cse0 .cse1) (and .cse0 .cse1 (= ssl3_connect_~s__hit~7 0)))) [2018-10-04 12:42:24,040 INFO L425 ceAbstractionStarter]: For program point L266(lines 266 603) no Hoare annotation was computed. [2018-10-04 12:42:24,057 INFO L202 PluginConnector]: Adding new model s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:42:24 BoogieIcfgContainer [2018-10-04 12:42:24,058 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:42:24,059 INFO L168 Benchmark]: Toolchain (without parser) took 27325.83 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 608.7 MB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -389.0 MB). Peak memory consumption was 941.6 MB. Max. memory is 7.1 GB. [2018-10-04 12:42:24,060 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 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:42:24,060 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.83 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:42:24,061 INFO L168 Benchmark]: Boogie Preprocessor took 45.91 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:42:24,062 INFO L168 Benchmark]: RCFGBuilder took 1211.83 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-10-04 12:42:24,062 INFO L168 Benchmark]: TraceAbstraction took 26000.90 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 608.7 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -441.9 MB). Peak memory consumption was 888.8 MB. Max. memory is 7.1 GB. [2018-10-04 12:42:24,067 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.24 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 58.83 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 45.91 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 1211.83 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26000.90 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 608.7 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -441.9 MB). Peak memory consumption was 888.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 635]: 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: 249]: Loop Invariant Derived loop invariant: (~blastFlag~7 <= 4 && ~s__hit~7 == 0) || ~blastFlag~7 <= 0 - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: ((4560 <= ~s__state~7 && ~blastFlag~7 <= 4) && ~s__hit~7 == 0) || (4560 <= ~s__state~7 && ~blastFlag~7 <= 0) - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: ((((~s__s3__tmp__next_state___0~7 <= 4560 && ~s__state~7 <= 4560) && 4352 <= ~s__state~7) && ~s__hit~7 == 0) || (((~s__state~7 <= 4560 && ~blastFlag~7 <= 4) && 4352 <= ~s__state~7) && ~s__hit~7 == 0)) || ((~s__state~7 <= 4560 && ~blastFlag~7 <= 0) && 4352 <= ~s__state~7) - InvariantResult [Line: 311]: Loop Invariant Derived loop invariant: true - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: (((((~s__state~7 <= 4352 && ~blastFlag~7 <= 4) && 4352 <= ~s__state~7) && ~s__hit~7 == 0) || ((((~s__state~7 <= 4352 && ~s__s3__tmp__next_state___0~7 <= 4560) && 4560 <= ~s__s3__tmp__next_state___0~7) && 4352 <= ~s__state~7) && ~s__hit~7 == 0)) || (((~s__state~7 <= 4352 && ~blastFlag~7 <= 2) && ~s__s3__tmp__next_state___0~7 <= 3) && 4352 <= ~s__state~7)) || ((~s__state~7 <= 4352 && ~blastFlag~7 <= 0) && 4352 <= ~s__state~7) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: (((~s__state~7 <= 4560 && ~blastFlag~7 <= 4) && 4352 <= ~s__state~7) && ~s__hit~7 == 0) || ((~s__state~7 <= 4560 && ~blastFlag~7 <= 0) && 4352 <= ~s__state~7) - InvariantResult [Line: 297]: Loop Invariant Derived loop invariant: ((~blastFlag~7 <= 2 && ~s__state~7 <= 4560) && 4464 <= ~s__state~7) || ((~s__state~7 <= 4560 && 4464 <= ~s__state~7) && ~s__hit~7 == 0) - InvariantResult [Line: 360]: Loop Invariant Derived loop invariant: ((((((((((((((~s__state~7 == 4512 && ~s__hit~7 == 0) || ((((~s__state~7 <= 4352 && ~s__s3__tmp__next_state___0~7 <= 4560) && 4560 <= ~s__s3__tmp__next_state___0~7) && 4352 <= ~s__state~7) && ~s__hit~7 == 0)) || ((~blastFlag~7 <= 2 && 4560 <= ~s__state~7) && ~s__state~7 <= 4560)) || ((((4560 <= ~s__state~7 && ~s__state~7 <= 4560) && ~s__s3__tmp__next_state___0~7 <= 4560) && 4560 <= ~s__s3__tmp__next_state___0~7) && ~s__hit~7 == 0)) || (~s__state~7 <= 3 && ~s__s3__tmp__next_state___0~7 <= 4560)) || ~blastFlag~7 <= 0) || (~s__state~7 == 4480 && ~s__hit~7 == 0)) || (((~s__state~7 <= 4352 && ~blastFlag~7 <= 2) && ~s__s3__tmp__next_state___0~7 <= 3) && 4352 <= ~s__state~7)) || (~blastFlag~7 <= 2 && ~s__state~7 == 4384)) || (~blastFlag~7 <= 2 && ~s__state~7 == 4528)) || (~s__state~7 == 4464 && ~s__hit~7 == 0)) || (~blastFlag~7 <= 2 && ~s__state~7 == 4512)) || (~blastFlag~7 <= 4 && ~s__hit~7 == 0)) || (~s__state~7 == 4528 && ~s__hit~7 == 0)) || (~s__state~7 == 4496 && ~s__hit~7 == 0) - InvariantResult [Line: 313]: Loop Invariant Derived loop invariant: true - InvariantResult [Line: 269]: Loop Invariant Derived loop invariant: (((~s__state~7 <= 4560 && ~blastFlag~7 <= 4) && 4352 <= ~s__state~7) && ~s__hit~7 == 0) || ((~s__state~7 <= 4560 && ~blastFlag~7 <= 0) && 4352 <= ~s__state~7) - InvariantResult [Line: 301]: Loop Invariant Derived loop invariant: ((~s__state~7 <= 4560 && 4464 <= ~s__state~7) && ~s__hit~7 == 0) || ((~blastFlag~7 <= 2 && ~s__state~7 <= 4560) && 4464 <= ~s__state~7) - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((~s__state~7 <= 4560 && ~blastFlag~7 <= 4) && 4352 <= ~s__state~7) && ~s__hit~7 == 0) || ((~s__state~7 <= 4560 && ~blastFlag~7 <= 0) && 4352 <= ~s__state~7) - InvariantResult [Line: 289]: Loop Invariant Derived loop invariant: ((~s__state~7 <= 4560 && 4464 <= ~s__state~7) && ~s__hit~7 == 0) || ((~s__state~7 <= 4560 && 4464 <= ~s__state~7) && ~blastFlag~7 <= 0) - InvariantResult [Line: 433]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: ((~blastFlag~7 <= 2 && ~s__state~7 <= 4560) && 4352 <= ~s__state~7) || (((~s__state~7 <= 4560 && ~blastFlag~7 <= 4) && 4352 <= ~s__state~7) && ~s__hit~7 == 0) - InvariantResult [Line: 293]: Loop Invariant Derived loop invariant: ((~s__state~7 <= 4560 && 4464 <= ~s__state~7) && ~s__hit~7 == 0) || ((~s__state~7 <= 4560 && 4464 <= ~s__state~7) && ~blastFlag~7 <= 0) - InvariantResult [Line: 242]: Loop Invariant Derived loop invariant: true - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: ((~s__state~7 <= 4560 && 4464 <= ~s__state~7) && ~s__hit~7 == 0) || ((~s__state~7 <= 4560 && 4464 <= ~s__state~7) && ~blastFlag~7 <= 0) - InvariantResult [Line: 273]: Loop Invariant Derived loop invariant: (((~s__state~7 <= 4560 && ~blastFlag~7 <= 4) && 4352 <= ~s__state~7) && ~s__hit~7 == 0) || ((~s__state~7 <= 4560 && ~blastFlag~7 <= 0) && 4352 <= ~s__state~7) - InvariantResult [Line: 305]: Loop Invariant Derived loop invariant: ((((4560 <= ~s__state~7 && ~blastFlag~7 <= 4) && ~s__hit~7 == 0) || (((4560 <= ~s__state~7 && ~s__state~7 <= 4560) && ~s__s3__tmp__next_state___0~7 <= 4560) && ~s__hit~7 == 0)) || (4560 <= ~s__state~7 && ~blastFlag~7 <= 0)) || ((~blastFlag~7 <= 2 && 4560 <= ~s__state~7) && ~s__state~7 <= 4560) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 128 locations, 1 error locations. SAFE Result, 25.8s OverallTime, 23 OverallIterations, 17 TraceHistogramMax, 12.8s AutomataDifference, 0.0s DeadEndRemovalTime, 5.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 4719 SDtfs, 1578 SDslu, 2802 SDs, 0 SdLazy, 2532 SolverSat, 433 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1107 GetRequests, 1076 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9883occurred in iteration=21, 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: 1.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 4595 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 20 PreInvPairs, 355 NumberOfFragments, 518 HoareAnnotationTreeSize, 20 FomulaSimplifications, 20200 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 20 FomulaSimplificationsInter, 1613 FormulaSimplificationTreeSizeReductionInter, 4.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 5338 NumberOfCodeBlocks, 5338 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 5312 ConstructedInterpolants, 0 QuantifiedInterpolants, 1904120 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1669 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 26 InterpolantComputations, 21 PerfectInterpolantSequences, 16474/16548 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_clnt_1_Safe.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-42-24-084.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_1_Safe.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-42-24-084.csv Received shutdown request...