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-56c9370 [2018-07-23 15:28:14,860 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 15:28:14,864 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 15:28:14,880 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 15:28:14,881 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 15:28:14,882 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 15:28:14,884 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 15:28:14,887 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 15:28:14,891 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 15:28:14,892 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 15:28:14,894 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 15:28:14,894 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 15:28:14,895 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 15:28:14,896 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 15:28:14,897 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 15:28:14,900 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 15:28:14,901 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 15:28:14,902 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 15:28:14,904 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 15:28:14,906 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 15:28:14,907 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 15:28:14,908 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 15:28:14,911 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 15:28:14,911 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 15:28:14,911 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 15:28:14,912 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 15:28:14,913 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 15:28:14,914 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 15:28:14,915 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 15:28:14,916 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 15:28:14,916 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 15:28:14,917 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 15:28:14,917 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 15:28:14,917 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 15:28:14,918 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 15:28:14,920 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 15:28:14,920 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 15:28:14,944 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 15:28:14,944 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 15:28:14,945 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 15:28:14,946 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 15:28:14,946 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 15:28:14,946 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 15:28:14,946 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 15:28:14,946 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 15:28:15,000 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 15:28:15,014 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 15:28:15,018 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 15:28:15,020 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 15:28:15,021 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 15:28:15,021 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 15:28:15,022 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 15:28:15,097 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 15:28:15,098 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 15:28:15,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 15:28:15,099 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 15:28:15,099 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 15:28:15,127 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 03:28:15" (1/1) ... [2018-07-23 15:28:15,129 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 03:28:15" (1/1) ... [2018-07-23 15:28:15,146 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 03:28:15" (1/1) ... [2018-07-23 15:28:15,146 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 03:28:15" (1/1) ... [2018-07-23 15:28:15,174 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 03:28:15" (1/1) ... [2018-07-23 15:28:15,177 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 03:28:15" (1/1) ... [2018-07-23 15:28:15,185 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 03:28:15" (1/1) ... [2018-07-23 15:28:15,196 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 15:28:15,197 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 15:28:15,197 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 15:28:15,197 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 15:28:15,200 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 03:28:15" (1/1) ... [2018-07-23 15:28:15,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 15:28:15,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 15:28:15,956 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 15:28:15,957 INFO L202 PluginConnector]: Adding new model s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:28:15 BoogieIcfgContainer [2018-07-23 15:28:15,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 15:28:15,958 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 15:28:15,958 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 15:28:15,962 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 15:28:15,962 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 03:28:15" (1/2) ... [2018-07-23 15:28:15,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25bad51c and model type s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 03:28:15, skipping insertion in model container [2018-07-23 15:28:15,964 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 03:28:15" (2/2) ... [2018-07-23 15:28:15,966 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_4.cil.c_20.bpl [2018-07-23 15:28:15,976 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 15:28:15,986 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 15:28:16,036 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 15:28:16,037 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 15:28:16,037 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 15:28:16,037 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 15:28:16,038 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-23 15:28:16,038 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 15:28:16,038 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 15:28:16,038 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 15:28:16,038 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 15:28:16,058 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-07-23 15:28:16,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 15:28:16,069 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:16,070 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:28:16,071 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:16,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1912788263, now seen corresponding path program 1 times [2018-07-23 15:28:16,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:16,204 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 15:28:16,209 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:28:16,209 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 15:28:16,214 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:28:16,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:28:16,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:16,235 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2018-07-23 15:28:16,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:16,319 INFO L93 Difference]: Finished difference Result 29 states and 46 transitions. [2018-07-23 15:28:16,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:28:16,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-07-23 15:28:16,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:16,346 INFO L225 Difference]: With dead ends: 29 [2018-07-23 15:28:16,347 INFO L226 Difference]: Without dead ends: 16 [2018-07-23 15:28:16,356 INFO L573 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 15:28:16,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-23 15:28:16,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-23 15:28:16,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-23 15:28:16,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2018-07-23 15:28:16,399 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 23 transitions. Word has length 10 [2018-07-23 15:28:16,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:16,399 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 23 transitions. [2018-07-23 15:28:16,399 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:28:16,400 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 23 transitions. [2018-07-23 15:28:16,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 15:28:16,400 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:16,401 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:28:16,401 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:16,401 INFO L82 PathProgramCache]: Analyzing trace with hash -694562177, now seen corresponding path program 1 times [2018-07-23 15:28:16,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:16,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:16,445 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 15:28:16,446 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:28:16,446 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 15:28:16,448 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:28:16,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:28:16,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:16,455 INFO L87 Difference]: Start difference. First operand 16 states and 23 transitions. Second operand 3 states. [2018-07-23 15:28:16,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:16,517 INFO L93 Difference]: Finished difference Result 33 states and 49 transitions. [2018-07-23 15:28:16,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:28:16,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-07-23 15:28:16,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:16,520 INFO L225 Difference]: With dead ends: 33 [2018-07-23 15:28:16,520 INFO L226 Difference]: Without dead ends: 20 [2018-07-23 15:28:16,521 INFO L573 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 15:28:16,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-23 15:28:16,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-07-23 15:28:16,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-07-23 15:28:16,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-07-23 15:28:16,530 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 13 [2018-07-23 15:28:16,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:16,530 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-07-23 15:28:16,530 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:28:16,531 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2018-07-23 15:28:16,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-23 15:28:16,534 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:16,534 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:28:16,534 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:16,536 INFO L82 PathProgramCache]: Analyzing trace with hash 479561661, now seen corresponding path program 1 times [2018-07-23 15:28:16,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:16,571 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 15:28:16,571 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:28:16,573 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 15:28:16,574 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:28:16,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:28:16,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:16,576 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second operand 3 states. [2018-07-23 15:28:16,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:16,638 INFO L93 Difference]: Finished difference Result 42 states and 59 transitions. [2018-07-23 15:28:16,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:28:16,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-07-23 15:28:16,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:16,646 INFO L225 Difference]: With dead ends: 42 [2018-07-23 15:28:16,646 INFO L226 Difference]: Without dead ends: 25 [2018-07-23 15:28:16,648 INFO L573 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 15:28:16,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-23 15:28:16,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-23 15:28:16,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-23 15:28:16,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2018-07-23 15:28:16,661 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 17 [2018-07-23 15:28:16,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:16,661 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-07-23 15:28:16,661 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:28:16,661 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2018-07-23 15:28:16,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 15:28:16,662 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:16,663 INFO L353 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:28:16,663 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:16,664 INFO L82 PathProgramCache]: Analyzing trace with hash 2107505391, now seen corresponding path program 1 times [2018-07-23 15:28:16,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:16,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:16,701 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 15:28:16,701 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:28:16,706 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 15:28:16,707 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:28:16,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:28:16,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:16,708 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 3 states. [2018-07-23 15:28:16,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:16,777 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2018-07-23 15:28:16,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:28:16,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-07-23 15:28:16,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:16,780 INFO L225 Difference]: With dead ends: 53 [2018-07-23 15:28:16,780 INFO L226 Difference]: Without dead ends: 31 [2018-07-23 15:28:16,781 INFO L573 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 15:28:16,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-23 15:28:16,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-23 15:28:16,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-23 15:28:16,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2018-07-23 15:28:16,790 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 22 [2018-07-23 15:28:16,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:16,790 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2018-07-23 15:28:16,790 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:28:16,791 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2018-07-23 15:28:16,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-23 15:28:16,792 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:16,792 INFO L353 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:28:16,794 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:16,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1515645953, now seen corresponding path program 1 times [2018-07-23 15:28:16,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:16,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:16,822 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 15:28:16,822 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:28:16,822 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 15:28:16,823 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:28:16,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:28:16,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:16,824 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 3 states. [2018-07-23 15:28:16,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:16,879 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2018-07-23 15:28:16,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:28:16,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-07-23 15:28:16,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:16,884 INFO L225 Difference]: With dead ends: 66 [2018-07-23 15:28:16,884 INFO L226 Difference]: Without dead ends: 38 [2018-07-23 15:28:16,885 INFO L573 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 15:28:16,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-07-23 15:28:16,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-07-23 15:28:16,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-07-23 15:28:16,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-07-23 15:28:16,896 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 28 [2018-07-23 15:28:16,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:16,897 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-07-23 15:28:16,897 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:28:16,897 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-07-23 15:28:16,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-07-23 15:28:16,898 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:16,898 INFO L353 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:28:16,899 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:16,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1819656719, now seen corresponding path program 1 times [2018-07-23 15:28:16,899 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:16,952 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 15:28:16,955 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:28:16,955 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 15:28:16,956 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 15:28:16,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 15:28:16,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-23 15:28:16,957 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 5 states. [2018-07-23 15:28:16,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:16,990 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2018-07-23 15:28:16,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 15:28:16,991 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-07-23 15:28:16,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:16,992 INFO L225 Difference]: With dead ends: 62 [2018-07-23 15:28:16,993 INFO L226 Difference]: Without dead ends: 60 [2018-07-23 15:28:16,993 INFO L573 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 15:28:16,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-07-23 15:28:17,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2018-07-23 15:28:17,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-07-23 15:28:17,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2018-07-23 15:28:17,009 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 35 [2018-07-23 15:28:17,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:17,011 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2018-07-23 15:28:17,011 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 15:28:17,011 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2018-07-23 15:28:17,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-23 15:28:17,013 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:17,013 INFO L353 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:28:17,013 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:17,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1285451311, now seen corresponding path program 2 times [2018-07-23 15:28:17,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:17,053 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 15:28:17,054 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:28:17,054 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 15:28:17,054 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:28:17,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:28:17,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:17,055 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand 3 states. [2018-07-23 15:28:17,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:17,105 INFO L93 Difference]: Finished difference Result 129 states and 171 transitions. [2018-07-23 15:28:17,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:28:17,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-07-23 15:28:17,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:17,109 INFO L225 Difference]: With dead ends: 129 [2018-07-23 15:28:17,110 INFO L226 Difference]: Without dead ends: 76 [2018-07-23 15:28:17,111 INFO L573 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 15:28:17,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-07-23 15:28:17,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2018-07-23 15:28:17,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-07-23 15:28:17,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2018-07-23 15:28:17,127 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 48 [2018-07-23 15:28:17,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:17,128 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2018-07-23 15:28:17,128 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:28:17,128 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2018-07-23 15:28:17,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-23 15:28:17,130 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:17,130 INFO L353 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 15:28:17,131 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:17,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1894059228, now seen corresponding path program 1 times [2018-07-23 15:28:17,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:17,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:17,177 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 15:28:17,178 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:28:17,178 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 15:28:17,178 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:28:17,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:28:17,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:17,179 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand 3 states. [2018-07-23 15:28:17,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:17,213 INFO L93 Difference]: Finished difference Result 153 states and 189 transitions. [2018-07-23 15:28:17,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:28:17,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-07-23 15:28:17,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:17,215 INFO L225 Difference]: With dead ends: 153 [2018-07-23 15:28:17,215 INFO L226 Difference]: Without dead ends: 86 [2018-07-23 15:28:17,216 INFO L573 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 15:28:17,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-07-23 15:28:17,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-07-23 15:28:17,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-07-23 15:28:17,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 102 transitions. [2018-07-23 15:28:17,228 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 102 transitions. Word has length 58 [2018-07-23 15:28:17,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:17,229 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 102 transitions. [2018-07-23 15:28:17,229 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:28:17,229 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2018-07-23 15:28:17,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-07-23 15:28:17,230 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:17,230 INFO L353 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 15:28:17,231 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:17,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1761912506, now seen corresponding path program 1 times [2018-07-23 15:28:17,232 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:17,287 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 15:28:17,287 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:28:17,288 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 15:28:17,289 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:28:17,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:28:17,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:28:17,291 INFO L87 Difference]: Start difference. First operand 86 states and 102 transitions. Second operand 3 states. [2018-07-23 15:28:17,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:17,328 INFO L93 Difference]: Finished difference Result 187 states and 225 transitions. [2018-07-23 15:28:17,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:28:17,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-07-23 15:28:17,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:17,331 INFO L225 Difference]: With dead ends: 187 [2018-07-23 15:28:17,331 INFO L226 Difference]: Without dead ends: 104 [2018-07-23 15:28:17,335 INFO L573 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 15:28:17,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-07-23 15:28:17,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-07-23 15:28:17,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-07-23 15:28:17,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2018-07-23 15:28:17,364 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 67 [2018-07-23 15:28:17,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:17,365 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2018-07-23 15:28:17,365 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:28:17,365 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2018-07-23 15:28:17,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-23 15:28:17,370 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:17,370 INFO L353 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 15:28:17,370 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:17,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1572743526, now seen corresponding path program 1 times [2018-07-23 15:28:17,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:17,433 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 15:28:17,434 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:28:17,434 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 15:28:17,434 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 15:28:17,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 15:28:17,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 15:28:17,436 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand 4 states. [2018-07-23 15:28:17,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:17,523 INFO L93 Difference]: Finished difference Result 231 states and 281 transitions. [2018-07-23 15:28:17,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 15:28:17,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2018-07-23 15:28:17,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:17,529 INFO L225 Difference]: With dead ends: 231 [2018-07-23 15:28:17,529 INFO L226 Difference]: Without dead ends: 130 [2018-07-23 15:28:17,532 INFO L573 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 15:28:17,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-07-23 15:28:17,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2018-07-23 15:28:17,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-07-23 15:28:17,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 144 transitions. [2018-07-23 15:28:17,560 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 144 transitions. Word has length 76 [2018-07-23 15:28:17,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:17,564 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 144 transitions. [2018-07-23 15:28:17,565 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 15:28:17,565 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 144 transitions. [2018-07-23 15:28:17,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-23 15:28:17,567 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:17,568 INFO L353 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 15:28:17,568 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:17,568 INFO L82 PathProgramCache]: Analyzing trace with hash 2063412103, now seen corresponding path program 2 times [2018-07-23 15:28:17,568 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:17,660 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 15:28:17,661 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:28:17,661 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 15:28:17,662 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 15:28:17,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 15:28:17,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-07-23 15:28:17,663 INFO L87 Difference]: Start difference. First operand 128 states and 144 transitions. Second operand 5 states. [2018-07-23 15:28:17,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:17,764 INFO L93 Difference]: Finished difference Result 275 states and 321 transitions. [2018-07-23 15:28:17,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 15:28:17,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2018-07-23 15:28:17,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:17,767 INFO L225 Difference]: With dead ends: 275 [2018-07-23 15:28:17,767 INFO L226 Difference]: Without dead ends: 150 [2018-07-23 15:28:17,768 INFO L573 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 15:28:17,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-07-23 15:28:17,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-07-23 15:28:17,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-07-23 15:28:17,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 164 transitions. [2018-07-23 15:28:17,798 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 164 transitions. Word has length 86 [2018-07-23 15:28:17,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:17,799 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 164 transitions. [2018-07-23 15:28:17,799 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 15:28:17,801 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 164 transitions. [2018-07-23 15:28:17,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-23 15:28:17,805 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:17,806 INFO L353 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 15:28:17,806 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:17,806 INFO L82 PathProgramCache]: Analyzing trace with hash -933692364, now seen corresponding path program 3 times [2018-07-23 15:28:17,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:17,949 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 15:28:17,950 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:28:17,950 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 15:28:17,951 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 15:28:17,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 15:28:17,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-07-23 15:28:17,951 INFO L87 Difference]: Start difference. First operand 148 states and 164 transitions. Second operand 6 states. [2018-07-23 15:28:18,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:18,067 INFO L93 Difference]: Finished difference Result 315 states and 361 transitions. [2018-07-23 15:28:18,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 15:28:18,068 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-07-23 15:28:18,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:18,071 INFO L225 Difference]: With dead ends: 315 [2018-07-23 15:28:18,072 INFO L226 Difference]: Without dead ends: 170 [2018-07-23 15:28:18,073 INFO L573 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 15:28:18,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-07-23 15:28:18,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2018-07-23 15:28:18,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-07-23 15:28:18,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 184 transitions. [2018-07-23 15:28:18,092 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 184 transitions. Word has length 96 [2018-07-23 15:28:18,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:18,093 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 184 transitions. [2018-07-23 15:28:18,093 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 15:28:18,093 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 184 transitions. [2018-07-23 15:28:18,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-07-23 15:28:18,095 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:18,095 INFO L353 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 15:28:18,095 INFO L414 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:18,095 INFO L82 PathProgramCache]: Analyzing trace with hash -809658207, now seen corresponding path program 4 times [2018-07-23 15:28:18,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:18,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:18,285 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 15:28:18,285 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:28:18,285 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 15:28:18,286 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 15:28:18,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 15:28:18,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:28:18,287 INFO L87 Difference]: Start difference. First operand 168 states and 184 transitions. Second operand 7 states. [2018-07-23 15:28:18,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:18,422 INFO L93 Difference]: Finished difference Result 288 states and 312 transitions. [2018-07-23 15:28:18,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 15:28:18,422 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2018-07-23 15:28:18,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:18,423 INFO L225 Difference]: With dead ends: 288 [2018-07-23 15:28:18,423 INFO L226 Difference]: Without dead ends: 0 [2018-07-23 15:28:18,424 INFO L573 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 15:28:18,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-23 15:28:18,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-23 15:28:18,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-23 15:28:18,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-23 15:28:18,425 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2018-07-23 15:28:18,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:18,425 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-23 15:28:18,426 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 15:28:18,426 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-23 15:28:18,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-23 15:28:18,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-23 15:28:18,758 INFO L421 ceAbstractionStarter]: For program point L460(lines 460 477) no Hoare annotation was computed. [2018-07-23 15:28:18,761 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 15:28:18,761 INFO L421 ceAbstractionStarter]: For program point L388(lines 385 401) no Hoare annotation was computed. [2018-07-23 15:28:18,764 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 15:28:18,764 INFO L421 ceAbstractionStarter]: For program point L347(lines 347 358) no Hoare annotation was computed. [2018-07-23 15:28:18,765 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 15:28:18,767 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 15:28:18,768 INFO L421 ceAbstractionStarter]: For program point L370(lines 370 386) no Hoare annotation was computed. [2018-07-23 15:28:18,771 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 15:28:18,772 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 15:28:18,772 INFO L417 ceAbstractionStarter]: At program point L412(lines 412 439) the Hoare annotation is: false [2018-07-23 15:28:18,773 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 507) no Hoare annotation was computed. [2018-07-23 15:28:18,773 INFO L421 ceAbstractionStarter]: For program point L362(lines 357 375) no Hoare annotation was computed. [2018-07-23 15:28:18,773 INFO L421 ceAbstractionStarter]: For program point L480(lines 480 497) no Hoare annotation was computed. [2018-07-23 15:28:18,778 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 15:28:18,782 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 15:28:18,782 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 507) the Hoare annotation is: true [2018-07-23 15:28:18,782 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 507) no Hoare annotation was computed. [2018-07-23 15:28:18,783 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 15:28:18,783 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 15:28:18,786 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 15:28:18,787 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startErr0AssertViolationASSERT(line 440) the Hoare annotation is: false [2018-07-23 15:28:18,821 INFO L202 PluginConnector]: Adding new model s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 03:28:18 BoogieIcfgContainer [2018-07-23 15:28:18,821 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 15:28:18,823 INFO L168 Benchmark]: Toolchain (without parser) took 3725.19 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 15:28:18,828 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 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 15:28:18,829 INFO L168 Benchmark]: Boogie Preprocessor took 97.08 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 15:28:18,830 INFO L168 Benchmark]: RCFGBuilder took 760.29 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 15:28:18,832 INFO L168 Benchmark]: TraceAbstraction took 2863.64 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 15:28:18,838 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.16 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 97.08 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 760.29 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 2863.64 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.7s 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, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.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.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 78 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s 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_15-28-18-852.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_15-28-18-852.csv Received shutdown request...