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/random/RanFile063.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:05:03,080 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:05:03,084 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:05:03,100 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:05:03,100 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:05:03,102 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:05:03,104 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:05:03,106 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:05:03,109 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:05:03,114 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:05:03,115 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:05:03,115 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:05:03,116 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:05:03,117 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:05:03,118 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:05:03,120 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:05:03,121 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:05:03,122 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:05:03,125 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:05:03,128 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:05:03,130 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:05:03,132 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:05:03,133 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:05:03,134 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:05:03,137 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:05:03,138 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:05:03,138 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:05:03,139 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:05:03,140 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:05:03,141 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:05:03,142 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:05:03,147 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:05:03,147 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:05:03,148 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:05:03,149 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:05:03,149 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:05:03,150 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:05:03,150 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:05:03,150 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:05:03,151 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:05:03,152 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:05:03,179 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:05:03,192 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:05:03,196 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:05:03,197 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:05:03,198 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:05:03,199 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/random/RanFile063.bpl [2019-08-05 10:05:03,199 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/random/RanFile063.bpl' [2019-08-05 10:05:03,275 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:05:03,277 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:05:03,278 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:05:03,278 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:05:03,278 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:05:03,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "RanFile063.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:05:03" (1/1) ... [2019-08-05 10:05:03,312 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "RanFile063.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:05:03" (1/1) ... [2019-08-05 10:05:03,328 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:05:03,328 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:05:03,329 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:05:03,331 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:05:03,334 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:05:03,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:05:03,335 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:05:03,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "RanFile063.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:05:03" (1/1) ... [2019-08-05 10:05:03,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "RanFile063.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:05:03" (1/1) ... [2019-08-05 10:05:03,351 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "RanFile063.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:05:03" (1/1) ... [2019-08-05 10:05:03,352 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "RanFile063.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:05:03" (1/1) ... [2019-08-05 10:05:03,367 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "RanFile063.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:05:03" (1/1) ... [2019-08-05 10:05:03,387 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "RanFile063.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:05:03" (1/1) ... [2019-08-05 10:05:03,391 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "RanFile063.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:05:03" (1/1) ... [2019-08-05 10:05:03,402 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:05:03,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:05:03,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:05:03,404 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:05:03,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "RanFile063.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:05:03" (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-05 10:05:03,467 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:05:03,468 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:05:03,468 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:05:05,205 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:05:05,206 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:05:05,207 INFO L202 PluginConnector]: Adding new model RanFile063.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:05:05 BoogieIcfgContainer [2019-08-05 10:05:05,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:05:05,209 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:05:05,209 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:05:05,212 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:05:05,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RanFile063.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:05:03" (1/2) ... [2019-08-05 10:05:05,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53a0f32a and model type RanFile063.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:05:05, skipping insertion in model container [2019-08-05 10:05:05,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RanFile063.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:05:05" (2/2) ... [2019-08-05 10:05:05,215 INFO L109 eAbstractionObserver]: Analyzing ICFG RanFile063.bpl [2019-08-05 10:05:05,224 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:05:05,232 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-08-05 10:05:05,249 INFO L252 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-08-05 10:05:05,274 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:05:05,275 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:05:05,275 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:05:05,275 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:05:05,275 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:05:05,275 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:05:05,276 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:05:05,276 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:05:05,276 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:05:05,292 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-08-05 10:05:05,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:05:05,301 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:05,302 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:05,305 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:05,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:05,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1828867631, now seen corresponding path program 1 times [2019-08-05 10:05:05,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:05,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:05:05,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:05,598 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-05 10:05:05,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:05,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:05:05,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:05:05,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:05:05,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:05:05,625 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 5 states. [2019-08-05 10:05:06,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:06,996 INFO L93 Difference]: Finished difference Result 54 states and 97 transitions. [2019-08-05 10:05:06,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:05:06,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-08-05 10:05:06,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:07,009 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:05:07,009 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:05:07,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:05:07,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:05:07,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2019-08-05 10:05:07,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:05:07,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 88 transitions. [2019-08-05 10:05:07,053 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 88 transitions. Word has length 17 [2019-08-05 10:05:07,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:07,054 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 88 transitions. [2019-08-05 10:05:07,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:05:07,054 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 88 transitions. [2019-08-05 10:05:07,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:05:07,056 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:07,056 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:07,056 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:07,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:07,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1244608984, now seen corresponding path program 1 times [2019-08-05 10:05:07,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:07,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:05:07,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:07,162 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:07,538 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-05 10:05:07,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:07,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:05:07,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:05:07,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:05:07,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:05:07,542 INFO L87 Difference]: Start difference. First operand 49 states and 88 transitions. Second operand 7 states. [2019-08-05 10:05:08,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:08,083 INFO L93 Difference]: Finished difference Result 74 states and 135 transitions. [2019-08-05 10:05:08,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:05:08,084 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-08-05 10:05:08,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:08,086 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:05:08,087 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:05:08,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:05:08,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:05:08,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 49. [2019-08-05 10:05:08,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:05:08,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 87 transitions. [2019-08-05 10:05:08,097 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 87 transitions. Word has length 18 [2019-08-05 10:05:08,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:08,097 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 87 transitions. [2019-08-05 10:05:08,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:05:08,098 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 87 transitions. [2019-08-05 10:05:08,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:05:08,099 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:08,099 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:08,099 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:08,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:08,100 INFO L82 PathProgramCache]: Analyzing trace with hash 734705767, now seen corresponding path program 1 times [2019-08-05 10:05:08,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:08,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:08,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:05:08,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:08,176 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:08,177 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:08,249 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:08,305 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:08,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:05:08,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:08,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:05:08,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:05:08,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:05:08,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:05:08,358 INFO L87 Difference]: Start difference. First operand 49 states and 87 transitions. Second operand 7 states. [2019-08-05 10:05:09,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:09,333 INFO L93 Difference]: Finished difference Result 69 states and 125 transitions. [2019-08-05 10:05:09,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:05:09,334 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-08-05 10:05:09,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:09,337 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:05:09,338 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:05:09,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:05:09,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:05:09,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 55. [2019-08-05 10:05:09,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:05:09,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 97 transitions. [2019-08-05 10:05:09,345 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 97 transitions. Word has length 18 [2019-08-05 10:05:09,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:09,346 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 97 transitions. [2019-08-05 10:05:09,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:05:09,346 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 97 transitions. [2019-08-05 10:05:09,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:05:09,347 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:09,347 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:09,348 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:09,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:09,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1666854640, now seen corresponding path program 1 times [2019-08-05 10:05:09,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:09,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:05:09,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:09,463 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:09,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:05:09,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:09,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:05:09,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:05:09,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:05:09,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:05:09,530 INFO L87 Difference]: Start difference. First operand 55 states and 97 transitions. Second operand 4 states. [2019-08-05 10:05:09,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:09,983 INFO L93 Difference]: Finished difference Result 59 states and 104 transitions. [2019-08-05 10:05:09,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:05:09,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-08-05 10:05:09,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:09,986 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:05:09,986 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:05:09,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:05:09,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:05:09,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:05:09,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:05:09,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 96 transitions. [2019-08-05 10:05:09,996 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 96 transitions. Word has length 19 [2019-08-05 10:05:09,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:09,996 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 96 transitions. [2019-08-05 10:05:09,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:05:09,996 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 96 transitions. [2019-08-05 10:05:09,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:05:09,997 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:09,997 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:09,998 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:09,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:09,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1686961627, now seen corresponding path program 1 times [2019-08-05 10:05:09,999 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:10,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:10,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:05:10,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:10,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:05:10,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:10,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:05:10,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:05:10,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:05:10,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:05:10,137 INFO L87 Difference]: Start difference. First operand 55 states and 96 transitions. Second operand 6 states. [2019-08-05 10:05:10,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:10,814 INFO L93 Difference]: Finished difference Result 104 states and 180 transitions. [2019-08-05 10:05:10,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:05:10,814 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-08-05 10:05:10,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:10,817 INFO L225 Difference]: With dead ends: 104 [2019-08-05 10:05:10,817 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:05:10,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:05:10,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:05:10,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 64. [2019-08-05 10:05:10,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:05:10,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 111 transitions. [2019-08-05 10:05:10,825 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 111 transitions. Word has length 19 [2019-08-05 10:05:10,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:10,825 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 111 transitions. [2019-08-05 10:05:10,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:05:10,825 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 111 transitions. [2019-08-05 10:05:10,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:05:10,826 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:10,826 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:10,827 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:10,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:10,827 INFO L82 PathProgramCache]: Analyzing trace with hash 2026080207, now seen corresponding path program 1 times [2019-08-05 10:05:10,828 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:10,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:10,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:05:10,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:10,891 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:10,892 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:11,013 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:11,083 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:11,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:05:11,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:11,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 10:05:11,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:05:11,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:05:11,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:05:11,107 INFO L87 Difference]: Start difference. First operand 64 states and 111 transitions. Second operand 6 states. [2019-08-05 10:05:11,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:11,449 INFO L93 Difference]: Finished difference Result 69 states and 121 transitions. [2019-08-05 10:05:11,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:05:11,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-08-05 10:05:11,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:11,451 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:05:11,452 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:05:11,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:05:11,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:05:11,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2019-08-05 10:05:11,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:05:11,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 109 transitions. [2019-08-05 10:05:11,458 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 109 transitions. Word has length 19 [2019-08-05 10:05:11,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:11,458 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 109 transitions. [2019-08-05 10:05:11,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:05:11,458 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 109 transitions. [2019-08-05 10:05:11,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:05:11,459 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:11,460 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:11,460 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:11,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:11,460 INFO L82 PathProgramCache]: Analyzing trace with hash 550760487, now seen corresponding path program 2 times [2019-08-05 10:05:11,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:11,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:11,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:05:11,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:11,551 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:11,579 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:11,597 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:11,618 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:05:11,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:11,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:05:11,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:05:11,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:05:11,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:05:11,620 INFO L87 Difference]: Start difference. First operand 63 states and 109 transitions. Second operand 7 states. [2019-08-05 10:05:12,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:12,356 INFO L93 Difference]: Finished difference Result 129 states and 226 transitions. [2019-08-05 10:05:12,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:05:12,357 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-08-05 10:05:12,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:12,358 INFO L225 Difference]: With dead ends: 129 [2019-08-05 10:05:12,358 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 10:05:12,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:05:12,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 10:05:12,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 65. [2019-08-05 10:05:12,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:05:12,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 111 transitions. [2019-08-05 10:05:12,372 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 111 transitions. Word has length 20 [2019-08-05 10:05:12,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:12,372 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 111 transitions. [2019-08-05 10:05:12,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:05:12,372 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 111 transitions. [2019-08-05 10:05:12,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:05:12,374 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:12,374 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:12,375 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:12,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:12,375 INFO L82 PathProgramCache]: Analyzing trace with hash -705978787, now seen corresponding path program 1 times [2019-08-05 10:05:12,381 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:12,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:05:12,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:12,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:05:12,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:12,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:05:12,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:05:12,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:05:12,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:05:12,435 INFO L87 Difference]: Start difference. First operand 65 states and 111 transitions. Second operand 3 states. [2019-08-05 10:05:12,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:12,535 INFO L93 Difference]: Finished difference Result 58 states and 98 transitions. [2019-08-05 10:05:12,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:05:12,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-08-05 10:05:12,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:12,537 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:05:12,537 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:05:12,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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-05 10:05:12,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:05:12,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-08-05 10:05:12,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:05:12,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 97 transitions. [2019-08-05 10:05:12,541 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 97 transitions. Word has length 21 [2019-08-05 10:05:12,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:12,541 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 97 transitions. [2019-08-05 10:05:12,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:05:12,542 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 97 transitions. [2019-08-05 10:05:12,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:05:12,543 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:12,543 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:12,543 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:12,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:12,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1200669285, now seen corresponding path program 3 times [2019-08-05 10:05:12,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:12,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:12,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:05:12,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:12,645 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:12,646 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:12,815 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:05:12,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:12,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:05:12,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:05:12,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:05:12,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:05:12,817 INFO L87 Difference]: Start difference. First operand 57 states and 97 transitions. Second operand 7 states. [2019-08-05 10:05:13,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:13,270 INFO L93 Difference]: Finished difference Result 64 states and 109 transitions. [2019-08-05 10:05:13,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:05:13,271 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-08-05 10:05:13,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:13,272 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:05:13,272 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:05:13,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:05:13,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:05:13,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2019-08-05 10:05:13,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:05:13,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 97 transitions. [2019-08-05 10:05:13,279 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 97 transitions. Word has length 21 [2019-08-05 10:05:13,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:13,280 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 97 transitions. [2019-08-05 10:05:13,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:05:13,280 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 97 transitions. [2019-08-05 10:05:13,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:05:13,281 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:13,282 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:13,283 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:13,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:13,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1034102641, now seen corresponding path program 1 times [2019-08-05 10:05:13,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:13,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:13,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:05:13,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:13,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:05:13,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:13,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:05:13,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:05:13,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:05:13,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:05:13,324 INFO L87 Difference]: Start difference. First operand 57 states and 97 transitions. Second operand 3 states. [2019-08-05 10:05:13,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:13,407 INFO L93 Difference]: Finished difference Result 57 states and 96 transitions. [2019-08-05 10:05:13,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:05:13,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-08-05 10:05:13,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:13,408 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:05:13,408 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:05:13,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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-05 10:05:13,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:05:13,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:05:13,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:05:13,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 84 transitions. [2019-08-05 10:05:13,412 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 84 transitions. Word has length 21 [2019-08-05 10:05:13,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:13,413 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 84 transitions. [2019-08-05 10:05:13,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:05:13,413 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 84 transitions. [2019-08-05 10:05:13,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:05:13,414 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:13,414 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:13,414 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:13,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:13,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1606211492, now seen corresponding path program 1 times [2019-08-05 10:05:13,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:13,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:05:13,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:13,563 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:13,565 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:13,907 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-08-05 10:05:13,960 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:14,005 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:14,006 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:14,008 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:14,388 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-08-05 10:05:14,454 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:14,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:05:14,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:14,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:05:14,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:05:14,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:05:14,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:05:14,484 INFO L87 Difference]: Start difference. First operand 51 states and 84 transitions. Second operand 8 states. [2019-08-05 10:05:15,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:15,521 INFO L93 Difference]: Finished difference Result 67 states and 110 transitions. [2019-08-05 10:05:15,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:05:15,522 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-08-05 10:05:15,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:15,523 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:05:15,523 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:05:15,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:05:15,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:05:15,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2019-08-05 10:05:15,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:05:15,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 91 transitions. [2019-08-05 10:05:15,527 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 91 transitions. Word has length 21 [2019-08-05 10:05:15,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:15,527 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 91 transitions. [2019-08-05 10:05:15,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:05:15,528 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 91 transitions. [2019-08-05 10:05:15,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:05:15,529 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:15,529 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:15,529 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:15,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:15,530 INFO L82 PathProgramCache]: Analyzing trace with hash 2020540891, now seen corresponding path program 1 times [2019-08-05 10:05:15,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:15,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:15,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:05:15,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:15,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:05:15,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:15,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:05:15,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:05:15,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:05:15,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:05:15,587 INFO L87 Difference]: Start difference. First operand 56 states and 91 transitions. Second operand 5 states. [2019-08-05 10:05:16,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:16,230 INFO L93 Difference]: Finished difference Result 75 states and 118 transitions. [2019-08-05 10:05:16,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:05:16,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-08-05 10:05:16,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:16,232 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:05:16,232 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:05:16,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:05:16,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:05:16,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 61. [2019-08-05 10:05:16,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:05:16,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 99 transitions. [2019-08-05 10:05:16,237 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 99 transitions. Word has length 21 [2019-08-05 10:05:16,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:16,238 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 99 transitions. [2019-08-05 10:05:16,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:05:16,238 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 99 transitions. [2019-08-05 10:05:16,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:05:16,239 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:16,239 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:16,240 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:16,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:16,240 INFO L82 PathProgramCache]: Analyzing trace with hash 409080498, now seen corresponding path program 1 times [2019-08-05 10:05:16,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:16,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:05:16,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:16,494 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-05 10:05:16,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:16,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:05:16,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:05:16,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:05:16,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:05:16,496 INFO L87 Difference]: Start difference. First operand 61 states and 99 transitions. Second operand 7 states. [2019-08-05 10:05:16,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:16,879 INFO L93 Difference]: Finished difference Result 77 states and 128 transitions. [2019-08-05 10:05:16,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:05:16,880 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-08-05 10:05:16,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:16,881 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:05:16,882 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:05:16,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:05:16,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:05:16,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 66. [2019-08-05 10:05:16,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:05:16,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 108 transitions. [2019-08-05 10:05:16,885 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 108 transitions. Word has length 22 [2019-08-05 10:05:16,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:16,886 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 108 transitions. [2019-08-05 10:05:16,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:05:16,886 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 108 transitions. [2019-08-05 10:05:16,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:05:16,887 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:16,887 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:16,887 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:16,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:16,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1605737629, now seen corresponding path program 1 times [2019-08-05 10:05:16,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:16,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:16,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:05:16,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:16,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:05:16,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:16,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-08-05 10:05:16,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:05:16,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:05:16,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:05:16,993 INFO L87 Difference]: Start difference. First operand 66 states and 108 transitions. Second operand 8 states. [2019-08-05 10:05:17,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:17,500 INFO L93 Difference]: Finished difference Result 101 states and 165 transitions. [2019-08-05 10:05:17,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:05:17,501 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-08-05 10:05:17,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:17,502 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:05:17,502 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 10:05:17,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:05:17,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 10:05:17,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 74. [2019-08-05 10:05:17,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:05:17,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 122 transitions. [2019-08-05 10:05:17,506 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 122 transitions. Word has length 22 [2019-08-05 10:05:17,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:17,507 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 122 transitions. [2019-08-05 10:05:17,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:05:17,507 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 122 transitions. [2019-08-05 10:05:17,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:05:17,508 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:17,508 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:17,508 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:17,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:17,509 INFO L82 PathProgramCache]: Analyzing trace with hash 24713714, now seen corresponding path program 1 times [2019-08-05 10:05:17,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:17,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:05:17,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:17,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:05:17,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:17,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:05:17,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:05:17,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:05:17,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:05:17,601 INFO L87 Difference]: Start difference. First operand 74 states and 122 transitions. Second operand 5 states. [2019-08-05 10:05:17,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:17,914 INFO L93 Difference]: Finished difference Result 106 states and 177 transitions. [2019-08-05 10:05:17,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:05:17,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-08-05 10:05:17,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:17,915 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:05:17,916 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 10:05:17,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:05:17,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 10:05:17,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 76. [2019-08-05 10:05:17,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:05:17,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 125 transitions. [2019-08-05 10:05:17,920 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 125 transitions. Word has length 22 [2019-08-05 10:05:17,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:17,920 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 125 transitions. [2019-08-05 10:05:17,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:05:17,920 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 125 transitions. [2019-08-05 10:05:17,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:05:17,921 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:17,921 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:17,922 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:17,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:17,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1726027383, now seen corresponding path program 1 times [2019-08-05 10:05:17,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:17,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:05:17,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:18,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:05:18,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:18,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:05:18,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:05:18,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:05:18,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:05:18,018 INFO L87 Difference]: Start difference. First operand 76 states and 125 transitions. Second operand 8 states. [2019-08-05 10:05:18,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:18,362 INFO L93 Difference]: Finished difference Result 93 states and 155 transitions. [2019-08-05 10:05:18,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:05:18,363 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-08-05 10:05:18,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:18,364 INFO L225 Difference]: With dead ends: 93 [2019-08-05 10:05:18,364 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 10:05:18,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:05:18,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 10:05:18,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 77. [2019-08-05 10:05:18,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:05:18,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 127 transitions. [2019-08-05 10:05:18,368 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 127 transitions. Word has length 22 [2019-08-05 10:05:18,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:18,368 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 127 transitions. [2019-08-05 10:05:18,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:05:18,369 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 127 transitions. [2019-08-05 10:05:18,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:05:18,369 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:18,369 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:18,370 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:18,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:18,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1412019902, now seen corresponding path program 1 times [2019-08-05 10:05:18,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:18,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:05:18,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:18,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:05:18,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:18,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:05:18,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:05:18,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:05:18,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:05:18,407 INFO L87 Difference]: Start difference. First operand 77 states and 127 transitions. Second operand 3 states. [2019-08-05 10:05:18,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:18,463 INFO L93 Difference]: Finished difference Result 78 states and 128 transitions. [2019-08-05 10:05:18,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:05:18,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-08-05 10:05:18,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:18,464 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:05:18,464 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:05:18,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-05 10:05:18,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:05:18,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:05:18,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:05:18,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 125 transitions. [2019-08-05 10:05:18,468 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 125 transitions. Word has length 23 [2019-08-05 10:05:18,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:18,468 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 125 transitions. [2019-08-05 10:05:18,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:05:18,468 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 125 transitions. [2019-08-05 10:05:18,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:05:18,469 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:18,469 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:18,469 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:18,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:18,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1391621030, now seen corresponding path program 1 times [2019-08-05 10:05:18,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:18,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:05:18,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:18,582 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:18,583 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:18,584 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:18,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:05:18,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:18,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-08-05 10:05:18,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:05:18,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:05:18,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:05:18,674 INFO L87 Difference]: Start difference. First operand 77 states and 125 transitions. Second operand 9 states. [2019-08-05 10:05:19,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:19,007 INFO L93 Difference]: Finished difference Result 89 states and 142 transitions. [2019-08-05 10:05:19,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:05:19,008 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-08-05 10:05:19,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:19,009 INFO L225 Difference]: With dead ends: 89 [2019-08-05 10:05:19,009 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 10:05:19,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:05:19,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 10:05:19,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 82. [2019-08-05 10:05:19,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:05:19,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 131 transitions. [2019-08-05 10:05:19,014 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 131 transitions. Word has length 23 [2019-08-05 10:05:19,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:19,014 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 131 transitions. [2019-08-05 10:05:19,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:05:19,014 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 131 transitions. [2019-08-05 10:05:19,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:05:19,015 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:19,015 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:19,016 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:19,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:19,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1683116332, now seen corresponding path program 1 times [2019-08-05 10:05:19,017 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:19,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:05:19,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:19,069 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:19,097 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:19,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:05:19,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:19,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:05:19,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:05:19,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:05:19,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:05:19,159 INFO L87 Difference]: Start difference. First operand 82 states and 131 transitions. Second operand 10 states. [2019-08-05 10:05:20,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:20,711 INFO L93 Difference]: Finished difference Result 107 states and 167 transitions. [2019-08-05 10:05:20,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:05:20,712 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-08-05 10:05:20,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:20,713 INFO L225 Difference]: With dead ends: 107 [2019-08-05 10:05:20,714 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 10:05:20,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:05:20,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 10:05:20,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2019-08-05 10:05:20,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:05:20,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 138 transitions. [2019-08-05 10:05:20,717 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 138 transitions. Word has length 23 [2019-08-05 10:05:20,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:20,718 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 138 transitions. [2019-08-05 10:05:20,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:05:20,718 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 138 transitions. [2019-08-05 10:05:20,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:05:20,718 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:20,718 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:20,719 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:20,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:20,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1036703143, now seen corresponding path program 1 times [2019-08-05 10:05:20,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:20,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:05:20,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:20,787 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:20,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:05:20,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:20,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:05:20,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:05:20,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:05:20,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:05:20,816 INFO L87 Difference]: Start difference. First operand 87 states and 138 transitions. Second operand 7 states. [2019-08-05 10:05:21,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:21,052 INFO L93 Difference]: Finished difference Result 117 states and 190 transitions. [2019-08-05 10:05:21,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:05:21,057 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-08-05 10:05:21,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:21,057 INFO L225 Difference]: With dead ends: 117 [2019-08-05 10:05:21,058 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 10:05:21,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:05:21,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 10:05:21,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 98. [2019-08-05 10:05:21,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 10:05:21,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 160 transitions. [2019-08-05 10:05:21,061 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 160 transitions. Word has length 23 [2019-08-05 10:05:21,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:21,061 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 160 transitions. [2019-08-05 10:05:21,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:05:21,062 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 160 transitions. [2019-08-05 10:05:21,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:05:21,062 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:21,062 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:21,063 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:21,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:21,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1905526885, now seen corresponding path program 2 times [2019-08-05 10:05:21,064 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:21,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:05:21,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:21,184 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:21,348 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 10:05:21,350 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:21,565 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 10:05:21,566 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:22,027 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:05:22,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:22,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:05:22,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:05:22,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:05:22,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:05:22,029 INFO L87 Difference]: Start difference. First operand 98 states and 160 transitions. Second operand 9 states. [2019-08-05 10:05:22,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:22,616 INFO L93 Difference]: Finished difference Result 122 states and 203 transitions. [2019-08-05 10:05:22,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:05:22,616 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-08-05 10:05:22,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:22,618 INFO L225 Difference]: With dead ends: 122 [2019-08-05 10:05:22,618 INFO L226 Difference]: Without dead ends: 122 [2019-08-05 10:05:22,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:05:22,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-05 10:05:22,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 99. [2019-08-05 10:05:22,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:05:22,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 162 transitions. [2019-08-05 10:05:22,622 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 162 transitions. Word has length 23 [2019-08-05 10:05:22,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:22,622 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 162 transitions. [2019-08-05 10:05:22,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:05:22,622 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 162 transitions. [2019-08-05 10:05:22,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:05:22,623 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:22,623 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:22,623 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:22,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:22,624 INFO L82 PathProgramCache]: Analyzing trace with hash -372213841, now seen corresponding path program 1 times [2019-08-05 10:05:22,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:22,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:05:22,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:22,808 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:22,809 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:22,809 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:22,810 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:22,811 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:22,811 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:22,812 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:23,046 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:05:23,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:23,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:05:23,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:05:23,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:05:23,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:05:23,047 INFO L87 Difference]: Start difference. First operand 99 states and 162 transitions. Second operand 10 states. [2019-08-05 10:05:23,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:23,686 INFO L93 Difference]: Finished difference Result 110 states and 180 transitions. [2019-08-05 10:05:23,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:05:23,688 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-08-05 10:05:23,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:23,689 INFO L225 Difference]: With dead ends: 110 [2019-08-05 10:05:23,689 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 10:05:23,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:05:23,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 10:05:23,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 102. [2019-08-05 10:05:23,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:05:23,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 165 transitions. [2019-08-05 10:05:23,693 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 165 transitions. Word has length 23 [2019-08-05 10:05:23,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:23,693 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 165 transitions. [2019-08-05 10:05:23,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:05:23,694 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 165 transitions. [2019-08-05 10:05:23,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:05:23,694 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:23,694 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:23,695 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:23,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:23,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1791075558, now seen corresponding path program 1 times [2019-08-05 10:05:23,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:23,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:05:23,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:23,760 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:23,761 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:23,761 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:23,762 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:23,762 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:23,763 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:23,896 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:23,937 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:05:23,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:23,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:05:23,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:05:23,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:05:23,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:05:23,939 INFO L87 Difference]: Start difference. First operand 102 states and 165 transitions. Second operand 8 states. [2019-08-05 10:05:24,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:24,181 INFO L93 Difference]: Finished difference Result 105 states and 169 transitions. [2019-08-05 10:05:24,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:05:24,182 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-08-05 10:05:24,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:24,183 INFO L225 Difference]: With dead ends: 105 [2019-08-05 10:05:24,183 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 10:05:24,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:05:24,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 10:05:24,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 99. [2019-08-05 10:05:24,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:05:24,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 158 transitions. [2019-08-05 10:05:24,187 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 158 transitions. Word has length 24 [2019-08-05 10:05:24,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:24,187 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 158 transitions. [2019-08-05 10:05:24,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:05:24,187 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 158 transitions. [2019-08-05 10:05:24,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:05:24,188 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:24,188 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:24,188 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:24,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:24,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1562560624, now seen corresponding path program 1 times [2019-08-05 10:05:24,189 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:24,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:05:24,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:24,506 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:24,529 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:05:24,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:24,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:05:24,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:05:24,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:05:24,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:05:24,531 INFO L87 Difference]: Start difference. First operand 99 states and 158 transitions. Second operand 7 states. [2019-08-05 10:05:24,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:24,749 INFO L93 Difference]: Finished difference Result 117 states and 188 transitions. [2019-08-05 10:05:24,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:05:24,750 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-08-05 10:05:24,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:24,751 INFO L225 Difference]: With dead ends: 117 [2019-08-05 10:05:24,751 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 10:05:24,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:05:24,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 10:05:24,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 91. [2019-08-05 10:05:24,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:05:24,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 142 transitions. [2019-08-05 10:05:24,756 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 142 transitions. Word has length 24 [2019-08-05 10:05:24,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:24,756 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 142 transitions. [2019-08-05 10:05:24,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:05:24,756 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 142 transitions. [2019-08-05 10:05:24,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:05:24,757 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:24,757 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:24,757 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:24,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:24,757 INFO L82 PathProgramCache]: Analyzing trace with hash 637023035, now seen corresponding path program 1 times [2019-08-05 10:05:24,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:24,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:05:24,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:24,848 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:24,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:05:24,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:24,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:05:24,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:05:24,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:05:24,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:05:24,873 INFO L87 Difference]: Start difference. First operand 91 states and 142 transitions. Second operand 7 states. [2019-08-05 10:05:25,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:25,144 INFO L93 Difference]: Finished difference Result 88 states and 138 transitions. [2019-08-05 10:05:25,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:05:25,145 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-08-05 10:05:25,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:25,145 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:05:25,146 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:05:25,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:05:25,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:05:25,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2019-08-05 10:05:25,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:05:25,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 133 transitions. [2019-08-05 10:05:25,149 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 133 transitions. Word has length 24 [2019-08-05 10:05:25,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:25,150 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 133 transitions. [2019-08-05 10:05:25,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:05:25,150 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 133 transitions. [2019-08-05 10:05:25,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:05:25,150 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:25,151 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:25,151 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:25,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:25,151 INFO L82 PathProgramCache]: Analyzing trace with hash -477998881, now seen corresponding path program 1 times [2019-08-05 10:05:25,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:25,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:05:25,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:25,209 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:25,209 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:25,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:05:25,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:25,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 10:05:25,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:05:25,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:05:25,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:05:25,244 INFO L87 Difference]: Start difference. First operand 85 states and 133 transitions. Second operand 6 states. [2019-08-05 10:05:25,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:25,360 INFO L93 Difference]: Finished difference Result 95 states and 143 transitions. [2019-08-05 10:05:25,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:05:25,360 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-08-05 10:05:25,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:25,361 INFO L225 Difference]: With dead ends: 95 [2019-08-05 10:05:25,362 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 10:05:25,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:05:25,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 10:05:25,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2019-08-05 10:05:25,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:05:25,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 135 transitions. [2019-08-05 10:05:25,365 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 135 transitions. Word has length 24 [2019-08-05 10:05:25,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:25,366 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 135 transitions. [2019-08-05 10:05:25,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:05:25,366 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 135 transitions. [2019-08-05 10:05:25,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:05:25,366 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:25,366 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:25,367 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:25,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:25,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1119923145, now seen corresponding path program 3 times [2019-08-05 10:05:25,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:25,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:05:25,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:25,439 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:25,440 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:25,825 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2019-08-05 10:05:25,883 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:25,939 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:05:25,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:25,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 10:05:25,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:05:25,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:05:25,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:05:25,941 INFO L87 Difference]: Start difference. First operand 87 states and 135 transitions. Second operand 6 states. [2019-08-05 10:05:26,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:26,175 INFO L93 Difference]: Finished difference Result 89 states and 136 transitions. [2019-08-05 10:05:26,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:05:26,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-08-05 10:05:26,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:26,177 INFO L225 Difference]: With dead ends: 89 [2019-08-05 10:05:26,177 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 10:05:26,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:05:26,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 10:05:26,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2019-08-05 10:05:26,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:05:26,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 121 transitions. [2019-08-05 10:05:26,181 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 121 transitions. Word has length 24 [2019-08-05 10:05:26,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:26,181 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 121 transitions. [2019-08-05 10:05:26,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:05:26,182 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 121 transitions. [2019-08-05 10:05:26,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:05:26,182 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:26,182 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:26,182 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:26,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:26,183 INFO L82 PathProgramCache]: Analyzing trace with hash 2123068252, now seen corresponding path program 1 times [2019-08-05 10:05:26,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:26,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:05:26,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:26,292 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:26,293 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:26,294 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:26,295 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:26,296 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:26,296 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:26,424 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:26,474 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:05:26,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:26,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:05:26,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:05:26,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:05:26,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:05:26,475 INFO L87 Difference]: Start difference. First operand 78 states and 121 transitions. Second operand 9 states. [2019-08-05 10:05:26,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:26,915 INFO L93 Difference]: Finished difference Result 87 states and 133 transitions. [2019-08-05 10:05:26,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:05:26,916 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-08-05 10:05:26,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:26,917 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:05:26,917 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:05:26,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:05:26,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:05:26,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 79. [2019-08-05 10:05:26,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:05:26,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 123 transitions. [2019-08-05 10:05:26,920 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 123 transitions. Word has length 26 [2019-08-05 10:05:26,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:26,920 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 123 transitions. [2019-08-05 10:05:26,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:05:26,920 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 123 transitions. [2019-08-05 10:05:26,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:05:26,921 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:26,921 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:26,921 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:26,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:26,922 INFO L82 PathProgramCache]: Analyzing trace with hash -369123236, now seen corresponding path program 1 times [2019-08-05 10:05:26,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:26,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:05:26,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:27,046 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:05:27,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:27,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-08-05 10:05:27,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:05:27,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:05:27,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:05:27,047 INFO L87 Difference]: Start difference. First operand 79 states and 123 transitions. Second operand 10 states. [2019-08-05 10:05:27,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:27,750 INFO L93 Difference]: Finished difference Result 126 states and 191 transitions. [2019-08-05 10:05:27,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:05:27,758 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-08-05 10:05:27,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:27,759 INFO L225 Difference]: With dead ends: 126 [2019-08-05 10:05:27,759 INFO L226 Difference]: Without dead ends: 126 [2019-08-05 10:05:27,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:05:27,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-08-05 10:05:27,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 79. [2019-08-05 10:05:27,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:05:27,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 123 transitions. [2019-08-05 10:05:27,763 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 123 transitions. Word has length 27 [2019-08-05 10:05:27,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:27,763 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 123 transitions. [2019-08-05 10:05:27,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:05:27,763 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 123 transitions. [2019-08-05 10:05:27,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:05:27,764 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:27,764 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:27,764 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:27,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:27,765 INFO L82 PathProgramCache]: Analyzing trace with hash 659317853, now seen corresponding path program 1 times [2019-08-05 10:05:27,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:27,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:27,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:05:27,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:27,851 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:27,852 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:27,853 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:27,853 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:27,854 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:27,855 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:28,076 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:05:28,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:28,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-08-05 10:05:28,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:05:28,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:05:28,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:05:28,077 INFO L87 Difference]: Start difference. First operand 79 states and 123 transitions. Second operand 9 states. [2019-08-05 10:05:28,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:28,468 INFO L93 Difference]: Finished difference Result 96 states and 147 transitions. [2019-08-05 10:05:28,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:05:28,469 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-08-05 10:05:28,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:28,470 INFO L225 Difference]: With dead ends: 96 [2019-08-05 10:05:28,470 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 10:05:28,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:05:28,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 10:05:28,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2019-08-05 10:05:28,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 10:05:28,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 137 transitions. [2019-08-05 10:05:28,474 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 137 transitions. Word has length 27 [2019-08-05 10:05:28,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:28,474 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 137 transitions. [2019-08-05 10:05:28,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:05:28,474 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 137 transitions. [2019-08-05 10:05:28,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:05:28,475 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:28,475 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:28,475 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:28,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:28,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1442664028, now seen corresponding path program 2 times [2019-08-05 10:05:28,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:28,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:05:28,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:28,558 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:05:28,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:28,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:05:28,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:05:28,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:05:28,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:05:28,560 INFO L87 Difference]: Start difference. First operand 90 states and 137 transitions. Second operand 6 states. [2019-08-05 10:05:28,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:28,740 INFO L93 Difference]: Finished difference Result 119 states and 184 transitions. [2019-08-05 10:05:28,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:05:28,741 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-08-05 10:05:28,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:28,742 INFO L225 Difference]: With dead ends: 119 [2019-08-05 10:05:28,742 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 10:05:28,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:05:28,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 10:05:28,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 103. [2019-08-05 10:05:28,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 10:05:28,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 158 transitions. [2019-08-05 10:05:28,746 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 158 transitions. Word has length 27 [2019-08-05 10:05:28,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:28,746 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 158 transitions. [2019-08-05 10:05:28,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:05:28,747 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 158 transitions. [2019-08-05 10:05:28,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:05:28,747 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:28,747 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:28,747 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:28,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:28,748 INFO L82 PathProgramCache]: Analyzing trace with hash -878761874, now seen corresponding path program 2 times [2019-08-05 10:05:28,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:28,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:28,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:05:28,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:28,795 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:28,816 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:28,843 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:28,844 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:28,845 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:28,846 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:28,846 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:28,847 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:28,847 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:28,848 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:29,018 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:29,093 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:05:29,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:29,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:05:29,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:05:29,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:05:29,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:05:29,094 INFO L87 Difference]: Start difference. First operand 103 states and 158 transitions. Second operand 11 states. [2019-08-05 10:05:29,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:29,657 INFO L93 Difference]: Finished difference Result 112 states and 170 transitions. [2019-08-05 10:05:29,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:05:29,657 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-08-05 10:05:29,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:29,658 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:05:29,658 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 10:05:29,659 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:05:29,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 10:05:29,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 104. [2019-08-05 10:05:29,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 10:05:29,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 160 transitions. [2019-08-05 10:05:29,662 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 160 transitions. Word has length 27 [2019-08-05 10:05:29,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:29,663 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 160 transitions. [2019-08-05 10:05:29,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:05:29,663 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 160 transitions. [2019-08-05 10:05:29,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:05:29,663 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:29,664 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:29,664 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:29,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:29,664 INFO L82 PathProgramCache]: Analyzing trace with hash 448428005, now seen corresponding path program 1 times [2019-08-05 10:05:29,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:29,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:05:29,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:29,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:05:29,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:29,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:05:29,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:05:29,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:05:29,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:05:29,954 INFO L87 Difference]: Start difference. First operand 104 states and 160 transitions. Second operand 11 states. [2019-08-05 10:05:30,816 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2019-08-05 10:05:31,393 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2019-08-05 10:05:32,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:32,146 INFO L93 Difference]: Finished difference Result 164 states and 246 transitions. [2019-08-05 10:05:32,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:05:32,146 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-08-05 10:05:32,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:32,148 INFO L225 Difference]: With dead ends: 164 [2019-08-05 10:05:32,148 INFO L226 Difference]: Without dead ends: 164 [2019-08-05 10:05:32,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:05:32,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-08-05 10:05:32,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 104. [2019-08-05 10:05:32,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 10:05:32,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 160 transitions. [2019-08-05 10:05:32,153 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 160 transitions. Word has length 27 [2019-08-05 10:05:32,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:32,153 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 160 transitions. [2019-08-05 10:05:32,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:05:32,153 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 160 transitions. [2019-08-05 10:05:32,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:05:32,154 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:32,154 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:32,154 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:32,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:32,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1297368778, now seen corresponding path program 1 times [2019-08-05 10:05:32,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:32,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:05:32,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:32,274 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:32,276 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:32,277 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:32,278 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:32,279 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:32,280 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:32,280 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:32,726 WARN L188 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 36 [2019-08-05 10:05:32,795 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:32,883 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:32,924 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:05:32,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:32,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:05:32,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:05:32,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:05:32,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:05:32,925 INFO L87 Difference]: Start difference. First operand 104 states and 160 transitions. Second operand 9 states. [2019-08-05 10:05:33,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:33,519 INFO L93 Difference]: Finished difference Result 130 states and 191 transitions. [2019-08-05 10:05:33,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:05:33,519 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2019-08-05 10:05:33,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:33,520 INFO L225 Difference]: With dead ends: 130 [2019-08-05 10:05:33,520 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:05:33,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:05:33,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:05:33,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-08-05 10:05:33,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:05:33,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 124 transitions. [2019-08-05 10:05:33,523 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 124 transitions. Word has length 28 [2019-08-05 10:05:33,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:33,524 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 124 transitions. [2019-08-05 10:05:33,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:05:33,524 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 124 transitions. [2019-08-05 10:05:33,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:05:33,524 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:33,525 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:33,525 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:33,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:33,525 INFO L82 PathProgramCache]: Analyzing trace with hash -188703573, now seen corresponding path program 1 times [2019-08-05 10:05:33,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:33,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:05:33,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:33,589 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:33,640 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:05:33,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:33,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:05:33,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:05:33,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:05:33,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:05:33,641 INFO L87 Difference]: Start difference. First operand 81 states and 124 transitions. Second operand 7 states. [2019-08-05 10:05:34,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:34,068 INFO L93 Difference]: Finished difference Result 100 states and 154 transitions. [2019-08-05 10:05:34,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:05:34,068 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-08-05 10:05:34,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:34,069 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:05:34,070 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:05:34,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:05:34,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:05:34,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 87. [2019-08-05 10:05:34,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:05:34,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 134 transitions. [2019-08-05 10:05:34,074 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 134 transitions. Word has length 28 [2019-08-05 10:05:34,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:34,074 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 134 transitions. [2019-08-05 10:05:34,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:05:34,074 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 134 transitions. [2019-08-05 10:05:34,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:05:34,075 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:34,075 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:34,075 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:34,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:34,075 INFO L82 PathProgramCache]: Analyzing trace with hash 260027420, now seen corresponding path program 1 times [2019-08-05 10:05:34,076 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:34,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:05:34,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:34,550 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:05:34,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:34,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:05:34,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:05:34,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:05:34,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:05:34,551 INFO L87 Difference]: Start difference. First operand 87 states and 134 transitions. Second operand 6 states. [2019-08-05 10:05:34,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:34,760 INFO L93 Difference]: Finished difference Result 96 states and 147 transitions. [2019-08-05 10:05:34,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:05:34,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-08-05 10:05:34,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:34,761 INFO L225 Difference]: With dead ends: 96 [2019-08-05 10:05:34,761 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 10:05:34,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:05:34,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 10:05:34,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2019-08-05 10:05:34,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:05:34,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 142 transitions. [2019-08-05 10:05:34,765 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 142 transitions. Word has length 28 [2019-08-05 10:05:34,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:34,765 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 142 transitions. [2019-08-05 10:05:34,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:05:34,766 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 142 transitions. [2019-08-05 10:05:34,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:05:34,766 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:34,766 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:34,767 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:34,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:34,767 INFO L82 PathProgramCache]: Analyzing trace with hash 56254686, now seen corresponding path program 1 times [2019-08-05 10:05:34,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:34,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:05:34,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:34,875 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:34,876 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:34,877 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:34,879 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:34,880 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:35,073 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:05:35,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:35,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:05:35,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:05:35,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:05:35,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:05:35,075 INFO L87 Difference]: Start difference. First operand 93 states and 142 transitions. Second operand 11 states. [2019-08-05 10:05:35,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:35,841 INFO L93 Difference]: Finished difference Result 97 states and 147 transitions. [2019-08-05 10:05:35,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:05:35,841 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2019-08-05 10:05:35,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:35,842 INFO L225 Difference]: With dead ends: 97 [2019-08-05 10:05:35,843 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:05:35,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:05:35,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:05:35,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89. [2019-08-05 10:05:35,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:05:35,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 135 transitions. [2019-08-05 10:05:35,846 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 135 transitions. Word has length 29 [2019-08-05 10:05:35,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:35,846 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 135 transitions. [2019-08-05 10:05:35,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:05:35,847 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 135 transitions. [2019-08-05 10:05:35,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:05:35,847 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:35,847 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:35,848 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:35,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:35,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1890013918, now seen corresponding path program 1 times [2019-08-05 10:05:35,848 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:35,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:05:35,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:36,037 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:36,062 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:05:36,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:36,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:05:36,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:05:36,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:05:36,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:05:36,063 INFO L87 Difference]: Start difference. First operand 89 states and 135 transitions. Second operand 7 states. [2019-08-05 10:05:36,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:36,376 INFO L93 Difference]: Finished difference Result 86 states and 130 transitions. [2019-08-05 10:05:36,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:05:36,377 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-08-05 10:05:36,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:36,378 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:05:36,378 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:05:36,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:05:36,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:05:36,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:05:36,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:05:36,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 116 transitions. [2019-08-05 10:05:36,382 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 116 transitions. Word has length 29 [2019-08-05 10:05:36,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:36,382 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 116 transitions. [2019-08-05 10:05:36,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:05:36,383 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 116 transitions. [2019-08-05 10:05:36,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:05:36,383 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:36,383 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:36,383 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:36,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:36,384 INFO L82 PathProgramCache]: Analyzing trace with hash -862652403, now seen corresponding path program 1 times [2019-08-05 10:05:36,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:36,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:05:36,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:36,404 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:36,591 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 10:05:36,592 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:36,739 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:36,740 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:36,740 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:36,741 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:36,741 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:36,742 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:36,742 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:36,743 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:36,743 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:36,744 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:36,744 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:36,744 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:36,860 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:36,914 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:05:36,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:36,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:05:36,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:05:36,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:05:36,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:05:36,915 INFO L87 Difference]: Start difference. First operand 75 states and 116 transitions. Second operand 9 states. [2019-08-05 10:05:37,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:37,457 INFO L93 Difference]: Finished difference Result 68 states and 100 transitions. [2019-08-05 10:05:37,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:05:37,458 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-08-05 10:05:37,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:37,459 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:05:37,459 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:05:37,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:05:37,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:05:37,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-08-05 10:05:37,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:05:37,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2019-08-05 10:05:37,462 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 29 [2019-08-05 10:05:37,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:37,463 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2019-08-05 10:05:37,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:05:37,463 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2019-08-05 10:05:37,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:05:37,463 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:37,463 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:37,464 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:37,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:37,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1690414235, now seen corresponding path program 1 times [2019-08-05 10:05:37,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:37,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:37,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:05:37,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:37,603 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:05:37,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:37,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:05:37,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:05:37,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:05:37,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:05:37,604 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand 9 states. [2019-08-05 10:05:37,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:37,949 INFO L93 Difference]: Finished difference Result 56 states and 80 transitions. [2019-08-05 10:05:37,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:05:37,950 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-08-05 10:05:37,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:37,951 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:05:37,951 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:05:37,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:05:37,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:05:37,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2019-08-05 10:05:37,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:05:37,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 77 transitions. [2019-08-05 10:05:37,954 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 77 transitions. Word has length 33 [2019-08-05 10:05:37,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:37,954 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 77 transitions. [2019-08-05 10:05:37,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:05:37,955 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 77 transitions. [2019-08-05 10:05:37,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:05:37,955 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:37,955 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:37,956 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:37,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:37,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1012635073, now seen corresponding path program 1 times [2019-08-05 10:05:37,957 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:37,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:05:37,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:38,273 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:05:38,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:38,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:05:38,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:05:38,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:05:38,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:05:38,274 INFO L87 Difference]: Start difference. First operand 53 states and 77 transitions. Second operand 6 states. [2019-08-05 10:05:38,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:38,413 INFO L93 Difference]: Finished difference Result 29 states and 41 transitions. [2019-08-05 10:05:38,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:05:38,414 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-08-05 10:05:38,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:38,414 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:05:38,415 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:05:38,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:05:38,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:05:38,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:05:38,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:05:38,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:05:38,416 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2019-08-05 10:05:38,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:38,417 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:05:38,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:05:38,417 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:05:38,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:05:38,422 INFO L202 PluginConnector]: Adding new model RanFile063.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:05:38 BoogieIcfgContainer [2019-08-05 10:05:38,422 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:05:38,424 INFO L168 Benchmark]: Toolchain (without parser) took 35147.27 ms. Allocated memory was 141.6 MB in the beginning and 394.3 MB in the end (delta: 252.7 MB). Free memory was 110.3 MB in the beginning and 101.8 MB in the end (delta: 8.5 MB). Peak memory consumption was 261.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:05:38,424 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 141.6 MB. Free memory is still 112.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:05:38,425 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.21 ms. Allocated memory is still 141.6 MB. Free memory was 110.3 MB in the beginning and 108.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:05:38,426 INFO L168 Benchmark]: Boogie Preprocessor took 68.01 ms. Allocated memory is still 141.6 MB. Free memory was 108.2 MB in the beginning and 106.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:05:38,427 INFO L168 Benchmark]: RCFGBuilder took 1804.62 ms. Allocated memory was 141.6 MB in the beginning and 176.2 MB in the end (delta: 34.6 MB). Free memory was 106.6 MB in the beginning and 135.0 MB in the end (delta: -28.4 MB). Peak memory consumption was 51.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:05:38,427 INFO L168 Benchmark]: TraceAbstraction took 33213.64 ms. Allocated memory was 176.2 MB in the beginning and 394.3 MB in the end (delta: 218.1 MB). Free memory was 135.0 MB in the beginning and 101.8 MB in the end (delta: 33.2 MB). Peak memory consumption was 251.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:05:38,430 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.20 ms. Allocated memory is still 141.6 MB. Free memory is still 112.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 53.21 ms. Allocated memory is still 141.6 MB. Free memory was 110.3 MB in the beginning and 108.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 68.01 ms. Allocated memory is still 141.6 MB. Free memory was 108.2 MB in the beginning and 106.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1804.62 ms. Allocated memory was 141.6 MB in the beginning and 176.2 MB in the end (delta: 34.6 MB). Free memory was 106.6 MB in the beginning and 135.0 MB in the end (delta: -28.4 MB). Peak memory consumption was 51.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 33213.64 ms. Allocated memory was 176.2 MB in the beginning and 394.3 MB in the end (delta: 218.1 MB). Free memory was 135.0 MB in the beginning and 101.8 MB in the end (delta: 33.2 MB). Peak memory consumption was 251.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 220]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 222]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 221]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 38 locations, 3 error locations. SAFE Result, 33.1s OverallTime, 41 OverallIterations, 3 TraceHistogramMax, 21.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1980 SDtfs, 940 SDslu, 771 SDs, 0 SdLazy, 12136 SolverSat, 363 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1035 GetRequests, 715 SyntacticMatches, 9 SemanticMatches, 311 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 12.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=32, 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.1s AutomataMinimizationTime, 41 MinimizatonAttempts, 546 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 980 NumberOfCodeBlocks, 980 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 939 ConstructedInterpolants, 59 QuantifiedInterpolants, 162416 SizeOfPredicates, 157 NumberOfNonLiveVariables, 2591 ConjunctsInSsa, 377 ConjunctsInUnsatCore, 41 InterpolantComputations, 17 PerfectInterpolantSequences, 162/210 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...