java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.cil.c_23.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 08:49:45,120 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 08:49:45,123 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 08:49:45,141 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 08:49:45,141 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 08:49:45,142 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 08:49:45,144 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 08:49:45,146 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 08:49:45,148 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 08:49:45,151 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 08:49:45,153 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 08:49:45,153 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 08:49:45,155 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 08:49:45,156 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 08:49:45,158 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 08:49:45,159 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 08:49:45,160 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 08:49:45,164 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 08:49:45,174 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 08:49:45,175 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 08:49:45,176 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 08:49:45,179 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 08:49:45,182 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 08:49:45,182 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 08:49:45,183 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 08:49:45,184 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 08:49:45,185 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 08:49:45,186 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 08:49:45,187 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 08:49:45,189 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 08:49:45,189 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 08:49:45,190 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 08:49:45,190 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 08:49:45,190 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 08:49:45,191 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 08:49:45,193 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 08:49:45,193 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 08:49:45,217 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 08:49:45,218 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 08:49:45,221 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 08:49:45,221 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 08:49:45,221 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 08:49:45,222 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 08:49:45,222 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 08:49:45,222 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 08:49:45,276 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 08:49:45,288 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 08:49:45,292 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 08:49:45,294 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 08:49:45,294 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 08:49:45,295 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.cil.c_23.bpl [2018-07-25 08:49:45,295 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.cil.c_23.bpl' [2018-07-25 08:49:45,372 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 08:49:45,374 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 08:49:45,375 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 08:49:45,375 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 08:49:45,375 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 08:49:45,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:49:45" (1/1) ... [2018-07-25 08:49:45,414 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:49:45" (1/1) ... [2018-07-25 08:49:45,421 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 08:49:45,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 08:49:45,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 08:49:45,422 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 08:49:45,434 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:49:45" (1/1) ... [2018-07-25 08:49:45,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:49:45" (1/1) ... [2018-07-25 08:49:45,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:49:45" (1/1) ... [2018-07-25 08:49:45,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:49:45" (1/1) ... [2018-07-25 08:49:45,449 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:49:45" (1/1) ... [2018-07-25 08:49:45,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:49:45" (1/1) ... [2018-07-25 08:49:45,455 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:49:45" (1/1) ... [2018-07-25 08:49:45,461 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 08:49:45,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 08:49:45,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 08:49:45,463 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 08:49:45,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:49:45" (1/1) ... [2018-07-25 08:49:45,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-25 08:49:45,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-25 08:49:45,977 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-25 08:49:45,978 INFO L202 PluginConnector]: Adding new model s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:49:45 BoogieIcfgContainer [2018-07-25 08:49:45,978 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 08:49:45,979 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 08:49:45,980 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 08:49:45,984 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 08:49:45,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:49:45" (1/2) ... [2018-07-25 08:49:45,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72879662 and model type s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 08:49:45, skipping insertion in model container [2018-07-25 08:49:45,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:49:45" (2/2) ... [2018-07-25 08:49:45,988 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil.c_23.bpl [2018-07-25 08:49:45,999 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 08:49:46,009 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 08:49:46,053 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 08:49:46,054 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 08:49:46,054 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 08:49:46,054 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 08:49:46,054 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 08:49:46,055 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 08:49:46,055 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 08:49:46,055 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 08:49:46,055 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 08:49:46,071 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-07-25 08:49:46,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:49:46,080 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:46,081 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:49:46,082 INFO L415 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:46,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1511424245, now seen corresponding path program 1 times [2018-07-25 08:49:46,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:46,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:46,211 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-25 08:49:46,214 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:49:46,215 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 08:49:46,219 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:49:46,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:49:46,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:49:46,238 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2018-07-25 08:49:46,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:46,342 INFO L93 Difference]: Finished difference Result 51 states and 87 transitions. [2018-07-25 08:49:46,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:49:46,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-07-25 08:49:46,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:46,357 INFO L225 Difference]: With dead ends: 51 [2018-07-25 08:49:46,357 INFO L226 Difference]: Without dead ends: 32 [2018-07-25 08:49:46,362 INFO L574 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-25 08:49:46,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-07-25 08:49:46,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-07-25 08:49:46,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-07-25 08:49:46,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 54 transitions. [2018-07-25 08:49:46,416 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 54 transitions. Word has length 16 [2018-07-25 08:49:46,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:46,417 INFO L472 AbstractCegarLoop]: Abstraction has 32 states and 54 transitions. [2018-07-25 08:49:46,417 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:49:46,417 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 54 transitions. [2018-07-25 08:49:46,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-25 08:49:46,419 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:46,419 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:49:46,420 INFO L415 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:46,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1787958207, now seen corresponding path program 1 times [2018-07-25 08:49:46,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:46,506 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:46,507 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:49:46,507 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 08:49:46,509 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:49:46,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:49:46,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:49:46,510 INFO L87 Difference]: Start difference. First operand 32 states and 54 transitions. Second operand 3 states. [2018-07-25 08:49:46,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:46,591 INFO L93 Difference]: Finished difference Result 79 states and 135 transitions. [2018-07-25 08:49:46,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:49:46,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-07-25 08:49:46,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:46,593 INFO L225 Difference]: With dead ends: 79 [2018-07-25 08:49:46,593 INFO L226 Difference]: Without dead ends: 48 [2018-07-25 08:49:46,595 INFO L574 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-25 08:49:46,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-07-25 08:49:46,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-07-25 08:49:46,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-07-25 08:49:46,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 80 transitions. [2018-07-25 08:49:46,609 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 80 transitions. Word has length 24 [2018-07-25 08:49:46,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:46,610 INFO L472 AbstractCegarLoop]: Abstraction has 48 states and 80 transitions. [2018-07-25 08:49:46,610 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:49:46,611 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 80 transitions. [2018-07-25 08:49:46,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-25 08:49:46,612 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:46,612 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:49:46,613 INFO L415 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:46,613 INFO L82 PathProgramCache]: Analyzing trace with hash -2072936365, now seen corresponding path program 1 times [2018-07-25 08:49:46,613 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:46,660 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:46,661 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:49:46,661 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 08:49:46,662 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:49:46,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:49:46,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:49:46,663 INFO L87 Difference]: Start difference. First operand 48 states and 80 transitions. Second operand 3 states. [2018-07-25 08:49:46,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:46,751 INFO L93 Difference]: Finished difference Result 113 states and 191 transitions. [2018-07-25 08:49:46,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:49:46,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-07-25 08:49:46,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:46,753 INFO L225 Difference]: With dead ends: 113 [2018-07-25 08:49:46,753 INFO L226 Difference]: Without dead ends: 65 [2018-07-25 08:49:46,754 INFO L574 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-25 08:49:46,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-25 08:49:46,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-25 08:49:46,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-25 08:49:46,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 109 transitions. [2018-07-25 08:49:46,773 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 109 transitions. Word has length 29 [2018-07-25 08:49:46,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:46,774 INFO L472 AbstractCegarLoop]: Abstraction has 65 states and 109 transitions. [2018-07-25 08:49:46,774 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:49:46,774 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 109 transitions. [2018-07-25 08:49:46,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-07-25 08:49:46,776 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:46,776 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:49:46,776 INFO L415 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:46,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1179694243, now seen corresponding path program 1 times [2018-07-25 08:49:46,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:46,841 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-07-25 08:49:46,844 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:49:46,845 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 08:49:46,845 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:49:46,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:49:46,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:49:46,846 INFO L87 Difference]: Start difference. First operand 65 states and 109 transitions. Second operand 3 states. [2018-07-25 08:49:46,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:46,918 INFO L93 Difference]: Finished difference Result 136 states and 229 transitions. [2018-07-25 08:49:46,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:49:46,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-07-25 08:49:46,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:46,921 INFO L225 Difference]: With dead ends: 136 [2018-07-25 08:49:46,921 INFO L226 Difference]: Without dead ends: 72 [2018-07-25 08:49:46,922 INFO L574 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-25 08:49:46,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-07-25 08:49:46,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-07-25 08:49:46,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-07-25 08:49:46,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 117 transitions. [2018-07-25 08:49:46,946 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 117 transitions. Word has length 31 [2018-07-25 08:49:46,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:46,946 INFO L472 AbstractCegarLoop]: Abstraction has 72 states and 117 transitions. [2018-07-25 08:49:46,947 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:49:46,947 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 117 transitions. [2018-07-25 08:49:46,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-07-25 08:49:46,948 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:46,949 INFO L354 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:49:46,949 INFO L415 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:46,949 INFO L82 PathProgramCache]: Analyzing trace with hash -2026096289, now seen corresponding path program 1 times [2018-07-25 08:49:46,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:46,986 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-07-25 08:49:46,986 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:49:46,986 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 08:49:46,987 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:49:46,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:49:46,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:49:46,988 INFO L87 Difference]: Start difference. First operand 72 states and 117 transitions. Second operand 3 states. [2018-07-25 08:49:47,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:47,088 INFO L93 Difference]: Finished difference Result 149 states and 243 transitions. [2018-07-25 08:49:47,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:49:47,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-07-25 08:49:47,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:47,090 INFO L225 Difference]: With dead ends: 149 [2018-07-25 08:49:47,096 INFO L226 Difference]: Without dead ends: 78 [2018-07-25 08:49:47,100 INFO L574 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-25 08:49:47,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-07-25 08:49:47,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-07-25 08:49:47,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-07-25 08:49:47,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 122 transitions. [2018-07-25 08:49:47,135 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 122 transitions. Word has length 37 [2018-07-25 08:49:47,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:47,141 INFO L472 AbstractCegarLoop]: Abstraction has 78 states and 122 transitions. [2018-07-25 08:49:47,141 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:49:47,141 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 122 transitions. [2018-07-25 08:49:47,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-07-25 08:49:47,143 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:47,145 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:49:47,149 INFO L415 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:47,150 INFO L82 PathProgramCache]: Analyzing trace with hash 519658156, now seen corresponding path program 1 times [2018-07-25 08:49:47,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:47,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:47,212 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-07-25 08:49:47,212 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:49:47,213 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 08:49:47,213 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:49:47,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:49:47,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:49:47,214 INFO L87 Difference]: Start difference. First operand 78 states and 122 transitions. Second operand 3 states. [2018-07-25 08:49:47,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:47,305 INFO L93 Difference]: Finished difference Result 167 states and 261 transitions. [2018-07-25 08:49:47,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:49:47,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-07-25 08:49:47,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:47,307 INFO L225 Difference]: With dead ends: 167 [2018-07-25 08:49:47,308 INFO L226 Difference]: Without dead ends: 89 [2018-07-25 08:49:47,311 INFO L574 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-25 08:49:47,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-25 08:49:47,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-25 08:49:47,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-25 08:49:47,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 136 transitions. [2018-07-25 08:49:47,339 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 136 transitions. Word has length 41 [2018-07-25 08:49:47,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:47,340 INFO L472 AbstractCegarLoop]: Abstraction has 89 states and 136 transitions. [2018-07-25 08:49:47,340 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:49:47,340 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 136 transitions. [2018-07-25 08:49:47,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-25 08:49:47,344 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:47,345 INFO L354 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:49:47,345 INFO L415 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:47,347 INFO L82 PathProgramCache]: Analyzing trace with hash -865281023, now seen corresponding path program 1 times [2018-07-25 08:49:47,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:47,397 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-07-25 08:49:47,398 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:49:47,398 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 08:49:47,399 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:49:47,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:49:47,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:49:47,400 INFO L87 Difference]: Start difference. First operand 89 states and 136 transitions. Second operand 3 states. [2018-07-25 08:49:47,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:47,484 INFO L93 Difference]: Finished difference Result 182 states and 279 transitions. [2018-07-25 08:49:47,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:49:47,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-07-25 08:49:47,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:47,486 INFO L225 Difference]: With dead ends: 182 [2018-07-25 08:49:47,487 INFO L226 Difference]: Without dead ends: 94 [2018-07-25 08:49:47,488 INFO L574 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-25 08:49:47,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-07-25 08:49:47,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-07-25 08:49:47,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-07-25 08:49:47,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 137 transitions. [2018-07-25 08:49:47,509 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 137 transitions. Word has length 42 [2018-07-25 08:49:47,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:47,510 INFO L472 AbstractCegarLoop]: Abstraction has 94 states and 137 transitions. [2018-07-25 08:49:47,510 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:49:47,510 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 137 transitions. [2018-07-25 08:49:47,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-25 08:49:47,512 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:47,512 INFO L354 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:49:47,512 INFO L415 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:47,513 INFO L82 PathProgramCache]: Analyzing trace with hash 2094171455, now seen corresponding path program 1 times [2018-07-25 08:49:47,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:47,567 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-07-25 08:49:47,567 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:49:47,568 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 08:49:47,568 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:49:47,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:49:47,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:49:47,570 INFO L87 Difference]: Start difference. First operand 94 states and 137 transitions. Second operand 3 states. [2018-07-25 08:49:47,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:47,613 INFO L93 Difference]: Finished difference Result 273 states and 400 transitions. [2018-07-25 08:49:47,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:49:47,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-07-25 08:49:47,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:47,615 INFO L225 Difference]: With dead ends: 273 [2018-07-25 08:49:47,616 INFO L226 Difference]: Without dead ends: 180 [2018-07-25 08:49:47,617 INFO L574 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-25 08:49:47,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-07-25 08:49:47,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-07-25 08:49:47,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-07-25 08:49:47,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 254 transitions. [2018-07-25 08:49:47,658 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 254 transitions. Word has length 46 [2018-07-25 08:49:47,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:47,659 INFO L472 AbstractCegarLoop]: Abstraction has 180 states and 254 transitions. [2018-07-25 08:49:47,659 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:49:47,659 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 254 transitions. [2018-07-25 08:49:47,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-07-25 08:49:47,661 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:47,661 INFO L354 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:49:47,661 INFO L415 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:47,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1814017687, now seen corresponding path program 1 times [2018-07-25 08:49:47,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:47,710 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-07-25 08:49:47,710 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:47,711 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 08:49:47,711 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 08:49:47,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 08:49:47,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:49:47,712 INFO L87 Difference]: Start difference. First operand 180 states and 254 transitions. Second operand 4 states. [2018-07-25 08:49:47,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:47,884 INFO L93 Difference]: Finished difference Result 520 states and 725 transitions. [2018-07-25 08:49:47,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 08:49:47,885 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-07-25 08:49:47,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:47,888 INFO L225 Difference]: With dead ends: 520 [2018-07-25 08:49:47,888 INFO L226 Difference]: Without dead ends: 325 [2018-07-25 08:49:47,890 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-25 08:49:47,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-07-25 08:49:47,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 185. [2018-07-25 08:49:47,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-07-25 08:49:47,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 250 transitions. [2018-07-25 08:49:47,939 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 250 transitions. Word has length 49 [2018-07-25 08:49:47,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:47,939 INFO L472 AbstractCegarLoop]: Abstraction has 185 states and 250 transitions. [2018-07-25 08:49:47,940 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 08:49:47,940 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 250 transitions. [2018-07-25 08:49:47,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-25 08:49:47,947 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:47,947 INFO L354 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:49:47,947 INFO L415 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:47,950 INFO L82 PathProgramCache]: Analyzing trace with hash -894728562, now seen corresponding path program 1 times [2018-07-25 08:49:47,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:48,006 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-07-25 08:49:48,007 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:49:48,007 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 08:49:48,008 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:49:48,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:49:48,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:49:48,010 INFO L87 Difference]: Start difference. First operand 185 states and 250 transitions. Second operand 3 states. [2018-07-25 08:49:48,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:48,067 INFO L93 Difference]: Finished difference Result 280 states and 384 transitions. [2018-07-25 08:49:48,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:49:48,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-07-25 08:49:48,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:48,069 INFO L225 Difference]: With dead ends: 280 [2018-07-25 08:49:48,069 INFO L226 Difference]: Without dead ends: 184 [2018-07-25 08:49:48,070 INFO L574 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-25 08:49:48,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-07-25 08:49:48,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-07-25 08:49:48,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-07-25 08:49:48,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 247 transitions. [2018-07-25 08:49:48,109 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 247 transitions. Word has length 64 [2018-07-25 08:49:48,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:48,109 INFO L472 AbstractCegarLoop]: Abstraction has 184 states and 247 transitions. [2018-07-25 08:49:48,109 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:49:48,110 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 247 transitions. [2018-07-25 08:49:48,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-25 08:49:48,111 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:48,111 INFO L354 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:49:48,111 INFO L415 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:48,112 INFO L82 PathProgramCache]: Analyzing trace with hash 7017616, now seen corresponding path program 1 times [2018-07-25 08:49:48,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:48,164 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-07-25 08:49:48,165 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:49:48,165 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 08:49:48,166 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:49:48,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:49:48,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:49:48,167 INFO L87 Difference]: Start difference. First operand 184 states and 247 transitions. Second operand 3 states. [2018-07-25 08:49:48,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:48,231 INFO L93 Difference]: Finished difference Result 278 states and 378 transitions. [2018-07-25 08:49:48,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:49:48,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-07-25 08:49:48,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:48,233 INFO L225 Difference]: With dead ends: 278 [2018-07-25 08:49:48,233 INFO L226 Difference]: Without dead ends: 183 [2018-07-25 08:49:48,234 INFO L574 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-25 08:49:48,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-07-25 08:49:48,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-07-25 08:49:48,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-07-25 08:49:48,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 243 transitions. [2018-07-25 08:49:48,268 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 243 transitions. Word has length 68 [2018-07-25 08:49:48,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:48,269 INFO L472 AbstractCegarLoop]: Abstraction has 183 states and 243 transitions. [2018-07-25 08:49:48,269 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:49:48,269 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 243 transitions. [2018-07-25 08:49:48,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-07-25 08:49:48,270 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:48,270 INFO L354 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:49:48,271 INFO L415 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:48,271 INFO L82 PathProgramCache]: Analyzing trace with hash 336193566, now seen corresponding path program 1 times [2018-07-25 08:49:48,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:48,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:48,312 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-07-25 08:49:48,312 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:49:48,313 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 08:49:48,313 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:49:48,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:49:48,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:49:48,314 INFO L87 Difference]: Start difference. First operand 183 states and 243 transitions. Second operand 3 states. [2018-07-25 08:49:48,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:48,372 INFO L93 Difference]: Finished difference Result 359 states and 478 transitions. [2018-07-25 08:49:48,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:49:48,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-07-25 08:49:48,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:48,374 INFO L225 Difference]: With dead ends: 359 [2018-07-25 08:49:48,375 INFO L226 Difference]: Without dead ends: 182 [2018-07-25 08:49:48,376 INFO L574 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-25 08:49:48,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-07-25 08:49:48,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-07-25 08:49:48,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-07-25 08:49:48,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 237 transitions. [2018-07-25 08:49:48,412 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 237 transitions. Word has length 73 [2018-07-25 08:49:48,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:48,412 INFO L472 AbstractCegarLoop]: Abstraction has 182 states and 237 transitions. [2018-07-25 08:49:48,413 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:49:48,413 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 237 transitions. [2018-07-25 08:49:48,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-07-25 08:49:48,414 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:48,414 INFO L354 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 6, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:49:48,414 INFO L415 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:48,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1875725862, now seen corresponding path program 1 times [2018-07-25 08:49:48,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:48,461 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-07-25 08:49:48,461 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:49:48,461 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 08:49:48,462 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:49:48,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:49:48,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:49:48,463 INFO L87 Difference]: Start difference. First operand 182 states and 237 transitions. Second operand 3 states. [2018-07-25 08:49:48,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:48,524 INFO L93 Difference]: Finished difference Result 356 states and 465 transitions. [2018-07-25 08:49:48,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:49:48,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2018-07-25 08:49:48,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:48,526 INFO L225 Difference]: With dead ends: 356 [2018-07-25 08:49:48,526 INFO L226 Difference]: Without dead ends: 181 [2018-07-25 08:49:48,527 INFO L574 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-25 08:49:48,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-07-25 08:49:48,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-07-25 08:49:48,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-07-25 08:49:48,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 231 transitions. [2018-07-25 08:49:48,560 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 231 transitions. Word has length 79 [2018-07-25 08:49:48,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:48,560 INFO L472 AbstractCegarLoop]: Abstraction has 181 states and 231 transitions. [2018-07-25 08:49:48,560 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:49:48,561 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 231 transitions. [2018-07-25 08:49:48,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-25 08:49:48,562 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:48,562 INFO L354 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 7, 6, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:49:48,562 INFO L415 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:48,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1352640754, now seen corresponding path program 1 times [2018-07-25 08:49:48,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:48,625 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-07-25 08:49:48,626 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:49:48,626 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 08:49:48,626 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:49:48,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:49:48,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:49:48,627 INFO L87 Difference]: Start difference. First operand 181 states and 231 transitions. Second operand 3 states. [2018-07-25 08:49:48,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:48,690 INFO L93 Difference]: Finished difference Result 356 states and 457 transitions. [2018-07-25 08:49:48,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:49:48,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-07-25 08:49:48,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:48,692 INFO L225 Difference]: With dead ends: 356 [2018-07-25 08:49:48,694 INFO L226 Difference]: Without dead ends: 183 [2018-07-25 08:49:48,695 INFO L574 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-25 08:49:48,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-07-25 08:49:48,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-07-25 08:49:48,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-07-25 08:49:48,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 230 transitions. [2018-07-25 08:49:48,730 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 230 transitions. Word has length 86 [2018-07-25 08:49:48,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:48,730 INFO L472 AbstractCegarLoop]: Abstraction has 183 states and 230 transitions. [2018-07-25 08:49:48,731 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:49:48,731 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 230 transitions. [2018-07-25 08:49:48,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-25 08:49:48,732 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:48,732 INFO L354 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 7, 6, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:49:48,732 INFO L415 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:48,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1366483836, now seen corresponding path program 1 times [2018-07-25 08:49:48,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:48,800 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-07-25 08:49:48,801 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:49:48,801 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 08:49:48,801 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:49:48,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:49:48,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:49:48,802 INFO L87 Difference]: Start difference. First operand 183 states and 230 transitions. Second operand 3 states. [2018-07-25 08:49:48,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:48,869 INFO L93 Difference]: Finished difference Result 378 states and 478 transitions. [2018-07-25 08:49:48,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:49:48,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2018-07-25 08:49:48,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:48,871 INFO L225 Difference]: With dead ends: 378 [2018-07-25 08:49:48,871 INFO L226 Difference]: Without dead ends: 203 [2018-07-25 08:49:48,872 INFO L574 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-25 08:49:48,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-07-25 08:49:48,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-07-25 08:49:48,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-07-25 08:49:48,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 250 transitions. [2018-07-25 08:49:48,910 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 250 transitions. Word has length 94 [2018-07-25 08:49:48,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:48,910 INFO L472 AbstractCegarLoop]: Abstraction has 203 states and 250 transitions. [2018-07-25 08:49:48,910 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:49:48,911 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 250 transitions. [2018-07-25 08:49:48,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-25 08:49:48,912 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:48,912 INFO L354 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:49:48,912 INFO L415 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:48,912 INFO L82 PathProgramCache]: Analyzing trace with hash 655809876, now seen corresponding path program 1 times [2018-07-25 08:49:48,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:49,035 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 60 proven. 81 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2018-07-25 08:49:49,035 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:49,035 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 08:49:49,036 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 08:49:49,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 08:49:49,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:49:49,040 INFO L87 Difference]: Start difference. First operand 203 states and 250 transitions. Second operand 4 states. [2018-07-25 08:49:49,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:49,146 INFO L93 Difference]: Finished difference Result 587 states and 729 transitions. [2018-07-25 08:49:49,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 08:49:49,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-07-25 08:49:49,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:49,150 INFO L225 Difference]: With dead ends: 587 [2018-07-25 08:49:49,150 INFO L226 Difference]: Without dead ends: 484 [2018-07-25 08:49:49,151 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-25 08:49:49,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-07-25 08:49:49,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 294. [2018-07-25 08:49:49,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-07-25 08:49:49,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 366 transitions. [2018-07-25 08:49:49,268 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 366 transitions. Word has length 104 [2018-07-25 08:49:49,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:49,268 INFO L472 AbstractCegarLoop]: Abstraction has 294 states and 366 transitions. [2018-07-25 08:49:49,268 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 08:49:49,269 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 366 transitions. [2018-07-25 08:49:49,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-25 08:49:49,270 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:49,270 INFO L354 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 12, 11, 10, 9, 8, 7, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:49:49,271 INFO L415 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:49,271 INFO L82 PathProgramCache]: Analyzing trace with hash -368721125, now seen corresponding path program 2 times [2018-07-25 08:49:49,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:49,397 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2018-07-25 08:49:49,398 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:49:49,398 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 08:49:49,398 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:49:49,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:49:49,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:49:49,399 INFO L87 Difference]: Start difference. First operand 294 states and 366 transitions. Second operand 3 states. [2018-07-25 08:49:49,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:49,484 INFO L93 Difference]: Finished difference Result 580 states and 723 transitions. [2018-07-25 08:49:49,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:49:49,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2018-07-25 08:49:49,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:49,488 INFO L225 Difference]: With dead ends: 580 [2018-07-25 08:49:49,488 INFO L226 Difference]: Without dead ends: 294 [2018-07-25 08:49:49,489 INFO L574 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-25 08:49:49,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-07-25 08:49:49,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2018-07-25 08:49:49,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-07-25 08:49:49,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 352 transitions. [2018-07-25 08:49:49,547 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 352 transitions. Word has length 140 [2018-07-25 08:49:49,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:49,549 INFO L472 AbstractCegarLoop]: Abstraction has 294 states and 352 transitions. [2018-07-25 08:49:49,549 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:49:49,549 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 352 transitions. [2018-07-25 08:49:49,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-07-25 08:49:49,553 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:49,553 INFO L354 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 16, 15, 14, 12, 10, 8, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:49:49,554 INFO L415 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:49,554 INFO L82 PathProgramCache]: Analyzing trace with hash 619884813, now seen corresponding path program 1 times [2018-07-25 08:49:49,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:49,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1262 backedges. 737 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-07-25 08:49:49,669 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:49,669 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 08:49:49,669 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 08:49:49,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 08:49:49,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:49:49,670 INFO L87 Difference]: Start difference. First operand 294 states and 352 transitions. Second operand 4 states. [2018-07-25 08:49:49,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:49,743 INFO L93 Difference]: Finished difference Result 492 states and 592 transitions. [2018-07-25 08:49:49,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 08:49:49,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2018-07-25 08:49:49,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:49,744 INFO L225 Difference]: With dead ends: 492 [2018-07-25 08:49:49,744 INFO L226 Difference]: Without dead ends: 0 [2018-07-25 08:49:49,745 INFO L574 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-25 08:49:49,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-25 08:49:49,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-25 08:49:49,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-25 08:49:49,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-25 08:49:49,746 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 183 [2018-07-25 08:49:49,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:49,746 INFO L472 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-25 08:49:49,747 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 08:49:49,748 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-25 08:49:49,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-25 08:49:49,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-25 08:49:49,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:49,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:49,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:49,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:49,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:49,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:49,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:49,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:49,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:49,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:49,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:49,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:49,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:49,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:49,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:49,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:49,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:49,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:49,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:49,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:49,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:49,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:50,926 INFO L422 ceAbstractionStarter]: For program point L444(lines 441 466) no Hoare annotation was computed. [2018-07-25 08:49:50,928 INFO L418 ceAbstractionStarter]: At program point L337(lines 337 355) the Hoare annotation is: (let ((.cse0 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse2 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse0 .cse1 .cse2) (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse0 .cse1 .cse2) (and .cse3 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-07-25 08:49:50,928 INFO L418 ceAbstractionStarter]: At program point L465(lines 465 487) the Hoare annotation is: (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) [2018-07-25 08:49:50,928 INFO L422 ceAbstractionStarter]: For program point L457(lines 457 478) no Hoare annotation was computed. [2018-07-25 08:49:50,928 INFO L418 ceAbstractionStarter]: At program point L511(lines 511 515) the Hoare annotation is: false [2018-07-25 08:49:50,929 INFO L425 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 517) the Hoare annotation is: true [2018-07-25 08:49:50,929 INFO L418 ceAbstractionStarter]: At program point L317(lines 317 334) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse0 .cse1) (and .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse0 .cse1) (and .cse2 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-07-25 08:49:50,929 INFO L422 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 517) no Hoare annotation was computed. [2018-07-25 08:49:50,930 INFO L418 ceAbstractionStarter]: At program point L408(lines 408 420) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 8576) .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) .cse3))) [2018-07-25 08:49:50,930 INFO L418 ceAbstractionStarter]: At program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 516) the Hoare annotation is: false [2018-07-25 08:49:50,931 INFO L418 ceAbstractionStarter]: At program point ULTIMATE.startEXIT(lines 1 517) the Hoare annotation is: false [2018-07-25 08:49:50,931 INFO L418 ceAbstractionStarter]: At program point L285(lines 248 285) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse0) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse0) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-07-25 08:49:50,932 INFO L418 ceAbstractionStarter]: At program point L281(lines 281 300) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse0) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse0) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-07-25 08:49:50,932 INFO L418 ceAbstractionStarter]: At program point L393(lines 393 405) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 8576) .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) .cse3))) [2018-07-25 08:49:50,933 INFO L418 ceAbstractionStarter]: At program point L360(lines 360 371) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3)) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse4 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse1 .cse2 .cse3 .cse4) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse1 .cse2 .cse3 .cse4))) [2018-07-25 08:49:50,934 INFO L418 ceAbstractionStarter]: At program point L261(lines 261 277) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse0) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse0) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-07-25 08:49:50,934 INFO L422 ceAbstractionStarter]: For program point L480(lines 477 490) no Hoare annotation was computed. [2018-07-25 08:49:50,935 INFO L418 ceAbstractionStarter]: At program point L505(lines 276 505) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse0) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse0) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-07-25 08:49:50,935 INFO L418 ceAbstractionStarter]: At program point L373(lines 373 390) the Hoare annotation is: (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3) (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~6)))) [2018-07-25 08:49:50,936 INFO L418 ceAbstractionStarter]: At program point L435(lines 435 458) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and .cse0 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~6))) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)))) [2018-07-25 08:49:50,936 INFO L418 ceAbstractionStarter]: At program point L303(lines 303 314) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~6 8576) .cse0) (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse0) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~6 3)) (and .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~6 8448)))) [2018-07-25 08:49:50,936 INFO L422 ceAbstractionStarter]: For program point L431(lines 431 442) no Hoare annotation was computed. [2018-07-25 08:49:50,937 INFO L418 ceAbstractionStarter]: At program point L489(lines 489 512) the Hoare annotation is: (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) [2018-07-25 08:49:50,938 INFO L418 ceAbstractionStarter]: At program point L423(lines 423 432) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~6))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~6)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 3)) (and (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~6)) .cse0 .cse1 .cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~6)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~6))) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~6 2)))) [2018-07-25 08:49:50,938 INFO L418 ceAbstractionStarter]: At program point L514(lines 486 514) the Hoare annotation is: (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~6) [2018-07-25 08:49:50,954 INFO L202 PluginConnector]: Adding new model s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 08:49:50 BoogieIcfgContainer [2018-07-25 08:49:50,955 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 08:49:50,955 INFO L168 Benchmark]: Toolchain (without parser) took 5582.71 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 63.4 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 341.7 MB). Peak memory consumption was 405.1 MB. Max. memory is 7.1 GB. [2018-07-25 08:49:50,958 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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-25 08:49:50,958 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.90 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-25 08:49:50,959 INFO L168 Benchmark]: Boogie Preprocessor took 39.92 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-25 08:49:50,959 INFO L168 Benchmark]: RCFGBuilder took 516.17 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-25 08:49:50,960 INFO L168 Benchmark]: TraceAbstraction took 4975.19 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 63.4 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 320.5 MB). Peak memory consumption was 384.0 MB. Max. memory is 7.1 GB. [2018-07-25 08:49:50,964 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 46.90 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 39.92 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 516.17 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 4975.19 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 63.4 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 320.5 MB). Peak memory consumption was 384.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 516]: 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: 303]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~s__state~6 <= 3)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 276]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~s__state~6 <= 3)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~s__state~6 <= 3)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((((!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~s__state~6 <= 8576) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8512 == ssl3_accept_~s__state~6))) || ((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 486]: Loop Invariant Derived loop invariant: 8672 <= ssl3_accept_~s__state~6 - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~s__state~6 <= 3)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~s__state~6 <= 3)) || ((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((((!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~s__state~6 <= 8576) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8512 == ssl3_accept_~s__state~6))) || ((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: 8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3 - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: (((!(8448 == ssl3_accept_~s__state~6) && !(8672 == ssl3_accept_~s__state~6)) && !(8656 == ssl3_accept_~s__state~6)) || (8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2) - InvariantResult [Line: 360]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~s__state~6 == 8448)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~s__state~6 <= 3)) || ((((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || ((((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6)) - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~s__state~6 <= 3)) || ((!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 423]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || (((((!(8640 == ssl3_accept_~s__state~6) && !(8448 == ssl3_accept_~s__state~6)) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && !(8672 == ssl3_accept_~s__state~6)) && !(8656 == ssl3_accept_~s__state~6))) || (((!(8448 == ssl3_accept_~s__state~6) && !(8544 == ssl3_accept_~s__state~6)) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) - InvariantResult [Line: 337]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || (((ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~s__state~6 <= 3)) || (((!(8448 == ssl3_accept_~s__state~6) && !(8528 == ssl3_accept_~s__state~6)) && ssl3_accept_~blastFlag~6 <= 2) && !(8512 == ssl3_accept_~s__state~6))) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~s__state~6 == 8448) - InvariantResult [Line: 465]: Loop Invariant Derived loop invariant: 8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3 - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~6 && ssl3_accept_~blastFlag~6 <= 3) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 8576 && ssl3_accept_~blastFlag~6 <= 2)) || (!(8448 == ssl3_accept_~s__state~6) && ssl3_accept_~blastFlag~6 <= 2)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~s__state~6 <= 3)) || (ssl3_accept_~s__s3__tmp__next_state___0~6 <= 3 && ssl3_accept_~s__state~6 == 8448) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 1 error locations. SAFE Result, 4.8s OverallTime, 18 OverallIterations, 19 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 402 SDtfs, 139 SDslu, 168 SDs, 0 SdLazy, 587 SolverSat, 165 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=294occurred in iteration=16, 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.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 330 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 20 PreInvPairs, 243 NumberOfFragments, 574 HoareAnnotationTreeSize, 20 FomulaSimplifications, 13235 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 20 FomulaSimplificationsInter, 5432 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1206 NumberOfCodeBlocks, 1206 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1188 ConstructedInterpolants, 0 QuantifiedInterpolants, 152579 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 15 PerfectInterpolantSequences, 3861/3958 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_1.cil.c_23.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_08-49-50-980.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_1.cil.c_23.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_08-49-50-980.csv Received shutdown request...