java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_4.cil.c_20.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-935f392 [2018-07-23 13:49:44,397 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:49:44,399 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:49:44,412 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:49:44,412 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:49:44,413 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:49:44,414 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:49:44,416 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:49:44,418 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:49:44,419 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:49:44,420 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:49:44,420 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:49:44,421 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:49:44,427 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:49:44,428 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:49:44,429 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:49:44,430 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:49:44,438 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:49:44,440 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:49:44,442 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:49:44,446 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:49:44,450 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:49:44,453 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:49:44,453 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:49:44,453 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:49:44,454 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:49:44,458 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:49:44,459 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:49:44,460 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:49:44,461 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:49:44,465 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:49:44,466 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:49:44,466 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:49:44,467 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:49:44,468 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:49:44,469 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:49:44,469 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf [2018-07-23 13:49:44,495 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:49:44,495 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:49:44,499 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:49:44,500 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:49:44,500 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:49:44,500 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:49:44,500 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:49:44,500 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:49:44,561 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:49:44,577 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:49:44,584 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:49:44,586 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:49:44,587 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:49:44,588 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_4.cil.c_20.bpl [2018-07-23 13:49:44,588 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_4.cil.c_20.bpl' [2018-07-23 13:49:44,691 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:49:44,692 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:49:44,693 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:49:44,693 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:49:44,693 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:49:44,722 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:44" (1/1) ... [2018-07-23 13:49:44,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:44" (1/1) ... [2018-07-23 13:49:44,741 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:44" (1/1) ... [2018-07-23 13:49:44,742 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:44" (1/1) ... [2018-07-23 13:49:44,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:44" (1/1) ... [2018-07-23 13:49:44,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:44" (1/1) ... [2018-07-23 13:49:44,764 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:44" (1/1) ... [2018-07-23 13:49:44,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:49:44,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:49:44,780 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:49:44,780 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:49:44,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:44" (1/1) ... [2018-07-23 13:49:44,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 13:49:44,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 13:49:45,571 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 13:49:45,572 INFO L202 PluginConnector]: Adding new model s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:49:45 BoogieIcfgContainer [2018-07-23 13:49:45,572 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:49:45,573 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:49:45,574 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:49:45,577 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:49:45,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:44" (1/2) ... [2018-07-23 13:49:45,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4221f206 and model type s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:49:45, skipping insertion in model container [2018-07-23 13:49:45,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:49:45" (2/2) ... [2018-07-23 13:49:45,582 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_4.cil.c_20.bpl [2018-07-23 13:49:45,592 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:49:45,602 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 13:49:45,645 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:49:45,646 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:49:45,646 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:49:45,646 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:49:45,646 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:49:45,647 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:49:45,647 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:49:45,647 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:49:45,647 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:49:45,662 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-07-23 13:49:45,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:49:45,673 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:45,674 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:45,674 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:45,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1912788263, now seen corresponding path program 1 times [2018-07-23 13:49:45,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:45,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:45,795 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:45,795 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 13:49:45,797 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:45,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:45,799 INFO L185 omatonBuilderFactory]: Interpolants [17#true, 18#false, 19#(= ULTIMATE.start_ssl3_connect_~s__state~4 12292)] [2018-07-23 13:49:45,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:45,800 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:49:45,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:49:45,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:45,819 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2018-07-23 13:49:45,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:45,893 INFO L93 Difference]: Finished difference Result 29 states and 46 transitions. [2018-07-23 13:49:45,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:49:45,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-07-23 13:49:45,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:45,927 INFO L225 Difference]: With dead ends: 29 [2018-07-23 13:49:45,927 INFO L226 Difference]: Without dead ends: 16 [2018-07-23 13:49:45,934 INFO L575 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-07-23 13:49:45,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-23 13:49:45,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-23 13:49:45,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-23 13:49:45,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2018-07-23 13:49:45,978 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 23 transitions. Word has length 10 [2018-07-23 13:49:45,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:45,979 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 23 transitions. [2018-07-23 13:49:45,979 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:49:45,979 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 23 transitions. [2018-07-23 13:49:45,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:49:45,980 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:45,980 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:45,980 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:45,984 INFO L82 PathProgramCache]: Analyzing trace with hash -694562177, now seen corresponding path program 1 times [2018-07-23 13:49:45,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:46,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:46,018 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:46,018 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:49:46,018 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:46,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:46,019 INFO L185 omatonBuilderFactory]: Interpolants [112#(= ULTIMATE.start_ssl3_connect_~s__state~4 4368), 110#true, 111#false] [2018-07-23 13:49:46,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:46,021 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:49:46,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:49:46,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:46,022 INFO L87 Difference]: Start difference. First operand 16 states and 23 transitions. Second operand 3 states. [2018-07-23 13:49:46,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:46,080 INFO L93 Difference]: Finished difference Result 33 states and 49 transitions. [2018-07-23 13:49:46,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:49:46,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-07-23 13:49:46,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:46,082 INFO L225 Difference]: With dead ends: 33 [2018-07-23 13:49:46,082 INFO L226 Difference]: Without dead ends: 20 [2018-07-23 13:49:46,084 INFO L575 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-07-23 13:49:46,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-23 13:49:46,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-07-23 13:49:46,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-07-23 13:49:46,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-07-23 13:49:46,090 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 13 [2018-07-23 13:49:46,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:46,090 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-07-23 13:49:46,091 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:49:46,091 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2018-07-23 13:49:46,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-23 13:49:46,092 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:46,092 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:46,092 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:46,092 INFO L82 PathProgramCache]: Analyzing trace with hash 479561661, now seen corresponding path program 1 times [2018-07-23 13:49:46,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:46,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:46,131 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 13:49:46,131 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:46,131 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:49:46,132 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:46,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:46,133 INFO L185 omatonBuilderFactory]: Interpolants [219#true, 220#false, 221#(= ULTIMATE.start_ssl3_connect_~s__state~4 4384)] [2018-07-23 13:49:46,134 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 13:49:46,134 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:49:46,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:49:46,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:46,136 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second operand 3 states. [2018-07-23 13:49:46,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:46,213 INFO L93 Difference]: Finished difference Result 42 states and 59 transitions. [2018-07-23 13:49:46,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:49:46,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-07-23 13:49:46,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:46,218 INFO L225 Difference]: With dead ends: 42 [2018-07-23 13:49:46,218 INFO L226 Difference]: Without dead ends: 25 [2018-07-23 13:49:46,222 INFO L575 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-07-23 13:49:46,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-23 13:49:46,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-23 13:49:46,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-23 13:49:46,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2018-07-23 13:49:46,233 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 17 [2018-07-23 13:49:46,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:46,239 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-07-23 13:49:46,239 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:49:46,239 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2018-07-23 13:49:46,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 13:49:46,240 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:46,240 INFO L357 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:46,241 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:46,241 INFO L82 PathProgramCache]: Analyzing trace with hash 2107505391, now seen corresponding path program 1 times [2018-07-23 13:49:46,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:46,286 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-07-23 13:49:46,286 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:46,286 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:49:46,287 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:46,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:46,288 INFO L185 omatonBuilderFactory]: Interpolants [356#true, 357#false, 358#(= ULTIMATE.start_ssl3_connect_~s__state~4 4400)] [2018-07-23 13:49:46,288 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-07-23 13:49:46,288 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:49:46,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:49:46,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:46,289 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 3 states. [2018-07-23 13:49:46,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:46,327 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2018-07-23 13:49:46,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:49:46,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-07-23 13:49:46,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:46,330 INFO L225 Difference]: With dead ends: 53 [2018-07-23 13:49:46,330 INFO L226 Difference]: Without dead ends: 31 [2018-07-23 13:49:46,331 INFO L575 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-07-23 13:49:46,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-23 13:49:46,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-23 13:49:46,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-23 13:49:46,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2018-07-23 13:49:46,338 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 22 [2018-07-23 13:49:46,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:46,339 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2018-07-23 13:49:46,339 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:49:46,339 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2018-07-23 13:49:46,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-23 13:49:46,340 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:46,341 INFO L357 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:46,341 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:46,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1515645953, now seen corresponding path program 1 times [2018-07-23 13:49:46,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:46,395 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-07-23 13:49:46,395 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:46,396 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:49:46,396 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:46,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:46,398 INFO L185 omatonBuilderFactory]: Interpolants [528#false, 529#(= ULTIMATE.start_ssl3_connect_~s__state~4 4416), 527#true] [2018-07-23 13:49:46,398 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-07-23 13:49:46,399 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:49:46,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:49:46,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:46,401 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 3 states. [2018-07-23 13:49:46,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:46,479 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2018-07-23 13:49:46,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:49:46,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-07-23 13:49:46,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:46,481 INFO L225 Difference]: With dead ends: 66 [2018-07-23 13:49:46,481 INFO L226 Difference]: Without dead ends: 38 [2018-07-23 13:49:46,484 INFO L575 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-07-23 13:49:46,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-07-23 13:49:46,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-07-23 13:49:46,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-07-23 13:49:46,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-07-23 13:49:46,499 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 28 [2018-07-23 13:49:46,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:46,500 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-07-23 13:49:46,500 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:49:46,501 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-07-23 13:49:46,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-07-23 13:49:46,503 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:46,503 INFO L357 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:46,503 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:46,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1819656719, now seen corresponding path program 1 times [2018-07-23 13:49:46,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:46,589 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 33 proven. 19 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-07-23 13:49:46,590 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:46,590 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:49:46,590 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:46,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:46,591 INFO L185 omatonBuilderFactory]: Interpolants [738#true, 739#false, 740#(= ULTIMATE.start_ssl3_connect_~blastFlag~4 2), 741#(= ULTIMATE.start_ssl3_connect_~blastFlag~4 3), 742#(<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4)] [2018-07-23 13:49:46,592 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 33 proven. 19 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-07-23 13:49:46,592 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:49:46,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:49:46,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:49:46,594 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 5 states. [2018-07-23 13:49:46,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:46,640 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2018-07-23 13:49:46,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:49:46,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-07-23 13:49:46,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:46,642 INFO L225 Difference]: With dead ends: 62 [2018-07-23 13:49:46,643 INFO L226 Difference]: Without dead ends: 60 [2018-07-23 13:49:46,645 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:49:46,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-07-23 13:49:46,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2018-07-23 13:49:46,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-07-23 13:49:46,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2018-07-23 13:49:46,662 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 35 [2018-07-23 13:49:46,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:46,662 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2018-07-23 13:49:46,663 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:49:46,663 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2018-07-23 13:49:46,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-23 13:49:46,666 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:46,666 INFO L357 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:46,666 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:46,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1285451311, now seen corresponding path program 2 times [2018-07-23 13:49:46,667 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:46,717 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-07-23 13:49:46,718 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:46,718 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:49:46,718 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:46,719 INFO L185 omatonBuilderFactory]: Interpolants [979#true, 980#false, 981#(<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)] [2018-07-23 13:49:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-07-23 13:49:46,720 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:49:46,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:49:46,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:46,721 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand 3 states. [2018-07-23 13:49:46,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:46,760 INFO L93 Difference]: Finished difference Result 129 states and 171 transitions. [2018-07-23 13:49:46,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:49:46,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-07-23 13:49:46,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:46,762 INFO L225 Difference]: With dead ends: 129 [2018-07-23 13:49:46,762 INFO L226 Difference]: Without dead ends: 76 [2018-07-23 13:49:46,763 INFO L575 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-07-23 13:49:46,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-07-23 13:49:46,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2018-07-23 13:49:46,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-07-23 13:49:46,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2018-07-23 13:49:46,775 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 48 [2018-07-23 13:49:46,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:46,776 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2018-07-23 13:49:46,776 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:49:46,776 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2018-07-23 13:49:46,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-23 13:49:46,778 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:46,778 INFO L357 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 6, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:46,779 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:46,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1894059228, now seen corresponding path program 1 times [2018-07-23 13:49:46,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:46,826 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-07-23 13:49:46,829 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:46,829 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:49:46,829 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:46,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:46,830 INFO L185 omatonBuilderFactory]: Interpolants [1380#true, 1381#false, 1382#(= ULTIMATE.start_ssl3_connect_~s__state~4 4432)] [2018-07-23 13:49:46,830 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-07-23 13:49:46,831 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:49:46,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:49:46,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:46,836 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand 3 states. [2018-07-23 13:49:46,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:46,884 INFO L93 Difference]: Finished difference Result 153 states and 189 transitions. [2018-07-23 13:49:46,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:49:46,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-07-23 13:49:46,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:46,887 INFO L225 Difference]: With dead ends: 153 [2018-07-23 13:49:46,887 INFO L226 Difference]: Without dead ends: 86 [2018-07-23 13:49:46,890 INFO L575 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-07-23 13:49:46,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-07-23 13:49:46,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-07-23 13:49:46,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-07-23 13:49:46,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 102 transitions. [2018-07-23 13:49:46,914 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 102 transitions. Word has length 58 [2018-07-23 13:49:46,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:46,915 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 102 transitions. [2018-07-23 13:49:46,915 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:49:46,915 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2018-07-23 13:49:46,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-07-23 13:49:46,918 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:46,918 INFO L357 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 7, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:46,918 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:46,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1761912506, now seen corresponding path program 1 times [2018-07-23 13:49:46,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:46,978 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-07-23 13:49:46,979 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:46,980 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:49:46,981 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:46,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:46,983 INFO L185 omatonBuilderFactory]: Interpolants [1861#true, 1862#false, 1863#(= ULTIMATE.start_ssl3_connect_~s__state~4 4448)] [2018-07-23 13:49:46,983 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-07-23 13:49:46,984 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:49:46,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:49:46,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:46,987 INFO L87 Difference]: Start difference. First operand 86 states and 102 transitions. Second operand 3 states. [2018-07-23 13:49:47,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:47,027 INFO L93 Difference]: Finished difference Result 187 states and 225 transitions. [2018-07-23 13:49:47,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:49:47,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-07-23 13:49:47,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:47,030 INFO L225 Difference]: With dead ends: 187 [2018-07-23 13:49:47,030 INFO L226 Difference]: Without dead ends: 104 [2018-07-23 13:49:47,035 INFO L575 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-07-23 13:49:47,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-07-23 13:49:47,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-07-23 13:49:47,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-07-23 13:49:47,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2018-07-23 13:49:47,058 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 67 [2018-07-23 13:49:47,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:47,059 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2018-07-23 13:49:47,059 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:49:47,059 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2018-07-23 13:49:47,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-23 13:49:47,060 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:47,063 INFO L357 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 6, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:47,063 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:47,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1572743526, now seen corresponding path program 1 times [2018-07-23 13:49:47,064 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:47,127 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 182 proven. 6 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-07-23 13:49:47,127 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:47,127 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:49:47,128 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:47,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:47,128 INFO L185 omatonBuilderFactory]: Interpolants [2448#(= ULTIMATE.start_ssl3_connect_~s__state~4 4480), 2449#(<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4), 2446#true, 2447#false] [2018-07-23 13:49:47,129 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 182 proven. 6 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-07-23 13:49:47,130 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:49:47,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:49:47,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:49:47,130 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand 4 states. [2018-07-23 13:49:47,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:47,222 INFO L93 Difference]: Finished difference Result 231 states and 281 transitions. [2018-07-23 13:49:47,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:49:47,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2018-07-23 13:49:47,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:47,225 INFO L225 Difference]: With dead ends: 231 [2018-07-23 13:49:47,225 INFO L226 Difference]: Without dead ends: 130 [2018-07-23 13:49:47,226 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:49:47,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-07-23 13:49:47,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2018-07-23 13:49:47,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-07-23 13:49:47,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 144 transitions. [2018-07-23 13:49:47,251 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 144 transitions. Word has length 76 [2018-07-23 13:49:47,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:47,256 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 144 transitions. [2018-07-23 13:49:47,256 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:49:47,257 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 144 transitions. [2018-07-23 13:49:47,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-23 13:49:47,258 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:47,258 INFO L357 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 7, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:47,259 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:47,259 INFO L82 PathProgramCache]: Analyzing trace with hash 2063412103, now seen corresponding path program 2 times [2018-07-23 13:49:47,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:47,347 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 238 proven. 22 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-07-23 13:49:47,347 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:47,348 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:49:47,348 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:47,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:47,351 INFO L185 omatonBuilderFactory]: Interpolants [3168#true, 3169#false, 3170#(= ULTIMATE.start_ssl3_connect_~s__state~4 4480), 3171#(= ULTIMATE.start_ssl3_connect_~s__state~4 4512), 3172#(<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4)] [2018-07-23 13:49:47,352 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 238 proven. 22 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-07-23 13:49:47,352 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:49:47,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:49:47,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:49:47,353 INFO L87 Difference]: Start difference. First operand 128 states and 144 transitions. Second operand 5 states. [2018-07-23 13:49:47,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:47,462 INFO L93 Difference]: Finished difference Result 275 states and 321 transitions. [2018-07-23 13:49:47,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:49:47,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2018-07-23 13:49:47,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:47,465 INFO L225 Difference]: With dead ends: 275 [2018-07-23 13:49:47,465 INFO L226 Difference]: Without dead ends: 150 [2018-07-23 13:49:47,466 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:49:47,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-07-23 13:49:47,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-07-23 13:49:47,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-07-23 13:49:47,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 164 transitions. [2018-07-23 13:49:47,495 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 164 transitions. Word has length 86 [2018-07-23 13:49:47,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:47,495 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 164 transitions. [2018-07-23 13:49:47,495 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:49:47,495 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 164 transitions. [2018-07-23 13:49:47,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-23 13:49:47,497 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:47,497 INFO L357 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 10, 8, 6, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:47,497 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:47,497 INFO L82 PathProgramCache]: Analyzing trace with hash -933692364, now seen corresponding path program 3 times [2018-07-23 13:49:47,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:47,635 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 294 proven. 48 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-07-23 13:49:47,635 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:47,635 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:49:47,636 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:47,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:47,636 INFO L185 omatonBuilderFactory]: Interpolants [4019#true, 4020#false, 4021#(= ULTIMATE.start_ssl3_connect_~s__state~4 4480), 4022#(= ULTIMATE.start_ssl3_connect_~s__state~4 4512), 4023#(= ULTIMATE.start_ssl3_connect_~s__state~4 4528), 4024#(or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))] [2018-07-23 13:49:47,637 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 294 proven. 48 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-07-23 13:49:47,638 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:49:47,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:49:47,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:49:47,639 INFO L87 Difference]: Start difference. First operand 148 states and 164 transitions. Second operand 6 states. [2018-07-23 13:49:47,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:47,757 INFO L93 Difference]: Finished difference Result 315 states and 361 transitions. [2018-07-23 13:49:47,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:49:47,758 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-07-23 13:49:47,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:47,759 INFO L225 Difference]: With dead ends: 315 [2018-07-23 13:49:47,760 INFO L226 Difference]: Without dead ends: 170 [2018-07-23 13:49:47,760 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:49:47,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-07-23 13:49:47,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2018-07-23 13:49:47,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-07-23 13:49:47,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 184 transitions. [2018-07-23 13:49:47,787 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 184 transitions. Word has length 96 [2018-07-23 13:49:47,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:47,788 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 184 transitions. [2018-07-23 13:49:47,788 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:49:47,788 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 184 transitions. [2018-07-23 13:49:47,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-07-23 13:49:47,794 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:47,795 INFO L357 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 11, 9, 7, 5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:47,795 INFO L414 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:47,795 INFO L82 PathProgramCache]: Analyzing trace with hash -809658207, now seen corresponding path program 4 times [2018-07-23 13:49:47,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:47,977 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 350 proven. 84 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-07-23 13:49:47,977 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:47,978 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:49:47,978 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:47,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:47,979 INFO L185 omatonBuilderFactory]: Interpolants [4992#false, 4993#(= ULTIMATE.start_ssl3_connect_~s__state~4 4480), 4994#(= ULTIMATE.start_ssl3_connect_~s__state~4 4512), 4995#(= ULTIMATE.start_ssl3_connect_~s__state~4 4528), 4996#(or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)), 4997#(or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)), 4991#true] [2018-07-23 13:49:47,980 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 350 proven. 84 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-07-23 13:49:47,980 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:49:47,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:49:47,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:49:47,982 INFO L87 Difference]: Start difference. First operand 168 states and 184 transitions. Second operand 7 states. [2018-07-23 13:49:48,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:48,114 INFO L93 Difference]: Finished difference Result 288 states and 312 transitions. [2018-07-23 13:49:48,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 13:49:48,115 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2018-07-23 13:49:48,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:48,116 INFO L225 Difference]: With dead ends: 288 [2018-07-23 13:49:48,116 INFO L226 Difference]: Without dead ends: 0 [2018-07-23 13:49:48,117 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:49:48,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-23 13:49:48,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-23 13:49:48,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-23 13:49:48,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-23 13:49:48,118 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2018-07-23 13:49:48,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:48,118 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-23 13:49:48,118 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:49:48,118 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-23 13:49:48,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-23 13:49:48,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-23 13:49:48,493 INFO L421 ceAbstractionStarter]: For program point L460(lines 460 477) no Hoare annotation was computed. [2018-07-23 13:49:48,495 INFO L417 ceAbstractionStarter]: At program point L300(lines 261 300) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4448)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 12292)))) [2018-07-23 13:49:48,495 INFO L421 ceAbstractionStarter]: For program point L388(lines 385 401) no Hoare annotation was computed. [2018-07-23 13:49:48,497 INFO L417 ceAbstractionStarter]: At program point L266(lines 266 290) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4448)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 12292)))) [2018-07-23 13:49:48,497 INFO L421 ceAbstractionStarter]: For program point L347(lines 347 358) no Hoare annotation was computed. [2018-07-23 13:49:48,498 INFO L417 ceAbstractionStarter]: At program point L506(lines 289 506) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4448)))) [2018-07-23 13:49:48,499 INFO L417 ceAbstractionStarter]: At program point L296(lines 296 316) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4448)))) [2018-07-23 13:49:48,499 INFO L421 ceAbstractionStarter]: For program point L370(lines 370 386) no Hoare annotation was computed. [2018-07-23 13:49:48,500 INFO L417 ceAbstractionStarter]: At program point L374(lines 374 397) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4448)) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)))) [2018-07-23 13:49:48,505 INFO L417 ceAbstractionStarter]: At program point L337(lines 337 348) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4448)))) [2018-07-23 13:49:48,505 INFO L417 ceAbstractionStarter]: At program point L412(lines 412 439) the Hoare annotation is: false [2018-07-23 13:49:48,505 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 507) no Hoare annotation was computed. [2018-07-23 13:49:48,505 INFO L421 ceAbstractionStarter]: For program point L362(lines 357 375) no Hoare annotation was computed. [2018-07-23 13:49:48,505 INFO L421 ceAbstractionStarter]: For program point L480(lines 480 497) no Hoare annotation was computed. [2018-07-23 13:49:48,506 INFO L417 ceAbstractionStarter]: At program point L441(lines 438 455) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4528)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (and (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))))) [2018-07-23 13:49:48,508 INFO L417 ceAbstractionStarter]: At program point L400(lines 400 431) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4448)) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)))) [2018-07-23 13:49:48,509 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 507) the Hoare annotation is: true [2018-07-23 13:49:48,509 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 507) no Hoare annotation was computed. [2018-07-23 13:49:48,509 INFO L417 ceAbstractionStarter]: At program point L351(lines 351 371) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4448)))) [2018-07-23 13:49:48,510 INFO L417 ceAbstractionStarter]: At program point L396(lines 396 413) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) [2018-07-23 13:49:48,510 INFO L417 ceAbstractionStarter]: At program point L319(lines 319 334) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4448)))) [2018-07-23 13:49:48,511 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startErr0AssertViolationASSERT(line 440) the Hoare annotation is: false [2018-07-23 13:49:48,542 INFO L202 PluginConnector]: Adding new model s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:49:48 BoogieIcfgContainer [2018-07-23 13:49:48,542 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:49:48,543 INFO L168 Benchmark]: Toolchain (without parser) took 3852.21 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 380.5 MB). Peak memory consumption was 380.5 MB. Max. memory is 7.1 GB. [2018-07-23 13:49:48,550 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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-07-23 13:49:48,551 INFO L168 Benchmark]: Boogie Preprocessor took 86.01 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-07-23 13:49:48,552 INFO L168 Benchmark]: RCFGBuilder took 792.85 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-07-23 13:49:48,555 INFO L168 Benchmark]: TraceAbstraction took 2969.16 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 348.8 MB). Peak memory consumption was 348.8 MB. Max. memory is 7.1 GB. [2018-07-23 13:49:48,562 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.19 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 86.01 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 792.85 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2969.16 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 348.8 MB). Peak memory consumption was 348.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 440]: 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: 438]: Loop Invariant Derived loop invariant: (((ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4528) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4512)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480)) || ((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352)) - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: ((((((((ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432) || (ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400)) || ssl3_connect_~s__state~4 == 4368) || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4448)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 12292) - InvariantResult [Line: 337]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432) || (ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400)) || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4448) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: ((((((((ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432) || (ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400)) || ssl3_connect_~s__state~4 == 4368) || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4448)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 12292) - InvariantResult [Line: 400]: Loop Invariant Derived loop invariant: ((ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4448) || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480) - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: (((((((ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432) || (ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400)) || ssl3_connect_~s__state~4 == 4368) || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4448) - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432) || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4448) - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: (((ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4448) || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432) - InvariantResult [Line: 396]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432 - InvariantResult [Line: 412]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 289]: Loop Invariant Derived loop invariant: (((((((ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432) || (ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400)) || ssl3_connect_~s__state~4 == 4368) || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4448) - InvariantResult [Line: 319]: Loop Invariant Derived loop invariant: ((((((ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432) || (ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400)) || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4448) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 1 error locations. SAFE Result, 2.8s OverallTime, 13 OverallIterations, 14 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 254 SDtfs, 53 SDslu, 124 SDs, 0 SdLazy, 742 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 2088/2267 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 16 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 127 NumberOfFragments, 578 HoareAnnotationTreeSize, 14 FomulaSimplifications, 1098 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 14 FomulaSimplificationsInter, 78 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 662 NumberOfCodeBlocks, 662 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 649 ConstructedInterpolants, 0 QuantifiedInterpolants, 86073 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 8 PerfectInterpolantSequences, 2088/2267 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_4.cil.c_20.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_13-49-48-588.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_4.cil.c_20.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_13-49-48-588.csv Received shutdown request...