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_srvr_7.cil.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-935f392 [2018-07-23 13:49:57,452 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:49:57,454 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:49:57,466 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:49:57,466 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:49:57,467 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:49:57,469 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:49:57,471 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:49:57,473 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:49:57,473 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:49:57,474 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:49:57,475 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:49:57,476 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:49:57,477 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:49:57,479 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:49:57,480 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:49:57,481 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:49:57,486 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:49:57,489 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:49:57,490 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:49:57,491 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:49:57,493 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:49:57,495 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:49:57,495 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:49:57,496 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:49:57,496 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:49:57,497 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:49:57,498 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:49:57,499 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:49:57,500 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:49:57,501 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:49:57,501 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:49:57,502 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:49:57,502 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:49:57,503 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:49:57,503 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:49:57,504 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:57,523 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:49:57,524 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:49:57,525 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:49:57,525 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:49:57,525 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:49:57,525 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:49:57,526 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:49:57,526 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:49:57,596 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:49:57,611 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:49:57,616 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:49:57,618 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:49:57,619 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:49:57,620 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_7.cil.c_19.bpl [2018-07-23 13:49:57,620 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_7.cil.c_19.bpl' [2018-07-23 13:49:57,710 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:49:57,712 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:49:57,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:49:57,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:49:57,713 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:49:57,742 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:57" (1/1) ... [2018-07-23 13:49:57,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:57" (1/1) ... [2018-07-23 13:49:57,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:57" (1/1) ... [2018-07-23 13:49:57,767 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:57" (1/1) ... [2018-07-23 13:49:57,787 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:57" (1/1) ... [2018-07-23 13:49:57,793 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:57" (1/1) ... [2018-07-23 13:49:57,798 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:57" (1/1) ... [2018-07-23 13:49:57,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:49:57,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:49:57,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:49:57,810 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:49:57,815 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:57" (1/1) ... [2018-07-23 13:49:57,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 13:49:57,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 13:49:58,403 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 13:49:58,404 INFO L202 PluginConnector]: Adding new model s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:49:58 BoogieIcfgContainer [2018-07-23 13:49:58,404 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:49:58,405 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:49:58,405 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:49:58,411 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:49:58,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:57" (1/2) ... [2018-07-23 13:49:58,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d9cf39a and model type s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:49:58, skipping insertion in model container [2018-07-23 13:49:58,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:49:58" (2/2) ... [2018-07-23 13:49:58,416 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_7.cil.c_19.bpl [2018-07-23 13:49:58,426 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:49:58,435 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 13:49:58,481 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:49:58,482 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:49:58,482 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:49:58,483 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:49:58,483 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:49:58,483 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:49:58,483 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:49:58,483 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:49:58,483 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:49:58,497 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2018-07-23 13:49:58,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:49:58,506 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:58,507 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:58,508 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:58,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1807955439, now seen corresponding path program 1 times [2018-07-23 13:49:58,518 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:58,622 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:58,625 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:58,625 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 13:49:58,627 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:58,628 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:58,628 INFO L185 omatonBuilderFactory]: Interpolants [13#true, 14#false, 15#(= ULTIMATE.start_ssl3_accept_~s__state~5 8464)] [2018-07-23 13:49:58,628 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:58,629 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:49:58,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:49:58,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:58,644 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2018-07-23 13:49:58,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:58,698 INFO L93 Difference]: Finished difference Result 21 states and 30 transitions. [2018-07-23 13:49:58,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:49:58,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-07-23 13:49:58,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:58,714 INFO L225 Difference]: With dead ends: 21 [2018-07-23 13:49:58,715 INFO L226 Difference]: Without dead ends: 12 [2018-07-23 13:49:58,721 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:58,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-23 13:49:58,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-07-23 13:49:58,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-23 13:49:58,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2018-07-23 13:49:58,767 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 15 transitions. Word has length 7 [2018-07-23 13:49:58,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:58,768 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 15 transitions. [2018-07-23 13:49:58,768 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:49:58,768 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2018-07-23 13:49:58,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:49:58,769 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:58,769 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:58,769 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:58,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1100281751, now seen corresponding path program 1 times [2018-07-23 13:49:58,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:58,813 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:58,813 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:58,813 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:49:58,813 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:58,814 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:58,814 INFO L185 omatonBuilderFactory]: Interpolants [82#true, 83#false, 84#(= ULTIMATE.start_ssl3_accept_~s__state~5 8496)] [2018-07-23 13:49:58,814 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:58,816 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:49:58,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:49:58,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:58,817 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. Second operand 3 states. [2018-07-23 13:49:58,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:58,900 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2018-07-23 13:49:58,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:49:58,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-07-23 13:49:58,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:58,905 INFO L225 Difference]: With dead ends: 25 [2018-07-23 13:49:58,905 INFO L226 Difference]: Without dead ends: 16 [2018-07-23 13:49:58,907 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:58,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-23 13:49:58,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-23 13:49:58,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-23 13:49:58,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-07-23 13:49:58,912 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 10 [2018-07-23 13:49:58,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:58,912 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-07-23 13:49:58,912 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:49:58,913 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2018-07-23 13:49:58,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:49:58,913 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:58,914 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:58,914 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:58,914 INFO L82 PathProgramCache]: Analyzing trace with hash -2082374887, now seen corresponding path program 1 times [2018-07-23 13:49:58,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:58,999 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:59,002 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:59,003 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:49:59,003 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:59,004 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:59,005 INFO L185 omatonBuilderFactory]: Interpolants [167#true, 168#false, 169#(<= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)] [2018-07-23 13:49:59,005 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:59,007 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:49:59,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:49:59,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:59,009 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 3 states. [2018-07-23 13:49:59,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:59,075 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2018-07-23 13:49:59,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:49:59,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-07-23 13:49:59,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:59,080 INFO L225 Difference]: With dead ends: 36 [2018-07-23 13:49:59,080 INFO L226 Difference]: Without dead ends: 23 [2018-07-23 13:49:59,081 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:59,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-23 13:49:59,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-07-23 13:49:59,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-07-23 13:49:59,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-07-23 13:49:59,091 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 14 [2018-07-23 13:49:59,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:59,092 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-07-23 13:49:59,092 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:49:59,092 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-07-23 13:49:59,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 13:49:59,093 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:59,093 INFO L357 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:59,094 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:59,094 INFO L82 PathProgramCache]: Analyzing trace with hash 471489091, now seen corresponding path program 1 times [2018-07-23 13:49:59,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:59,174 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 13:49:59,175 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:59,175 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:49:59,175 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:59,176 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:59,176 INFO L185 omatonBuilderFactory]: Interpolants [288#(= ULTIMATE.start_ssl3_accept_~s__state~5 8656), 289#(<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5), 286#true, 287#false] [2018-07-23 13:49:59,176 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 13:49:59,177 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:49:59,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:49:59,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:49:59,178 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 4 states. [2018-07-23 13:49:59,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:59,245 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2018-07-23 13:49:59,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:49:59,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-07-23 13:49:59,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:59,250 INFO L225 Difference]: With dead ends: 49 [2018-07-23 13:49:59,250 INFO L226 Difference]: Without dead ends: 30 [2018-07-23 13:49:59,251 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:59,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-07-23 13:49:59,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-07-23 13:49:59,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-23 13:49:59,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-07-23 13:49:59,267 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 21 [2018-07-23 13:49:59,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:59,267 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-07-23 13:49:59,268 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:49:59,268 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-07-23 13:49:59,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-23 13:49:59,269 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:59,270 INFO L357 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2018-07-23 13:49:59,270 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:59,270 INFO L82 PathProgramCache]: Analyzing trace with hash -2048264231, now seen corresponding path program 2 times [2018-07-23 13:49:59,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:59,340 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-07-23 13:49:59,340 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:59,346 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-23 13:49:59,347 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:59,349 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:59,349 INFO L185 omatonBuilderFactory]: Interpolants [448#(or (= ULTIMATE.start_ssl3_accept_~s__state~5 8448) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)), 449#(<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5), 446#true, 447#false] [2018-07-23 13:49:59,350 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-07-23 13:49:59,350 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:49:59,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:49:59,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:49:59,354 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 4 states. [2018-07-23 13:49:59,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:59,422 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2018-07-23 13:49:59,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:49:59,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-07-23 13:49:59,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:59,425 INFO L225 Difference]: With dead ends: 62 [2018-07-23 13:49:59,425 INFO L226 Difference]: Without dead ends: 36 [2018-07-23 13:49:59,428 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:49:59,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-07-23 13:49:59,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-07-23 13:49:59,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-07-23 13:49:59,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-07-23 13:49:59,441 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 28 [2018-07-23 13:49:59,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:59,441 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-07-23 13:49:59,442 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:49:59,442 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-07-23 13:49:59,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-07-23 13:49:59,445 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:59,446 INFO L357 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:59,446 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:59,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1703845991, now seen corresponding path program 1 times [2018-07-23 13:49:59,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:59,550 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 29 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 13:49:59,551 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:59,551 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:49:59,551 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:59,552 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:59,552 INFO L185 omatonBuilderFactory]: Interpolants [642#true, 643#false, 644#(and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)), 645#(= ULTIMATE.start_ssl3_accept_~blastFlag~5 3), 646#(or (not (= ULTIMATE.start_ssl3_accept_~s__state~5 8448)) (not (= ULTIMATE.start_ssl3_accept_~blastFlag~5 5))), 647#(not (= ULTIMATE.start_ssl3_accept_~blastFlag~5 5))] [2018-07-23 13:49:59,552 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 29 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 13:49:59,553 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:49:59,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:49:59,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:49:59,554 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 6 states. [2018-07-23 13:49:59,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:59,650 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2018-07-23 13:49:59,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:49:59,653 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-07-23 13:49:59,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:59,654 INFO L225 Difference]: With dead ends: 56 [2018-07-23 13:49:59,654 INFO L226 Difference]: Without dead ends: 54 [2018-07-23 13:49:59,655 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:49:59,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-07-23 13:49:59,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-07-23 13:49:59,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-07-23 13:49:59,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2018-07-23 13:49:59,677 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 33 [2018-07-23 13:49:59,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:59,679 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-07-23 13:49:59,679 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:49:59,680 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2018-07-23 13:49:59,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-07-23 13:49:59,681 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:59,681 INFO L357 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:59,682 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:59,682 INFO L82 PathProgramCache]: Analyzing trace with hash -205689945, now seen corresponding path program 2 times [2018-07-23 13:49:59,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:59,757 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 91 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-07-23 13:49:59,757 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:59,758 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:49:59,758 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:59,759 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:59,759 INFO L185 omatonBuilderFactory]: Interpolants [864#true, 865#false, 866#(= ULTIMATE.start_ssl3_accept_~s__state~5 8656), 867#(= ULTIMATE.start_ssl3_accept_~s__state~5 8672), 868#(= ULTIMATE.start_ssl3_accept_~s__state~5 8448)] [2018-07-23 13:49:59,760 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 91 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-07-23 13:49:59,760 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:49:59,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:49:59,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:49:59,761 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand 5 states. [2018-07-23 13:49:59,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:59,827 INFO L93 Difference]: Finished difference Result 102 states and 119 transitions. [2018-07-23 13:49:59,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:49:59,828 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-07-23 13:49:59,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:59,829 INFO L225 Difference]: With dead ends: 102 [2018-07-23 13:49:59,829 INFO L226 Difference]: Without dead ends: 53 [2018-07-23 13:49:59,835 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:49:59,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-23 13:49:59,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-23 13:49:59,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-23 13:49:59,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-07-23 13:49:59,852 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 47 [2018-07-23 13:49:59,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:59,853 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-07-23 13:49:59,853 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:49:59,853 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-07-23 13:49:59,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-23 13:49:59,855 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:59,855 INFO L357 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 5, 4, 4, 2, 1, 1, 1, 1, 1] [2018-07-23 13:49:59,856 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:59,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1173574567, now seen corresponding path program 3 times [2018-07-23 13:49:59,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:59,928 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-07-23 13:49:59,928 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:59,928 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-23 13:49:59,929 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:59,929 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:59,929 INFO L185 omatonBuilderFactory]: Interpolants [1179#true, 1180#false, 1181#(or (not (= ULTIMATE.start_ssl3_accept_~s__state~5 8448)) (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5)), 1182#(= ULTIMATE.start_ssl3_accept_~s__state~5 8640)] [2018-07-23 13:49:59,930 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-07-23 13:49:59,932 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:49:59,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:49:59,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:49:59,933 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 4 states. [2018-07-23 13:49:59,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:59,971 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2018-07-23 13:49:59,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:49:59,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-07-23 13:49:59,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:59,972 INFO L225 Difference]: With dead ends: 82 [2018-07-23 13:49:59,972 INFO L226 Difference]: Without dead ends: 0 [2018-07-23 13:49:59,973 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:49:59,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-23 13:49:59,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-23 13:49:59,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-23 13:49:59,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-23 13:49:59,974 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2018-07-23 13:49:59,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:59,975 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-23 13:49:59,975 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:49:59,975 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-23 13:49:59,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-23 13:49:59,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-23 13:50:00,160 INFO L421 ceAbstractionStarter]: For program point L382(lines 377 392) no Hoare annotation was computed. [2018-07-23 13:50:00,162 INFO L417 ceAbstractionStarter]: At program point L347(lines 347 352) the Hoare annotation is: false [2018-07-23 13:50:00,163 INFO L421 ceAbstractionStarter]: For program point L391(lines 388 398) no Hoare annotation was computed. [2018-07-23 13:50:00,165 INFO L417 ceAbstractionStarter]: At program point L295(lines 258 295) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~blastFlag~5 5)))) (or (and (= ULTIMATE.start_ssl3_accept_~s__state~5 8448) .cse0 (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8464)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (= ULTIMATE.start_ssl3_accept_~s__state~5 8672)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8640)) (and (= ULTIMATE.start_ssl3_accept_~s__state~5 8496) .cse0))) [2018-07-23 13:50:00,165 INFO L421 ceAbstractionStarter]: For program point L371(lines 371 389) no Hoare annotation was computed. [2018-07-23 13:50:00,167 INFO L417 ceAbstractionStarter]: At program point L337(lines 337 348) the Hoare annotation is: (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (= ULTIMATE.start_ssl3_accept_~s__state~5 8672)) (and (not (= ULTIMATE.start_ssl3_accept_~blastFlag~5 5)) (= ULTIMATE.start_ssl3_accept_~s__state~5 8640))) [2018-07-23 13:50:00,167 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 405) no Hoare annotation was computed. [2018-07-23 13:50:00,168 INFO L417 ceAbstractionStarter]: At program point L321(lines 321 329) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~blastFlag~5 5)))) (or (and (= ULTIMATE.start_ssl3_accept_~s__state~5 8448) .cse0 (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (= ULTIMATE.start_ssl3_accept_~s__state~5 8672)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8640)))) [2018-07-23 13:50:00,168 INFO L421 ceAbstractionStarter]: For program point L363(lines 363 378) no Hoare annotation was computed. [2018-07-23 13:50:00,169 INFO L417 ceAbstractionStarter]: At program point L404(lines 286 404) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~blastFlag~5 5)))) (or (and (= ULTIMATE.start_ssl3_accept_~s__state~5 8448) .cse0 (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (= ULTIMATE.start_ssl3_accept_~s__state~5 8672)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8640)) (and (= ULTIMATE.start_ssl3_accept_~s__state~5 8496) .cse0))) [2018-07-23 13:50:00,169 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 405) the Hoare annotation is: true [2018-07-23 13:50:00,170 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 405) no Hoare annotation was computed. [2018-07-23 13:50:00,173 INFO L417 ceAbstractionStarter]: At program point L291(lines 291 310) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~blastFlag~5 5)))) (or (and (= ULTIMATE.start_ssl3_accept_~s__state~5 8448) .cse0 (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (= ULTIMATE.start_ssl3_accept_~s__state~5 8672)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8640)) (and (= ULTIMATE.start_ssl3_accept_~s__state~5 8496) .cse0))) [2018-07-23 13:50:00,174 INFO L417 ceAbstractionStarter]: At program point L271(lines 271 287) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~blastFlag~5 5)))) (or (and (= ULTIMATE.start_ssl3_accept_~s__state~5 8448) .cse0 (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8464)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (= ULTIMATE.start_ssl3_accept_~s__state~5 8672)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8640)) (and (= ULTIMATE.start_ssl3_accept_~s__state~5 8496) .cse0))) [2018-07-23 13:50:00,175 INFO L417 ceAbstractionStarter]: At program point L354(lines 351 364) the Hoare annotation is: (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (= ULTIMATE.start_ssl3_accept_~s__state~5 8672))) [2018-07-23 13:50:00,175 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startErr0AssertViolationASSERT(line 353) the Hoare annotation is: false [2018-07-23 13:50:00,206 INFO L202 PluginConnector]: Adding new model s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:50:00 BoogieIcfgContainer [2018-07-23 13:50:00,206 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:50:00,207 INFO L168 Benchmark]: Toolchain (without parser) took 2496.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 169.1 MB). Peak memory consumption was 169.1 MB. Max. memory is 7.1 GB. [2018-07-23 13:50:00,209 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:50:00,210 INFO L168 Benchmark]: Boogie Preprocessor took 96.66 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:50:00,211 INFO L168 Benchmark]: RCFGBuilder took 594.44 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-07-23 13:50:00,212 INFO L168 Benchmark]: TraceAbstraction took 1800.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. [2018-07-23 13:50:00,216 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 96.66 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 594.44 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1800.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 353]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: ((((((ssl3_accept_~s__state~5 == 8448 && !(ssl3_accept_~blastFlag~5 == 5)) && 8640 == ssl3_accept_~s__s3__tmp__next_state___0~5) || (ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656)) || (!(ssl3_accept_~blastFlag~5 == 5) && ssl3_accept_~s__state~5 == 8464)) || (ssl3_accept_~blastFlag~5 == 3 && ssl3_accept_~s__state~5 == 8672)) || (!(ssl3_accept_~blastFlag~5 == 5) && ssl3_accept_~s__state~5 == 8640)) || (ssl3_accept_~s__state~5 == 8496 && !(ssl3_accept_~blastFlag~5 == 5)) - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~s__state~5 == 8448 && !(ssl3_accept_~blastFlag~5 == 5)) && 8640 == ssl3_accept_~s__s3__tmp__next_state___0~5) || (ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656)) || (ssl3_accept_~blastFlag~5 == 3 && ssl3_accept_~s__state~5 == 8672)) || (!(ssl3_accept_~blastFlag~5 == 5) && ssl3_accept_~s__state~5 == 8640) - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: (ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) || (ssl3_accept_~blastFlag~5 == 3 && ssl3_accept_~s__state~5 == 8672) - InvariantResult [Line: 337]: Loop Invariant Derived loop invariant: ((ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) || (ssl3_accept_~blastFlag~5 == 3 && ssl3_accept_~s__state~5 == 8672)) || (!(ssl3_accept_~blastFlag~5 == 5) && ssl3_accept_~s__state~5 == 8640) - InvariantResult [Line: 286]: Loop Invariant Derived loop invariant: (((((ssl3_accept_~s__state~5 == 8448 && !(ssl3_accept_~blastFlag~5 == 5)) && 8640 == ssl3_accept_~s__s3__tmp__next_state___0~5) || (ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656)) || (ssl3_accept_~blastFlag~5 == 3 && ssl3_accept_~s__state~5 == 8672)) || (!(ssl3_accept_~blastFlag~5 == 5) && ssl3_accept_~s__state~5 == 8640)) || (ssl3_accept_~s__state~5 == 8496 && !(ssl3_accept_~blastFlag~5 == 5)) - InvariantResult [Line: 258]: Loop Invariant Derived loop invariant: ((((((ssl3_accept_~s__state~5 == 8448 && !(ssl3_accept_~blastFlag~5 == 5)) && 8640 == ssl3_accept_~s__s3__tmp__next_state___0~5) || (ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656)) || (!(ssl3_accept_~blastFlag~5 == 5) && ssl3_accept_~s__state~5 == 8464)) || (ssl3_accept_~blastFlag~5 == 3 && ssl3_accept_~s__state~5 == 8672)) || (!(ssl3_accept_~blastFlag~5 == 5) && ssl3_accept_~s__state~5 == 8640)) || (ssl3_accept_~s__state~5 == 8496 && !(ssl3_accept_~blastFlag~5 == 5)) - InvariantResult [Line: 291]: Loop Invariant Derived loop invariant: (((((ssl3_accept_~s__state~5 == 8448 && !(ssl3_accept_~blastFlag~5 == 5)) && 8640 == ssl3_accept_~s__s3__tmp__next_state___0~5) || (ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656)) || (ssl3_accept_~blastFlag~5 == 3 && ssl3_accept_~s__state~5 == 8672)) || (!(ssl3_accept_~blastFlag~5 == 5) && ssl3_accept_~s__state~5 == 8640)) || (ssl3_accept_~s__state~5 == 8496 && !(ssl3_accept_~blastFlag~5 == 5)) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. SAFE Result, 1.7s OverallTime, 8 OverallIterations, 9 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 83 SDtfs, 21 SDslu, 40 SDs, 0 SdLazy, 234 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 371/423 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 6 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 41 NumberOfFragments, 259 HoareAnnotationTreeSize, 10 FomulaSimplifications, 98 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 221 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 16585 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 371/423 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_7.cil.c_19.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_13-50-00-230.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_7.cil.c_19.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_13-50-00-230.csv Received shutdown request...