java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/real-life/s3_clnt_1_Safe.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-00a8621 [2018-09-30 10:14:33,180 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:14:33,182 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:14:33,195 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:14:33,196 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:14:33,197 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:14:33,198 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:14:33,200 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:14:33,201 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:14:33,202 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:14:33,203 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:14:33,203 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:14:33,204 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:14:33,205 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:14:33,206 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:14:33,207 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:14:33,208 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:14:33,210 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:14:33,212 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:14:33,213 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:14:33,214 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:14:33,216 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:14:33,218 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:14:33,218 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:14:33,219 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:14:33,220 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:14:33,221 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:14:33,221 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:14:33,222 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:14:33,223 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:14:33,224 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:14:33,224 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:14:33,225 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:14:33,225 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:14:33,226 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:14:33,227 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:14:33,227 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-30 10:14:33,250 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:14:33,250 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:14:33,251 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:14:33,251 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:14:33,252 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:14:33,252 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:14:33,252 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:14:33,253 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:14:33,253 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:14:33,253 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:14:33,253 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:14:33,253 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:14:33,254 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:14:33,254 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:14:33,254 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:14:33,254 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:14:33,254 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:14:33,255 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:14:33,255 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:14:33,255 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:14:33,255 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:14:33,255 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:14:33,256 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:14:33,256 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:14:33,256 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:14:33,256 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:14:33,256 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:14:33,257 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:14:33,257 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:14:33,257 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:14:33,301 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:14:33,314 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:14:33,319 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:14:33,321 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:14:33,322 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:14:33,322 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-09-30 10:14:33,323 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/s3_clnt_1_Safe.bpl' [2018-09-30 10:14:33,415 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:14:33,419 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:14:33,419 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:14:33,420 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:14:33,420 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:14:33,443 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 30.09 10:14:33" (1/1) ... [2018-09-30 10:14:33,460 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 30.09 10:14:33" (1/1) ... [2018-09-30 10:14:33,466 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 10:14:33,467 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 10:14:33,467 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 10:14:33,469 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:14:33,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:14:33,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:14:33,470 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:14:33,482 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 30.09 10:14:33" (1/1) ... [2018-09-30 10:14:33,483 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 30.09 10:14:33" (1/1) ... [2018-09-30 10:14:33,494 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 30.09 10:14:33" (1/1) ... [2018-09-30 10:14:33,497 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 30.09 10:14:33" (1/1) ... [2018-09-30 10:14:33,517 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 30.09 10:14:33" (1/1) ... [2018-09-30 10:14:33,540 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 30.09 10:14:33" (1/1) ... [2018-09-30 10:14:33,549 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 30.09 10:14:33" (1/1) ... [2018-09-30 10:14:33,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:14:33,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:14:33,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:14:33,563 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:14:33,565 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:33" (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-09-30 10:14:33,627 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-09-30 10:14:33,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-09-30 10:14:33,776 WARN L674 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-09-30 10:14:33,776 WARN L639 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-09-30 10:14:34,705 INFO L345 CfgBuilder]: Using library mode [2018-09-30 10:14:34,706 INFO L202 PluginConnector]: Adding new model s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:14:34 BoogieIcfgContainer [2018-09-30 10:14:34,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:14:34,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:14:34,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:14:34,711 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:14:34,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:33" (1/2) ... [2018-09-30 10:14:34,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449fb438 and model type s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:14:34, skipping insertion in model container [2018-09-30 10:14:34,712 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 30.09 10:14:34" (2/2) ... [2018-09-30 10:14:34,714 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_1_Safe.bpl [2018-09-30 10:14:34,724 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:14:34,736 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 10:14:34,794 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:14:34,795 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:14:34,795 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:14:34,796 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:14:34,796 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:14:34,796 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:14:34,797 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:14:34,797 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:14:34,797 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:14:34,828 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2018-09-30 10:14:34,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-30 10:14:34,838 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:34,839 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-09-30 10:14:34,841 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:34,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:34,848 INFO L82 PathProgramCache]: Analyzing trace with hash 2094316450, now seen corresponding path program 1 times [2018-09-30 10:14:34,850 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:34,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:34,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:34,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:34,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:35,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:35,118 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:35,119 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:14:35,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:14:35,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:14:35,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:35,146 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 3 states. [2018-09-30 10:14:35,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:35,440 INFO L93 Difference]: Finished difference Result 363 states and 621 transitions. [2018-09-30 10:14:35,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:14:35,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-09-30 10:14:35,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:35,461 INFO L225 Difference]: With dead ends: 363 [2018-09-30 10:14:35,461 INFO L226 Difference]: Without dead ends: 214 [2018-09-30 10:14:35,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:35,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-09-30 10:14:35,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2018-09-30 10:14:35,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-09-30 10:14:35,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 320 transitions. [2018-09-30 10:14:35,530 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 320 transitions. Word has length 24 [2018-09-30 10:14:35,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:35,531 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 320 transitions. [2018-09-30 10:14:35,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:14:35,532 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 320 transitions. [2018-09-30 10:14:35,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-30 10:14:35,535 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:35,535 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-09-30 10:14:35,536 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:35,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:35,536 INFO L82 PathProgramCache]: Analyzing trace with hash 59798678, now seen corresponding path program 1 times [2018-09-30 10:14:35,537 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:35,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:35,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:35,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:35,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:35,628 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:35,629 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:35,629 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:14:35,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:14:35,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:14:35,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:35,632 INFO L87 Difference]: Start difference. First operand 214 states and 320 transitions. Second operand 3 states. [2018-09-30 10:14:36,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:36,130 INFO L93 Difference]: Finished difference Result 466 states and 703 transitions. [2018-09-30 10:14:36,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:14:36,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-09-30 10:14:36,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:36,143 INFO L225 Difference]: With dead ends: 466 [2018-09-30 10:14:36,143 INFO L226 Difference]: Without dead ends: 258 [2018-09-30 10:14:36,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:36,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-09-30 10:14:36,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 250. [2018-09-30 10:14:36,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-09-30 10:14:36,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 366 transitions. [2018-09-30 10:14:36,194 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 366 transitions. Word has length 39 [2018-09-30 10:14:36,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:36,194 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 366 transitions. [2018-09-30 10:14:36,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:14:36,198 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 366 transitions. [2018-09-30 10:14:36,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-30 10:14:36,205 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:36,205 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-09-30 10:14:36,206 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:36,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:36,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1333096252, now seen corresponding path program 1 times [2018-09-30 10:14:36,209 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:36,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:36,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:36,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:36,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:36,317 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-30 10:14:36,318 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:36,318 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:14:36,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:14:36,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:14:36,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:36,320 INFO L87 Difference]: Start difference. First operand 250 states and 366 transitions. Second operand 3 states. [2018-09-30 10:14:36,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:36,711 INFO L93 Difference]: Finished difference Result 598 states and 902 transitions. [2018-09-30 10:14:36,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:14:36,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2018-09-30 10:14:36,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:36,717 INFO L225 Difference]: With dead ends: 598 [2018-09-30 10:14:36,718 INFO L226 Difference]: Without dead ends: 352 [2018-09-30 10:14:36,720 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:36,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-09-30 10:14:36,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 334. [2018-09-30 10:14:36,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-09-30 10:14:36,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 468 transitions. [2018-09-30 10:14:36,764 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 468 transitions. Word has length 57 [2018-09-30 10:14:36,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:36,765 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 468 transitions. [2018-09-30 10:14:36,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:14:36,765 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 468 transitions. [2018-09-30 10:14:36,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-30 10:14:36,769 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:36,769 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-09-30 10:14:36,769 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:36,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:36,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1199082746, now seen corresponding path program 1 times [2018-09-30 10:14:36,770 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:36,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:36,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:36,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:36,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:36,855 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-30 10:14:36,856 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:36,856 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:14:36,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:14:36,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:14:36,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:36,857 INFO L87 Difference]: Start difference. First operand 334 states and 468 transitions. Second operand 3 states. [2018-09-30 10:14:37,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:37,127 INFO L93 Difference]: Finished difference Result 710 states and 1007 transitions. [2018-09-30 10:14:37,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:14:37,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2018-09-30 10:14:37,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:37,131 INFO L225 Difference]: With dead ends: 710 [2018-09-30 10:14:37,131 INFO L226 Difference]: Without dead ends: 382 [2018-09-30 10:14:37,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:37,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-09-30 10:14:37,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 374. [2018-09-30 10:14:37,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-09-30 10:14:37,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 518 transitions. [2018-09-30 10:14:37,147 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 518 transitions. Word has length 57 [2018-09-30 10:14:37,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:37,147 INFO L480 AbstractCegarLoop]: Abstraction has 374 states and 518 transitions. [2018-09-30 10:14:37,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:14:37,148 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 518 transitions. [2018-09-30 10:14:37,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-30 10:14:37,151 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:37,151 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-09-30 10:14:37,151 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:37,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:37,152 INFO L82 PathProgramCache]: Analyzing trace with hash 309535550, now seen corresponding path program 1 times [2018-09-30 10:14:37,152 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:37,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:37,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:37,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:37,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:37,222 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-30 10:14:37,222 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:37,223 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:14:37,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:14:37,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:14:37,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:37,224 INFO L87 Difference]: Start difference. First operand 374 states and 518 transitions. Second operand 3 states. [2018-09-30 10:14:37,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:37,543 INFO L93 Difference]: Finished difference Result 850 states and 1212 transitions. [2018-09-30 10:14:37,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:14:37,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-09-30 10:14:37,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:37,551 INFO L225 Difference]: With dead ends: 850 [2018-09-30 10:14:37,551 INFO L226 Difference]: Without dead ends: 480 [2018-09-30 10:14:37,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:37,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2018-09-30 10:14:37,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 454. [2018-09-30 10:14:37,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2018-09-30 10:14:37,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 654 transitions. [2018-09-30 10:14:37,578 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 654 transitions. Word has length 71 [2018-09-30 10:14:37,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:37,579 INFO L480 AbstractCegarLoop]: Abstraction has 454 states and 654 transitions. [2018-09-30 10:14:37,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:14:37,579 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 654 transitions. [2018-09-30 10:14:37,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-30 10:14:37,582 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:37,582 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-09-30 10:14:37,582 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:37,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:37,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1385992431, now seen corresponding path program 1 times [2018-09-30 10:14:37,583 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:37,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:37,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:37,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:37,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:37,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:37,711 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-09-30 10:14:37,711 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:37,711 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:14:37,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:14:37,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:14:37,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:37,713 INFO L87 Difference]: Start difference. First operand 454 states and 654 transitions. Second operand 3 states. [2018-09-30 10:14:38,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:38,052 INFO L93 Difference]: Finished difference Result 952 states and 1377 transitions. [2018-09-30 10:14:38,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:14:38,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-09-30 10:14:38,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:38,057 INFO L225 Difference]: With dead ends: 952 [2018-09-30 10:14:38,057 INFO L226 Difference]: Without dead ends: 504 [2018-09-30 10:14:38,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:38,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2018-09-30 10:14:38,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 498. [2018-09-30 10:14:38,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2018-09-30 10:14:38,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 708 transitions. [2018-09-30 10:14:38,075 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 708 transitions. Word has length 74 [2018-09-30 10:14:38,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:38,076 INFO L480 AbstractCegarLoop]: Abstraction has 498 states and 708 transitions. [2018-09-30 10:14:38,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:14:38,076 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 708 transitions. [2018-09-30 10:14:38,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-09-30 10:14:38,078 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:38,078 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-09-30 10:14:38,078 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:38,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:38,079 INFO L82 PathProgramCache]: Analyzing trace with hash -931646216, now seen corresponding path program 1 times [2018-09-30 10:14:38,079 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:38,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:38,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:38,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:38,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:38,189 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-09-30 10:14:38,190 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:38,190 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:14:38,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:14:38,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:14:38,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:38,191 INFO L87 Difference]: Start difference. First operand 498 states and 708 transitions. Second operand 3 states. [2018-09-30 10:14:38,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:38,405 INFO L93 Difference]: Finished difference Result 990 states and 1411 transitions. [2018-09-30 10:14:38,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:14:38,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2018-09-30 10:14:38,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:38,410 INFO L225 Difference]: With dead ends: 990 [2018-09-30 10:14:38,410 INFO L226 Difference]: Without dead ends: 743 [2018-09-30 10:14:38,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:38,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-09-30 10:14:38,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 743. [2018-09-30 10:14:38,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2018-09-30 10:14:38,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1056 transitions. [2018-09-30 10:14:38,435 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1056 transitions. Word has length 95 [2018-09-30 10:14:38,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:38,436 INFO L480 AbstractCegarLoop]: Abstraction has 743 states and 1056 transitions. [2018-09-30 10:14:38,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:14:38,436 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1056 transitions. [2018-09-30 10:14:38,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-09-30 10:14:38,439 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:38,439 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-09-30 10:14:38,439 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:38,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:38,440 INFO L82 PathProgramCache]: Analyzing trace with hash -664650302, now seen corresponding path program 1 times [2018-09-30 10:14:38,440 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:38,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:38,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:38,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:38,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:38,572 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-09-30 10:14:38,572 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:38,572 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:14:38,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:14:38,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:14:38,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:38,575 INFO L87 Difference]: Start difference. First operand 743 states and 1056 transitions. Second operand 3 states. [2018-09-30 10:14:38,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:38,918 INFO L93 Difference]: Finished difference Result 990 states and 1408 transitions. [2018-09-30 10:14:38,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:14:38,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2018-09-30 10:14:38,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:38,925 INFO L225 Difference]: With dead ends: 990 [2018-09-30 10:14:38,925 INFO L226 Difference]: Without dead ends: 988 [2018-09-30 10:14:38,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:38,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-09-30 10:14:38,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 988. [2018-09-30 10:14:38,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2018-09-30 10:14:38,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1406 transitions. [2018-09-30 10:14:38,956 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1406 transitions. Word has length 97 [2018-09-30 10:14:38,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:38,957 INFO L480 AbstractCegarLoop]: Abstraction has 988 states and 1406 transitions. [2018-09-30 10:14:38,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:14:38,957 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1406 transitions. [2018-09-30 10:14:38,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-09-30 10:14:38,960 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:38,960 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-09-30 10:14:38,961 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:38,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:38,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1840260967, now seen corresponding path program 1 times [2018-09-30 10:14:38,961 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:38,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:38,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:38,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:38,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:39,106 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-09-30 10:14:39,107 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:39,107 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:14:39,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:14:39,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:14:39,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:39,108 INFO L87 Difference]: Start difference. First operand 988 states and 1406 transitions. Second operand 3 states. [2018-09-30 10:14:40,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:40,504 INFO L93 Difference]: Finished difference Result 2080 states and 2976 transitions. [2018-09-30 10:14:40,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:14:40,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2018-09-30 10:14:40,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:40,511 INFO L225 Difference]: With dead ends: 2080 [2018-09-30 10:14:40,511 INFO L226 Difference]: Without dead ends: 1098 [2018-09-30 10:14:40,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:40,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2018-09-30 10:14:40,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 1084. [2018-09-30 10:14:40,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1084 states. [2018-09-30 10:14:40,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1522 transitions. [2018-09-30 10:14:40,544 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1522 transitions. Word has length 123 [2018-09-30 10:14:40,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:40,544 INFO L480 AbstractCegarLoop]: Abstraction has 1084 states and 1522 transitions. [2018-09-30 10:14:40,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:14:40,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1522 transitions. [2018-09-30 10:14:40,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-09-30 10:14:40,548 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:40,549 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-09-30 10:14:40,549 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:40,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:40,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1854917982, now seen corresponding path program 1 times [2018-09-30 10:14:40,550 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:40,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:40,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:40,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:40,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:40,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:40,702 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2018-09-30 10:14:40,702 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:40,702 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:14:40,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:14:40,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:14:40,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:40,703 INFO L87 Difference]: Start difference. First operand 1084 states and 1522 transitions. Second operand 3 states. [2018-09-30 10:14:41,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:41,276 INFO L93 Difference]: Finished difference Result 2370 states and 3378 transitions. [2018-09-30 10:14:41,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:14:41,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2018-09-30 10:14:41,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:41,287 INFO L225 Difference]: With dead ends: 2370 [2018-09-30 10:14:41,288 INFO L226 Difference]: Without dead ends: 1284 [2018-09-30 10:14:41,290 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:41,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2018-09-30 10:14:41,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1244. [2018-09-30 10:14:41,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1244 states. [2018-09-30 10:14:41,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1750 transitions. [2018-09-30 10:14:41,354 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 1750 transitions. Word has length 145 [2018-09-30 10:14:41,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:41,355 INFO L480 AbstractCegarLoop]: Abstraction has 1244 states and 1750 transitions. [2018-09-30 10:14:41,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:14:41,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1750 transitions. [2018-09-30 10:14:41,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-09-30 10:14:41,359 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:41,359 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-09-30 10:14:41,359 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:41,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:41,360 INFO L82 PathProgramCache]: Analyzing trace with hash -109848754, now seen corresponding path program 1 times [2018-09-30 10:14:41,360 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:41,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:41,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:41,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:41,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:41,490 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2018-09-30 10:14:41,490 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:41,490 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:14:41,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:14:41,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:14:41,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:41,492 INFO L87 Difference]: Start difference. First operand 1244 states and 1750 transitions. Second operand 3 states. [2018-09-30 10:14:41,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:41,911 INFO L93 Difference]: Finished difference Result 2606 states and 3638 transitions. [2018-09-30 10:14:41,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:14:41,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2018-09-30 10:14:41,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:41,920 INFO L225 Difference]: With dead ends: 2606 [2018-09-30 10:14:41,921 INFO L226 Difference]: Without dead ends: 1368 [2018-09-30 10:14:41,923 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:41,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2018-09-30 10:14:41,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1360. [2018-09-30 10:14:41,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1360 states. [2018-09-30 10:14:41,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1886 transitions. [2018-09-30 10:14:41,953 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1886 transitions. Word has length 182 [2018-09-30 10:14:41,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:41,953 INFO L480 AbstractCegarLoop]: Abstraction has 1360 states and 1886 transitions. [2018-09-30 10:14:41,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:14:41,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1886 transitions. [2018-09-30 10:14:41,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-09-30 10:14:41,958 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:41,958 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-09-30 10:14:41,958 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:41,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:41,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1851725904, now seen corresponding path program 1 times [2018-09-30 10:14:41,959 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:41,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:41,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:41,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:41,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:42,046 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2018-09-30 10:14:42,046 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:42,046 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:14:42,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:14:42,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:14:42,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:42,048 INFO L87 Difference]: Start difference. First operand 1360 states and 1886 transitions. Second operand 3 states. [2018-09-30 10:14:42,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:42,312 INFO L93 Difference]: Finished difference Result 2854 states and 3946 transitions. [2018-09-30 10:14:42,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:14:42,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2018-09-30 10:14:42,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:42,323 INFO L225 Difference]: With dead ends: 2854 [2018-09-30 10:14:42,324 INFO L226 Difference]: Without dead ends: 1500 [2018-09-30 10:14:42,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:42,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2018-09-30 10:14:42,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1488. [2018-09-30 10:14:42,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1488 states. [2018-09-30 10:14:42,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 2034 transitions. [2018-09-30 10:14:42,362 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 2034 transitions. Word has length 182 [2018-09-30 10:14:42,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:42,362 INFO L480 AbstractCegarLoop]: Abstraction has 1488 states and 2034 transitions. [2018-09-30 10:14:42,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:14:42,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 2034 transitions. [2018-09-30 10:14:42,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-09-30 10:14:42,367 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:42,367 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-09-30 10:14:42,368 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:42,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:42,368 INFO L82 PathProgramCache]: Analyzing trace with hash -853360977, now seen corresponding path program 1 times [2018-09-30 10:14:42,368 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:42,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:42,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:42,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:42,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:42,479 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-09-30 10:14:42,480 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:42,480 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:14:42,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:14:42,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:14:42,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:42,481 INFO L87 Difference]: Start difference. First operand 1488 states and 2034 transitions. Second operand 3 states. [2018-09-30 10:14:43,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:43,060 INFO L93 Difference]: Finished difference Result 3126 states and 4270 transitions. [2018-09-30 10:14:43,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:14:43,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2018-09-30 10:14:43,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:43,068 INFO L225 Difference]: With dead ends: 3126 [2018-09-30 10:14:43,068 INFO L226 Difference]: Without dead ends: 1644 [2018-09-30 10:14:43,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:43,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2018-09-30 10:14:43,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1636. [2018-09-30 10:14:43,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1636 states. [2018-09-30 10:14:43,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 2202 transitions. [2018-09-30 10:14:43,106 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 2202 transitions. Word has length 213 [2018-09-30 10:14:43,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:43,107 INFO L480 AbstractCegarLoop]: Abstraction has 1636 states and 2202 transitions. [2018-09-30 10:14:43,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:14:43,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2202 transitions. [2018-09-30 10:14:43,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-09-30 10:14:43,112 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:43,113 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-09-30 10:14:43,113 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:43,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:43,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1480031661, now seen corresponding path program 1 times [2018-09-30 10:14:43,113 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:43,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:43,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:43,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:43,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:43,233 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 328 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-09-30 10:14:43,233 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:43,234 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:14:43,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:14:43,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:14:43,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:43,235 INFO L87 Difference]: Start difference. First operand 1636 states and 2202 transitions. Second operand 3 states. [2018-09-30 10:14:43,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:43,359 INFO L93 Difference]: Finished difference Result 4772 states and 6442 transitions. [2018-09-30 10:14:43,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:14:43,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2018-09-30 10:14:43,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:43,373 INFO L225 Difference]: With dead ends: 4772 [2018-09-30 10:14:43,373 INFO L226 Difference]: Without dead ends: 3142 [2018-09-30 10:14:43,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:43,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3142 states. [2018-09-30 10:14:43,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3142 to 3140. [2018-09-30 10:14:43,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2018-09-30 10:14:43,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 4241 transitions. [2018-09-30 10:14:43,444 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 4241 transitions. Word has length 213 [2018-09-30 10:14:43,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:43,445 INFO L480 AbstractCegarLoop]: Abstraction has 3140 states and 4241 transitions. [2018-09-30 10:14:43,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:14:43,445 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 4241 transitions. [2018-09-30 10:14:43,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-09-30 10:14:43,452 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:43,453 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-09-30 10:14:43,453 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:43,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:43,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1955375200, now seen corresponding path program 1 times [2018-09-30 10:14:43,453 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:43,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:43,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:43,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:43,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:43,572 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-09-30 10:14:43,573 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:43,573 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:14:43,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:14:43,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:14:43,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:43,574 INFO L87 Difference]: Start difference. First operand 3140 states and 4241 transitions. Second operand 3 states. [2018-09-30 10:14:44,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:44,376 INFO L93 Difference]: Finished difference Result 6426 states and 8672 transitions. [2018-09-30 10:14:44,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:14:44,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 238 [2018-09-30 10:14:44,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:44,391 INFO L225 Difference]: With dead ends: 6426 [2018-09-30 10:14:44,392 INFO L226 Difference]: Without dead ends: 3292 [2018-09-30 10:14:44,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:44,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3292 states. [2018-09-30 10:14:44,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3292 to 3276. [2018-09-30 10:14:44,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3276 states. [2018-09-30 10:14:44,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3276 states to 3276 states and 4397 transitions. [2018-09-30 10:14:44,483 INFO L78 Accepts]: Start accepts. Automaton has 3276 states and 4397 transitions. Word has length 238 [2018-09-30 10:14:44,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:44,484 INFO L480 AbstractCegarLoop]: Abstraction has 3276 states and 4397 transitions. [2018-09-30 10:14:44,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:14:44,484 INFO L276 IsEmpty]: Start isEmpty. Operand 3276 states and 4397 transitions. [2018-09-30 10:14:44,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-09-30 10:14:44,493 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:44,494 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-09-30 10:14:44,494 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:44,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:44,494 INFO L82 PathProgramCache]: Analyzing trace with hash 2043312965, now seen corresponding path program 1 times [2018-09-30 10:14:44,495 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:44,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:44,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:44,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:44,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:44,675 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2018-09-30 10:14:44,675 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:44,675 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:14:44,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:14:44,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:14:44,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:44,680 INFO L87 Difference]: Start difference. First operand 3276 states and 4397 transitions. Second operand 3 states. [2018-09-30 10:14:45,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:45,021 INFO L93 Difference]: Finished difference Result 6954 states and 9464 transitions. [2018-09-30 10:14:45,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:14:45,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2018-09-30 10:14:45,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:45,038 INFO L225 Difference]: With dead ends: 6954 [2018-09-30 10:14:45,038 INFO L226 Difference]: Without dead ends: 3684 [2018-09-30 10:14:45,043 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:45,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3684 states. [2018-09-30 10:14:45,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3684 to 3596. [2018-09-30 10:14:45,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3596 states. [2018-09-30 10:14:45,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3596 states to 3596 states and 4773 transitions. [2018-09-30 10:14:45,109 INFO L78 Accepts]: Start accepts. Automaton has 3596 states and 4773 transitions. Word has length 249 [2018-09-30 10:14:45,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:45,110 INFO L480 AbstractCegarLoop]: Abstraction has 3596 states and 4773 transitions. [2018-09-30 10:14:45,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:14:45,110 INFO L276 IsEmpty]: Start isEmpty. Operand 3596 states and 4773 transitions. [2018-09-30 10:14:45,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-09-30 10:14:45,118 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:45,119 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-09-30 10:14:45,119 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:45,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:45,119 INFO L82 PathProgramCache]: Analyzing trace with hash 713372088, now seen corresponding path program 1 times [2018-09-30 10:14:45,119 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:45,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:45,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:45,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:45,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:45,242 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2018-09-30 10:14:45,242 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:45,242 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:14:45,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:14:45,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:14:45,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:45,243 INFO L87 Difference]: Start difference. First operand 3596 states and 4773 transitions. Second operand 3 states. [2018-09-30 10:14:47,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:47,113 INFO L93 Difference]: Finished difference Result 7602 states and 10024 transitions. [2018-09-30 10:14:47,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:14:47,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 264 [2018-09-30 10:14:47,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:47,130 INFO L225 Difference]: With dead ends: 7602 [2018-09-30 10:14:47,130 INFO L226 Difference]: Without dead ends: 4012 [2018-09-30 10:14:47,135 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:47,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4012 states. [2018-09-30 10:14:47,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4012 to 3724. [2018-09-30 10:14:47,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3724 states. [2018-09-30 10:14:47,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3724 states to 3724 states and 4925 transitions. [2018-09-30 10:14:47,206 INFO L78 Accepts]: Start accepts. Automaton has 3724 states and 4925 transitions. Word has length 264 [2018-09-30 10:14:47,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:47,206 INFO L480 AbstractCegarLoop]: Abstraction has 3724 states and 4925 transitions. [2018-09-30 10:14:47,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:14:47,207 INFO L276 IsEmpty]: Start isEmpty. Operand 3724 states and 4925 transitions. [2018-09-30 10:14:47,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-09-30 10:14:47,217 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:47,217 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-09-30 10:14:47,218 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:47,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:47,218 INFO L82 PathProgramCache]: Analyzing trace with hash -2057089708, now seen corresponding path program 1 times [2018-09-30 10:14:47,218 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:47,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:47,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:47,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:47,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:47,389 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 375 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2018-09-30 10:14:47,390 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:47,390 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:14:47,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:14:47,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:14:47,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:47,391 INFO L87 Difference]: Start difference. First operand 3724 states and 4925 transitions. Second operand 3 states. [2018-09-30 10:14:47,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:47,591 INFO L93 Difference]: Finished difference Result 10640 states and 14147 transitions. [2018-09-30 10:14:47,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:14:47,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2018-09-30 10:14:47,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:47,630 INFO L225 Difference]: With dead ends: 10640 [2018-09-30 10:14:47,631 INFO L226 Difference]: Without dead ends: 6922 [2018-09-30 10:14:47,636 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:47,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6922 states. [2018-09-30 10:14:47,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6922 to 6920. [2018-09-30 10:14:47,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6920 states. [2018-09-30 10:14:47,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6920 states to 6920 states and 9207 transitions. [2018-09-30 10:14:47,766 INFO L78 Accepts]: Start accepts. Automaton has 6920 states and 9207 transitions. Word has length 265 [2018-09-30 10:14:47,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:47,767 INFO L480 AbstractCegarLoop]: Abstraction has 6920 states and 9207 transitions. [2018-09-30 10:14:47,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:14:47,767 INFO L276 IsEmpty]: Start isEmpty. Operand 6920 states and 9207 transitions. [2018-09-30 10:14:47,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-09-30 10:14:47,780 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:47,780 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-09-30 10:14:47,781 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:47,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:47,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1026771827, now seen corresponding path program 1 times [2018-09-30 10:14:47,781 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:47,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:47,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:47,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:47,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:47,914 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 373 proven. 0 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2018-09-30 10:14:47,915 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:47,915 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:14:47,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:14:47,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:14:47,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:47,916 INFO L87 Difference]: Start difference. First operand 6920 states and 9207 transitions. Second operand 3 states. [2018-09-30 10:14:48,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:48,731 INFO L93 Difference]: Finished difference Result 13842 states and 18396 transitions. [2018-09-30 10:14:48,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:14:48,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 266 [2018-09-30 10:14:48,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:48,749 INFO L225 Difference]: With dead ends: 13842 [2018-09-30 10:14:48,749 INFO L226 Difference]: Without dead ends: 6928 [2018-09-30 10:14:48,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:48,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6928 states. [2018-09-30 10:14:48,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6928 to 6896. [2018-09-30 10:14:48,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6896 states. [2018-09-30 10:14:48,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6896 states to 6896 states and 8991 transitions. [2018-09-30 10:14:48,895 INFO L78 Accepts]: Start accepts. Automaton has 6896 states and 8991 transitions. Word has length 266 [2018-09-30 10:14:48,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:48,895 INFO L480 AbstractCegarLoop]: Abstraction has 6896 states and 8991 transitions. [2018-09-30 10:14:48,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:14:48,896 INFO L276 IsEmpty]: Start isEmpty. Operand 6896 states and 8991 transitions. [2018-09-30 10:14:48,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-09-30 10:14:48,911 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:48,911 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-09-30 10:14:48,911 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:48,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:48,912 INFO L82 PathProgramCache]: Analyzing trace with hash 2111243411, now seen corresponding path program 1 times [2018-09-30 10:14:48,912 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:48,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:48,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:48,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:48,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:49,259 INFO L134 CoverageAnalysis]: Checked inductivity of 917 backedges. 336 proven. 19 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2018-09-30 10:14:49,259 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:14:49,259 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-09-30 10:14:49,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:49,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:49,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:14:49,521 INFO L134 CoverageAnalysis]: Checked inductivity of 917 backedges. 336 proven. 19 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2018-09-30 10:14:49,559 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:14:49,559 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-09-30 10:14:49,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:14:49,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:14:49,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 10:14:49,562 INFO L87 Difference]: Start difference. First operand 6896 states and 8991 transitions. Second operand 4 states. [2018-09-30 10:14:52,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:52,105 INFO L93 Difference]: Finished difference Result 13708 states and 17869 transitions. [2018-09-30 10:14:52,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:14:52,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 289 [2018-09-30 10:14:52,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:52,125 INFO L225 Difference]: With dead ends: 13708 [2018-09-30 10:14:52,125 INFO L226 Difference]: Without dead ends: 10342 [2018-09-30 10:14:52,131 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-30 10:14:52,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10342 states. [2018-09-30 10:14:52,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10342 to 8856. [2018-09-30 10:14:52,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8856 states. [2018-09-30 10:14:52,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8856 states to 8856 states and 11545 transitions. [2018-09-30 10:14:52,305 INFO L78 Accepts]: Start accepts. Automaton has 8856 states and 11545 transitions. Word has length 289 [2018-09-30 10:14:52,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:52,306 INFO L480 AbstractCegarLoop]: Abstraction has 8856 states and 11545 transitions. [2018-09-30 10:14:52,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:14:52,306 INFO L276 IsEmpty]: Start isEmpty. Operand 8856 states and 11545 transitions. [2018-09-30 10:14:52,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-09-30 10:14:52,324 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:52,325 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-09-30 10:14:52,325 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:52,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:52,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1098716245, now seen corresponding path program 1 times [2018-09-30 10:14:52,326 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:52,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:52,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:52,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:52,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:52,580 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 413 proven. 6 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2018-09-30 10:14:52,580 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:14:52,580 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:14:52,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:52,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:14:52,865 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2018-09-30 10:14:52,895 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 10:14:52,895 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-09-30 10:14:52,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:14:52,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:14:52,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-09-30 10:14:52,897 INFO L87 Difference]: Start difference. First operand 8856 states and 11545 transitions. Second operand 5 states. [2018-09-30 10:14:55,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:55,878 INFO L93 Difference]: Finished difference Result 20921 states and 27145 transitions. [2018-09-30 10:14:55,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 10:14:55,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 303 [2018-09-30 10:14:55,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:55,905 INFO L225 Difference]: With dead ends: 20921 [2018-09-30 10:14:55,906 INFO L226 Difference]: Without dead ends: 12063 [2018-09-30 10:14:55,918 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:14:55,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12063 states. [2018-09-30 10:14:56,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12063 to 9883. [2018-09-30 10:14:56,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9883 states. [2018-09-30 10:14:56,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9883 states to 9883 states and 12626 transitions. [2018-09-30 10:14:56,172 INFO L78 Accepts]: Start accepts. Automaton has 9883 states and 12626 transitions. Word has length 303 [2018-09-30 10:14:56,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:56,173 INFO L480 AbstractCegarLoop]: Abstraction has 9883 states and 12626 transitions. [2018-09-30 10:14:56,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:14:56,173 INFO L276 IsEmpty]: Start isEmpty. Operand 9883 states and 12626 transitions. [2018-09-30 10:14:56,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-09-30 10:14:56,202 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:56,202 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-09-30 10:14:56,203 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:56,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:56,203 INFO L82 PathProgramCache]: Analyzing trace with hash -708971903, now seen corresponding path program 1 times [2018-09-30 10:14:56,203 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:56,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:56,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:56,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:56,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:56,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 918 proven. 0 refuted. 0 times theorem prover too weak. 1097 trivial. 0 not checked. [2018-09-30 10:14:56,463 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:56,463 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:14:56,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:14:56,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:14:56,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:56,465 INFO L87 Difference]: Start difference. First operand 9883 states and 12626 transitions. Second operand 3 states. [2018-09-30 10:14:57,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:57,702 INFO L93 Difference]: Finished difference Result 18554 states and 23425 transitions. [2018-09-30 10:14:57,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:14:57,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 414 [2018-09-30 10:14:57,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:57,714 INFO L225 Difference]: With dead ends: 18554 [2018-09-30 10:14:57,714 INFO L226 Difference]: Without dead ends: 4012 [2018-09-30 10:14:57,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:57,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4012 states. [2018-09-30 10:14:57,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4012 to 3659. [2018-09-30 10:14:57,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3659 states. [2018-09-30 10:14:57,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3659 states to 3659 states and 4577 transitions. [2018-09-30 10:14:57,792 INFO L78 Accepts]: Start accepts. Automaton has 3659 states and 4577 transitions. Word has length 414 [2018-09-30 10:14:57,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:57,793 INFO L480 AbstractCegarLoop]: Abstraction has 3659 states and 4577 transitions. [2018-09-30 10:14:57,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:14:57,793 INFO L276 IsEmpty]: Start isEmpty. Operand 3659 states and 4577 transitions. [2018-09-30 10:14:57,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2018-09-30 10:14:57,806 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:57,806 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-09-30 10:14:57,807 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:57,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:57,807 INFO L82 PathProgramCache]: Analyzing trace with hash -2022233952, now seen corresponding path program 1 times [2018-09-30 10:14:57,807 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:57,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:57,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:57,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:57,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:58,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2074 backedges. 1299 proven. 15 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-09-30 10:14:58,068 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:14:58,068 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-09-30 10:14:58,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:58,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:14:58,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2074 backedges. 1299 proven. 15 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-09-30 10:14:58,280 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:14:58,280 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-09-30 10:14:58,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:14:58,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:14:58,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 10:14:58,281 INFO L87 Difference]: Start difference. First operand 3659 states and 4577 transitions. Second operand 4 states. [2018-09-30 10:14:58,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:58,545 INFO L93 Difference]: Finished difference Result 4485 states and 5603 transitions. [2018-09-30 10:14:58,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 10:14:58,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 443 [2018-09-30 10:14:58,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:58,546 INFO L225 Difference]: With dead ends: 4485 [2018-09-30 10:14:58,546 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 10:14:58,551 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 445 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-30 10:14:58,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 10:14:58,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 10:14:58,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 10:14:58,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 10:14:58,552 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 443 [2018-09-30 10:14:58,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:58,553 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 10:14:58,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:14:58,553 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 10:14:58,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 10:14:58,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 10:14:58,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:58,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:58,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:58,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:58,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:58,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:58,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:58,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:58,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:58,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:58,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:58,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:58,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:59,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:59,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:59,054 WARN L178 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 352 DAG size of output: 63 [2018-09-30 10:14:59,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:59,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:59,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:59,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:59,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:59,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:59,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:59,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:59,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:59,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:59,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:59,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:59,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:59,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:59,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:59,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:59,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:59,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:59,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:59,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:59,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:59,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:59,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:59,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:59,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:59,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:59,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:59,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:59,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:15:00,225 WARN L178 SmtUtils]: Spent 947.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 9 [2018-09-30 10:15:00,709 WARN L178 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 14 [2018-09-30 10:15:01,110 WARN L178 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2018-09-30 10:15:01,268 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 14 [2018-09-30 10:15:01,601 INFO L426 ceAbstractionStarter]: For program point L432(lines 432 434) no Hoare annotation was computed. [2018-09-30 10:15:01,601 INFO L426 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2018-09-30 10:15:01,601 INFO L426 ceAbstractionStarter]: For program point L300(lines 300 603) no Hoare annotation was computed. [2018-09-30 10:15:01,602 INFO L426 ceAbstractionStarter]: For program point L366-2(lines 366 371) no Hoare annotation was computed. [2018-09-30 10:15:01,602 INFO L422 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-09-30 10:15:01,602 INFO L426 ceAbstractionStarter]: For program point L532(lines 532 544) no Hoare annotation was computed. [2018-09-30 10:15:01,602 INFO L426 ceAbstractionStarter]: For program point L532-1(lines 532 544) no Hoare annotation was computed. [2018-09-30 10:15:01,602 INFO L422 ceAbstractionStarter]: At program point L433(lines 433 636) the Hoare annotation is: false [2018-09-30 10:15:01,602 INFO L426 ceAbstractionStarter]: For program point L334(lines 334 346) no Hoare annotation was computed. [2018-09-30 10:15:01,603 INFO L426 ceAbstractionStarter]: For program point L268(lines 268 603) no Hoare annotation was computed. [2018-09-30 10:15:01,603 INFO L426 ceAbstractionStarter]: For program point L334-2(lines 334 350) no Hoare annotation was computed. [2018-09-30 10:15:01,603 INFO L426 ceAbstractionStarter]: For program point L235(lines 235 238) no Hoare annotation was computed. [2018-09-30 10:15:01,603 INFO L426 ceAbstractionStarter]: For program point L401(lines 401 403) no Hoare annotation was computed. [2018-09-30 10:15:01,603 INFO L426 ceAbstractionStarter]: For program point L401-2(lines 401 406) no Hoare annotation was computed. [2018-09-30 10:15:01,603 INFO L426 ceAbstractionStarter]: For program point L302(lines 302 603) no Hoare annotation was computed. [2018-09-30 10:15:01,603 INFO L426 ceAbstractionStarter]: For program point L236(lines 236 237) no Hoare annotation was computed. [2018-09-30 10:15:01,603 INFO L426 ceAbstractionStarter]: For program point L567(lines 567 570) no Hoare annotation was computed. [2018-09-30 10:15:01,603 INFO L426 ceAbstractionStarter]: For program point L501(lines 501 503) no Hoare annotation was computed. [2018-09-30 10:15:01,603 INFO L426 ceAbstractionStarter]: For program point L435(lines 435 437) no Hoare annotation was computed. [2018-09-30 10:15:01,603 INFO L422 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-09-30 10:15:01,604 INFO L426 ceAbstractionStarter]: For program point L270(lines 270 603) no Hoare annotation was computed. [2018-09-30 10:15:01,604 INFO L426 ceAbstractionStarter]: For program point L634(lines 634 636) no Hoare annotation was computed. [2018-09-30 10:15:01,604 INFO L422 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-09-30 10:15:01,604 INFO L426 ceAbstractionStarter]: For program point L535(lines 535 541) no Hoare annotation was computed. [2018-09-30 10:15:01,604 INFO L426 ceAbstractionStarter]: For program point L337(lines 337 340) no Hoare annotation was computed. [2018-09-30 10:15:01,604 INFO L426 ceAbstractionStarter]: For program point L304(lines 304 603) no Hoare annotation was computed. [2018-09-30 10:15:01,604 INFO L422 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-09-30 10:15:01,604 INFO L426 ceAbstractionStarter]: For program point L272(lines 272 603) no Hoare annotation was computed. [2018-09-30 10:15:01,605 INFO L426 ceAbstractionStarter]: For program point L239(lines 235 623) no Hoare annotation was computed. [2018-09-30 10:15:01,605 INFO L426 ceAbstractionStarter]: For program point L306(lines 306 603) no Hoare annotation was computed. [2018-09-30 10:15:01,605 INFO L426 ceAbstractionStarter]: For program point L604(lines 604 621) no Hoare annotation was computed. [2018-09-30 10:15:01,605 INFO L422 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-09-30 10:15:01,605 INFO L426 ceAbstractionStarter]: For program point L274(lines 274 603) no Hoare annotation was computed. [2018-09-30 10:15:01,605 INFO L426 ceAbstractionStarter]: For program point L241(lines 241 243) no Hoare annotation was computed. [2018-09-30 10:15:01,605 INFO L426 ceAbstractionStarter]: For program point L605(lines 605 620) no Hoare annotation was computed. [2018-09-30 10:15:01,605 INFO L426 ceAbstractionStarter]: For program point L374(lines 374 375) no Hoare annotation was computed. [2018-09-30 10:15:01,605 INFO L426 ceAbstractionStarter]: For program point L341(lines 341 344) no Hoare annotation was computed. [2018-09-30 10:15:01,605 INFO L426 ceAbstractionStarter]: For program point L308(lines 308 603) no Hoare annotation was computed. [2018-09-30 10:15:01,606 INFO L422 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-09-30 10:15:01,606 INFO L426 ceAbstractionStarter]: For program point L606(lines 606 612) no Hoare annotation was computed. [2018-09-30 10:15:01,606 INFO L426 ceAbstractionStarter]: For program point L606-2(lines 606 619) no Hoare annotation was computed. [2018-09-30 10:15:01,606 INFO L426 ceAbstractionStarter]: For program point L507(lines 507 511) no Hoare annotation was computed. [2018-09-30 10:15:01,606 INFO L426 ceAbstractionStarter]: For program point L474(lines 474 476) no Hoare annotation was computed. [2018-09-30 10:15:01,606 INFO L426 ceAbstractionStarter]: For program point L507-2(lines 507 515) no Hoare annotation was computed. [2018-09-30 10:15:01,606 INFO L422 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-09-30 10:15:01,606 INFO L426 ceAbstractionStarter]: For program point L276(lines 276 603) no Hoare annotation was computed. [2018-09-30 10:15:01,606 INFO L426 ceAbstractionStarter]: For program point L310(lines 310 603) no Hoare annotation was computed. [2018-09-30 10:15:01,607 INFO L426 ceAbstractionStarter]: For program point L244(line 244) no Hoare annotation was computed. [2018-09-30 10:15:01,607 INFO L429 ceAbstractionStarter]: At program point L311(lines 311 578) the Hoare annotation is: true [2018-09-30 10:15:01,607 INFO L426 ceAbstractionStarter]: For program point L278(lines 278 603) no Hoare annotation was computed. [2018-09-30 10:15:01,607 INFO L426 ceAbstractionStarter]: For program point L609(lines 609 611) no Hoare annotation was computed. [2018-09-30 10:15:01,607 INFO L426 ceAbstractionStarter]: For program point L576-1(lines 576 578) no Hoare annotation was computed. [2018-09-30 10:15:01,607 INFO L422 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-09-30 10:15:01,607 INFO L426 ceAbstractionStarter]: For program point L246(lines 246 603) no Hoare annotation was computed. [2018-09-30 10:15:01,607 INFO L426 ceAbstractionStarter]: For program point L478(lines 478 483) no Hoare annotation was computed. [2018-09-30 10:15:01,607 INFO L426 ceAbstractionStarter]: For program point L445(lines 445 447) no Hoare annotation was computed. [2018-09-30 10:15:01,607 INFO L426 ceAbstractionStarter]: For program point L478-2(lines 478 483) no Hoare annotation was computed. [2018-09-30 10:15:01,608 INFO L426 ceAbstractionStarter]: For program point L445-2(lines 445 450) no Hoare annotation was computed. [2018-09-30 10:15:01,608 INFO L429 ceAbstractionStarter]: At program point L313(lines 313 597) the Hoare annotation is: true [2018-09-30 10:15:01,608 INFO L426 ceAbstractionStarter]: For program point L280(lines 280 603) no Hoare annotation was computed. [2018-09-30 10:15:01,608 INFO L422 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-09-30 10:15:01,608 INFO L426 ceAbstractionStarter]: For program point L248(lines 248 603) no Hoare annotation was computed. [2018-09-30 10:15:01,608 INFO L426 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONASSERT(line 635) no Hoare annotation was computed. [2018-09-30 10:15:01,608 INFO L426 ceAbstractionStarter]: For program point L381(lines 381 383) no Hoare annotation was computed. [2018-09-30 10:15:01,608 INFO L426 ceAbstractionStarter]: For program point L381-2(lines 381 386) no Hoare annotation was computed. [2018-09-30 10:15:01,608 INFO L426 ceAbstractionStarter]: For program point L282(lines 282 603) no Hoare annotation was computed. [2018-09-30 10:15:01,609 INFO L426 ceAbstractionStarter]: For program point ssl3_connectENTRY(lines 15 640) no Hoare annotation was computed. [2018-09-30 10:15:01,609 INFO L426 ceAbstractionStarter]: For program point L415(lines 415 417) no Hoare annotation was computed. [2018-09-30 10:15:01,609 INFO L426 ceAbstractionStarter]: For program point L415-2(lines 415 420) no Hoare annotation was computed. [2018-09-30 10:15:01,609 INFO L426 ceAbstractionStarter]: For program point L250(lines 250 603) no Hoare annotation was computed. [2018-09-30 10:15:01,609 INFO L426 ceAbstractionStarter]: For program point L614(lines 614 618) no Hoare annotation was computed. [2018-09-30 10:15:01,609 INFO L426 ceAbstractionStarter]: For program point L581(lines 581 582) no Hoare annotation was computed. [2018-09-30 10:15:01,609 INFO L426 ceAbstractionStarter]: For program point L581-2(lines 581 582) no Hoare annotation was computed. [2018-09-30 10:15:01,609 INFO L426 ceAbstractionStarter]: For program point L284(lines 284 603) no Hoare annotation was computed. [2018-09-30 10:15:01,609 INFO L426 ceAbstractionStarter]: For program point L516(lines 516 519) no Hoare annotation was computed. [2018-09-30 10:15:01,609 INFO L426 ceAbstractionStarter]: For program point L351(lines 351 354) no Hoare annotation was computed. [2018-09-30 10:15:01,609 INFO L426 ceAbstractionStarter]: For program point L252(lines 252 603) no Hoare annotation was computed. [2018-09-30 10:15:01,610 INFO L426 ceAbstractionStarter]: For program point L451(lines 451 455) no Hoare annotation was computed. [2018-09-30 10:15:01,610 INFO L426 ceAbstractionStarter]: For program point L451-2(lines 451 455) no Hoare annotation was computed. [2018-09-30 10:15:01,610 INFO L426 ceAbstractionStarter]: For program point L286(lines 286 603) no Hoare annotation was computed. [2018-09-30 10:15:01,610 INFO L426 ceAbstractionStarter]: For program point L551(lines 551 553) no Hoare annotation was computed. [2018-09-30 10:15:01,610 INFO L426 ceAbstractionStarter]: For program point $Ultimate##85(lines 314 602) no Hoare annotation was computed. [2018-09-30 10:15:01,610 INFO L426 ceAbstractionStarter]: For program point $Ultimate##84(lines 314 602) no Hoare annotation was computed. [2018-09-30 10:15:01,610 INFO L422 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-09-30 10:15:01,610 INFO L426 ceAbstractionStarter]: For program point L254(lines 254 603) no Hoare annotation was computed. [2018-09-30 10:15:01,610 INFO L426 ceAbstractionStarter]: For program point L585(lines 585 589) no Hoare annotation was computed. [2018-09-30 10:15:01,610 INFO L426 ceAbstractionStarter]: For program point L585-2(lines 585 589) no Hoare annotation was computed. [2018-09-30 10:15:01,611 INFO L426 ceAbstractionStarter]: For program point L387(lines 387 391) no Hoare annotation was computed. [2018-09-30 10:15:01,611 INFO L422 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-09-30 10:15:01,611 INFO L426 ceAbstractionStarter]: For program point L387-2(lines 387 391) no Hoare annotation was computed. [2018-09-30 10:15:01,611 INFO L426 ceAbstractionStarter]: For program point L288(lines 288 603) no Hoare annotation was computed. [2018-09-30 10:15:01,611 INFO L426 ceAbstractionStarter]: For program point L256(lines 256 603) no Hoare annotation was computed. [2018-09-30 10:15:01,611 INFO L426 ceAbstractionStarter]: For program point L554(lines 554 558) no Hoare annotation was computed. [2018-09-30 10:15:01,611 INFO L426 ceAbstractionStarter]: For program point L554-2(lines 554 558) no Hoare annotation was computed. [2018-09-30 10:15:01,611 INFO L426 ceAbstractionStarter]: For program point L290(lines 290 603) no Hoare annotation was computed. [2018-09-30 10:15:01,611 INFO L426 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 15 640) no Hoare annotation was computed. [2018-09-30 10:15:01,611 INFO L426 ceAbstractionStarter]: For program point L423(lines 423 426) no Hoare annotation was computed. [2018-09-30 10:15:01,612 INFO L422 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-09-30 10:15:01,612 INFO L426 ceAbstractionStarter]: For program point L258(lines 258 603) no Hoare annotation was computed. [2018-09-30 10:15:01,612 INFO L426 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 15 640) no Hoare annotation was computed. [2018-09-30 10:15:01,612 INFO L426 ceAbstractionStarter]: For program point L490(lines 490 492) no Hoare annotation was computed. [2018-09-30 10:15:01,612 INFO L426 ceAbstractionStarter]: For program point L292(lines 292 603) no Hoare annotation was computed. [2018-09-30 10:15:01,612 INFO L422 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-09-30 10:15:01,612 INFO L426 ceAbstractionStarter]: For program point L326(lines 326 327) no Hoare annotation was computed. [2018-09-30 10:15:01,612 INFO L426 ceAbstractionStarter]: For program point L260(lines 260 603) no Hoare annotation was computed. [2018-09-30 10:15:01,612 INFO L426 ceAbstractionStarter]: For program point L326-2(lines 326 327) no Hoare annotation was computed. [2018-09-30 10:15:01,613 INFO L426 ceAbstractionStarter]: For program point L227(lines 227 231) no Hoare annotation was computed. [2018-09-30 10:15:01,613 INFO L429 ceAbstractionStarter]: At program point L624(lines 242 624) the Hoare annotation is: true [2018-09-30 10:15:01,613 INFO L426 ceAbstractionStarter]: For program point L525(lines 525 527) no Hoare annotation was computed. [2018-09-30 10:15:01,613 INFO L426 ceAbstractionStarter]: For program point L294(lines 294 603) no Hoare annotation was computed. [2018-09-30 10:15:01,613 INFO L422 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-09-30 10:15:01,613 INFO L426 ceAbstractionStarter]: For program point L262(lines 262 603) no Hoare annotation was computed. [2018-09-30 10:15:01,613 INFO L426 ceAbstractionStarter]: For program point L229(lines 229 231) no Hoare annotation was computed. [2018-09-30 10:15:01,613 INFO L426 ceAbstractionStarter]: For program point L229-2(lines 227 231) no Hoare annotation was computed. [2018-09-30 10:15:01,613 INFO L426 ceAbstractionStarter]: For program point L329(lines 329 332) no Hoare annotation was computed. [2018-09-30 10:15:01,613 INFO L426 ceAbstractionStarter]: For program point L296(lines 296 603) no Hoare annotation was computed. [2018-09-30 10:15:01,614 INFO L422 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-09-30 10:15:01,614 INFO L426 ceAbstractionStarter]: For program point L594(lines 594 595) no Hoare annotation was computed. [2018-09-30 10:15:01,614 INFO L426 ceAbstractionStarter]: For program point L396-1(lines 396 407) no Hoare annotation was computed. [2018-09-30 10:15:01,614 INFO L426 ceAbstractionStarter]: For program point L264(lines 264 603) no Hoare annotation was computed. [2018-09-30 10:15:01,614 INFO L426 ceAbstractionStarter]: For program point L298(lines 298 603) no Hoare annotation was computed. [2018-09-30 10:15:01,614 INFO L426 ceAbstractionStarter]: For program point L629(lines 629 630) no Hoare annotation was computed. [2018-09-30 10:15:01,614 INFO L426 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-09-30 10:15:01,614 INFO L426 ceAbstractionStarter]: For program point L629-2(lines 629 630) no Hoare annotation was computed. [2018-09-30 10:15:01,614 INFO L426 ceAbstractionStarter]: For program point L563-2(lines 563 572) no Hoare annotation was computed. [2018-09-30 10:15:01,614 INFO L426 ceAbstractionStarter]: For program point L464(lines 464 466) no Hoare annotation was computed. [2018-09-30 10:15:01,615 INFO L422 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-09-30 10:15:01,615 INFO L426 ceAbstractionStarter]: For program point L266(lines 266 603) no Hoare annotation was computed. [2018-09-30 10:15:01,632 INFO L202 PluginConnector]: Adding new model s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 10:15:01 BoogieIcfgContainer [2018-09-30 10:15:01,632 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:15:01,633 INFO L168 Benchmark]: Toolchain (without parser) took 28217.58 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 605.6 MB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -375.4 MB). Peak memory consumption was 920.6 MB. Max. memory is 7.1 GB. [2018-09-30 10:15:01,634 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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-09-30 10:15:01,635 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.04 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-09-30 10:15:01,635 INFO L168 Benchmark]: Boogie Preprocessor took 89.51 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-09-30 10:15:01,636 INFO L168 Benchmark]: RCFGBuilder took 1146.52 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-09-30 10:15:01,636 INFO L168 Benchmark]: TraceAbstraction took 26925.04 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 605.6 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -428.2 MB). Peak memory consumption was 867.7 MB. Max. memory is 7.1 GB. [2018-09-30 10:15:01,640 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.20 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 50.04 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 89.51 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 1146.52 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 26925.04 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 605.6 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -428.2 MB). Peak memory consumption was 867.7 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, 26.8s OverallTime, 23 OverallIterations, 17 TraceHistogramMax, 17.4s AutomataDifference, 0.0s DeadEndRemovalTime, 3.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4719 SDtfs, 1566 SDslu, 2813 SDs, 0 SdLazy, 2570 SolverSat, 431 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1111 GetRequests, 1080 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s 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.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 4595 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 20 PreInvPairs, 355 NumberOfFragments, 518 HoareAnnotationTreeSize, 20 FomulaSimplifications, 20200 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 20 FomulaSimplificationsInter, 1613 FormulaSimplificationTreeSizeReductionInter, 2.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.5s 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.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_10-15-01-657.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_1_Safe.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_10-15-01-657.csv Received shutdown request...