java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_7.cil.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:38:27,512 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:38:27,514 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:38:27,525 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:38:27,525 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:38:27,527 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:38:27,528 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:38:27,530 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:38:27,532 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:38:27,533 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:38:27,534 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:38:27,535 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:38:27,535 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:38:27,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:38:27,537 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:38:27,538 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:38:27,539 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:38:27,540 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:38:27,542 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:38:27,545 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:38:27,546 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:38:27,548 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:38:27,549 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:38:27,550 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:38:27,553 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:38:27,553 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:38:27,553 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:38:27,554 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:38:27,555 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:38:27,556 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:38:27,556 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:38:27,557 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:38:27,558 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:38:27,559 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:38:27,560 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:38:27,561 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:38:27,562 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:38:27,562 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:38:27,562 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:38:27,563 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:38:27,564 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:38:27,592 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:38:27,605 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:38:27,608 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:38:27,610 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:38:27,611 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:38:27,612 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_7.cil.c_19.bpl [2019-08-04 21:38:27,612 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_7.cil.c_19.bpl' [2019-08-04 21:38:27,677 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:38:27,679 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:38:27,680 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:38:27,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:38:27,680 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:38:27,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:27" (1/1) ... [2019-08-04 21:38:27,719 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:27" (1/1) ... [2019-08-04 21:38:27,731 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:38:27,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:38:27,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:38:27,732 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:38:27,745 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:27" (1/1) ... [2019-08-04 21:38:27,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:27" (1/1) ... [2019-08-04 21:38:27,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:27" (1/1) ... [2019-08-04 21:38:27,750 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:27" (1/1) ... [2019-08-04 21:38:27,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:27" (1/1) ... [2019-08-04 21:38:27,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:27" (1/1) ... [2019-08-04 21:38:27,768 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:27" (1/1) ... [2019-08-04 21:38:27,771 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:38:27,772 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:38:27,772 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:38:27,773 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:38:27,774 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-04 21:38:27,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-04 21:38:27,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-04 21:38:28,385 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-08-04 21:38:28,496 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-04 21:38:28,496 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-04 21:38:28,497 INFO L202 PluginConnector]: Adding new model s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:38:28 BoogieIcfgContainer [2019-08-04 21:38:28,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:38:28,499 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:38:28,500 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:38:28,503 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:38:28,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:27" (1/2) ... [2019-08-04 21:38:28,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1865cb4 and model type s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:38:28, skipping insertion in model container [2019-08-04 21:38:28,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:38:28" (2/2) ... [2019-08-04 21:38:28,506 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_7.cil.c_19.bpl [2019-08-04 21:38:28,516 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:38:28,525 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-04 21:38:28,542 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-04 21:38:28,569 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:38:28,570 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:38:28,570 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:38:28,570 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:38:28,570 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:38:28,571 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:38:28,571 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:38:28,571 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:38:28,571 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:38:28,586 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2019-08-04 21:38:28,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:38:28,601 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:28,602 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:28,604 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:28,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:28,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1807955439, now seen corresponding path program 1 times [2019-08-04 21:38:28,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:28,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-04 21:38:28,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:28,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:28,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:28,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-04 21:38:28,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:28,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:28,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:28,802 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2019-08-04 21:38:28,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:28,897 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2019-08-04 21:38:28,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:28,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-08-04 21:38:28,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:28,921 INFO L225 Difference]: With dead ends: 17 [2019-08-04 21:38:28,921 INFO L226 Difference]: Without dead ends: 17 [2019-08-04 21:38:28,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:28,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-04 21:38:28,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-04 21:38:28,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-04 21:38:28,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2019-08-04 21:38:28,979 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 7 [2019-08-04 21:38:28,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:28,979 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-08-04 21:38:28,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:28,980 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2019-08-04 21:38:28,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:38:28,980 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:28,981 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:28,981 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:28,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:28,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1100281751, now seen corresponding path program 1 times [2019-08-04 21:38:28,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:29,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:38:29,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:29,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:29,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:29,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:38:29,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:29,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:29,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:29,075 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand 3 states. [2019-08-04 21:38:29,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:29,186 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2019-08-04 21:38:29,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:29,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-08-04 21:38:29,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:29,188 INFO L225 Difference]: With dead ends: 21 [2019-08-04 21:38:29,188 INFO L226 Difference]: Without dead ends: 21 [2019-08-04 21:38:29,189 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:29,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-04 21:38:29,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-04 21:38:29,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-04 21:38:29,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2019-08-04 21:38:29,193 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 10 [2019-08-04 21:38:29,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:29,194 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-08-04 21:38:29,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:29,194 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2019-08-04 21:38:29,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-04 21:38:29,195 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:29,195 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:29,195 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:29,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:29,196 INFO L82 PathProgramCache]: Analyzing trace with hash -2082374887, now seen corresponding path program 1 times [2019-08-04 21:38:29,197 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:29,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-04 21:38:29,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:29,261 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-04 21:38:29,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:29,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:38:29,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:29,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:29,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:29,263 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand 3 states. [2019-08-04 21:38:29,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:29,333 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2019-08-04 21:38:29,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:29,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-08-04 21:38:29,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:29,335 INFO L225 Difference]: With dead ends: 35 [2019-08-04 21:38:29,335 INFO L226 Difference]: Without dead ends: 35 [2019-08-04 21:38:29,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:29,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-04 21:38:29,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2019-08-04 21:38:29,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-04 21:38:29,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-08-04 21:38:29,341 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2019-08-04 21:38:29,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:29,342 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-08-04 21:38:29,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:29,342 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2019-08-04 21:38:29,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-04 21:38:29,343 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:29,343 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:29,343 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:29,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:29,344 INFO L82 PathProgramCache]: Analyzing trace with hash 471489091, now seen corresponding path program 1 times [2019-08-04 21:38:29,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:29,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:38:29,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:29,470 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:29,521 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-04 21:38:29,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:29,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:38:29,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:38:29,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:38:29,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:38:29,523 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 4 states. [2019-08-04 21:38:29,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:29,954 INFO L93 Difference]: Finished difference Result 61 states and 78 transitions. [2019-08-04 21:38:29,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:38:29,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-08-04 21:38:29,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:29,956 INFO L225 Difference]: With dead ends: 61 [2019-08-04 21:38:29,956 INFO L226 Difference]: Without dead ends: 61 [2019-08-04 21:38:29,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:38:29,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-04 21:38:29,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-04 21:38:29,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-04 21:38:29,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2019-08-04 21:38:29,965 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 78 transitions. Word has length 21 [2019-08-04 21:38:29,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:29,966 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 78 transitions. [2019-08-04 21:38:29,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:38:29,966 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2019-08-04 21:38:29,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-04 21:38:29,967 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:29,968 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:29,972 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:29,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:29,972 INFO L82 PathProgramCache]: Analyzing trace with hash 275899509, now seen corresponding path program 1 times [2019-08-04 21:38:29,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:30,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-04 21:38:30,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:30,102 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-08-04 21:38:30,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:30,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:38:30,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:30,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:30,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:30,104 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. Second operand 3 states. [2019-08-04 21:38:30,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:30,229 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2019-08-04 21:38:30,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:30,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-08-04 21:38:30,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:30,239 INFO L225 Difference]: With dead ends: 56 [2019-08-04 21:38:30,239 INFO L226 Difference]: Without dead ends: 56 [2019-08-04 21:38:30,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:30,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-04 21:38:30,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-08-04 21:38:30,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-04 21:38:30,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2019-08-04 21:38:30,247 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 26 [2019-08-04 21:38:30,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:30,247 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2019-08-04 21:38:30,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:30,247 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2019-08-04 21:38:30,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-04 21:38:30,248 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:30,249 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2019-08-04 21:38:30,249 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:30,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:30,249 INFO L82 PathProgramCache]: Analyzing trace with hash -2048264231, now seen corresponding path program 2 times [2019-08-04 21:38:30,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:30,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:38:30,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:30,413 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-08-04 21:38:30,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:30,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-04 21:38:30,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:38:30,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:38:30,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:38:30,415 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand 4 states. [2019-08-04 21:38:30,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:30,534 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2019-08-04 21:38:30,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:38:30,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-08-04 21:38:30,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:30,536 INFO L225 Difference]: With dead ends: 76 [2019-08-04 21:38:30,536 INFO L226 Difference]: Without dead ends: 76 [2019-08-04 21:38:30,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:38:30,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-04 21:38:30,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2019-08-04 21:38:30,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-04 21:38:30,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2019-08-04 21:38:30,551 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 28 [2019-08-04 21:38:30,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:30,551 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2019-08-04 21:38:30,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:38:30,551 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2019-08-04 21:38:30,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-04 21:38:30,553 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:30,553 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:30,554 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:30,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:30,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1703845991, now seen corresponding path program 2 times [2019-08-04 21:38:30,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:30,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:38:30,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:30,710 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:30,830 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 34 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-04 21:38:30,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:30,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:38:30,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:38:30,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:38:30,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:38:30,832 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand 6 states. [2019-08-04 21:38:31,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:31,087 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2019-08-04 21:38:31,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:38:31,088 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-08-04 21:38:31,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:31,089 INFO L225 Difference]: With dead ends: 72 [2019-08-04 21:38:31,090 INFO L226 Difference]: Without dead ends: 72 [2019-08-04 21:38:31,090 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:38:31,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-04 21:38:31,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-08-04 21:38:31,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-04 21:38:31,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2019-08-04 21:38:31,097 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 33 [2019-08-04 21:38:31,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:31,097 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2019-08-04 21:38:31,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:38:31,098 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2019-08-04 21:38:31,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-04 21:38:31,099 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:31,100 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 4, 3, 3, 2, 1, 1, 1, 1, 1] [2019-08-04 21:38:31,100 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:31,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:31,100 INFO L82 PathProgramCache]: Analyzing trace with hash 2134298763, now seen corresponding path program 3 times [2019-08-04 21:38:31,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:31,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:38:31,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:31,225 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:31,463 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:31,512 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:31,678 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 36 proven. 84 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-04 21:38:31,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:31,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:38:31,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:38:31,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:38:31,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:38:31,680 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand 8 states. [2019-08-04 21:38:32,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:32,082 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2019-08-04 21:38:32,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:38:32,082 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-08-04 21:38:32,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:32,084 INFO L225 Difference]: With dead ends: 86 [2019-08-04 21:38:32,084 INFO L226 Difference]: Without dead ends: 86 [2019-08-04 21:38:32,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:38:32,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-04 21:38:32,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 77. [2019-08-04 21:38:32,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-04 21:38:32,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2019-08-04 21:38:32,091 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 45 [2019-08-04 21:38:32,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:32,091 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2019-08-04 21:38:32,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:38:32,091 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2019-08-04 21:38:32,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-04 21:38:32,093 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:32,093 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 5, 4, 4, 2, 1, 1, 1, 1, 1] [2019-08-04 21:38:32,093 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:32,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:32,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1173574567, now seen corresponding path program 4 times [2019-08-04 21:38:32,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:32,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-04 21:38:32,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:32,270 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:32,290 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:32,291 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:32,292 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:32,299 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 123 proven. 5 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-08-04 21:38:32,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:32,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:38:32,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:38:32,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:38:32,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:38:32,301 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 4 states. [2019-08-04 21:38:32,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:32,534 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2019-08-04 21:38:32,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:38:32,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-08-04 21:38:32,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:32,535 INFO L225 Difference]: With dead ends: 79 [2019-08-04 21:38:32,535 INFO L226 Difference]: Without dead ends: 0 [2019-08-04 21:38:32,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:38:32,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-04 21:38:32,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-04 21:38:32,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-04 21:38:32,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-04 21:38:32,537 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2019-08-04 21:38:32,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:32,537 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-04 21:38:32,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:38:32,538 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-04 21:38:32,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-04 21:38:32,543 INFO L202 PluginConnector]: Adding new model s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:38:32 BoogieIcfgContainer [2019-08-04 21:38:32,544 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:38:32,547 INFO L168 Benchmark]: Toolchain (without parser) took 4867.04 ms. Allocated memory was 134.2 MB in the beginning and 197.1 MB in the end (delta: 62.9 MB). Free memory was 110.9 MB in the beginning and 81.4 MB in the end (delta: 29.6 MB). Peak memory consumption was 92.5 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:32,548 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 134.2 MB. Free memory was 113.0 MB in the beginning and 112.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-04 21:38:32,549 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.08 ms. Allocated memory is still 134.2 MB. Free memory was 110.7 MB in the beginning and 109.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:32,550 INFO L168 Benchmark]: Boogie Preprocessor took 39.58 ms. Allocated memory is still 134.2 MB. Free memory was 109.0 MB in the beginning and 107.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:32,550 INFO L168 Benchmark]: RCFGBuilder took 725.32 ms. Allocated memory is still 134.2 MB. Free memory was 107.5 MB in the beginning and 82.3 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:32,552 INFO L168 Benchmark]: TraceAbstraction took 4044.58 ms. Allocated memory was 134.2 MB in the beginning and 197.1 MB in the end (delta: 62.9 MB). Free memory was 82.1 MB in the beginning and 81.4 MB in the end (delta: 739.2 kB). Peak memory consumption was 63.7 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:32,556 INFO L335 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.23 ms. Allocated memory is still 134.2 MB. Free memory was 113.0 MB in the beginning and 112.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 52.08 ms. Allocated memory is still 134.2 MB. Free memory was 110.7 MB in the beginning and 109.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.58 ms. Allocated memory is still 134.2 MB. Free memory was 109.0 MB in the beginning and 107.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 725.32 ms. Allocated memory is still 134.2 MB. Free memory was 107.5 MB in the beginning and 82.3 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4044.58 ms. Allocated memory was 134.2 MB in the beginning and 197.1 MB in the end (delta: 62.9 MB). Free memory was 82.1 MB in the beginning and 81.4 MB in the end (delta: 739.2 kB). Peak memory consumption was 63.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 353]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. SAFE Result, 3.9s OverallTime, 9 OverallIterations, 9 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 116 SDtfs, 22 SDslu, 100 SDs, 0 SdLazy, 452 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=8, 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.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 31 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 236 NumberOfCodeBlocks, 236 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 227 ConstructedInterpolants, 0 QuantifiedInterpolants, 52892 SizeOfPredicates, 61 NumberOfNonLiveVariables, 2223 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 323/452 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...