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/RanFile089.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:04:20,885 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:04:20,887 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:04:20,899 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:04:20,899 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:04:20,900 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:04:20,902 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:04:20,904 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:04:20,906 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:04:20,907 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:04:20,908 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:04:20,908 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:04:20,908 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:04:20,909 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:04:20,911 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:04:20,912 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:04:20,913 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:04:20,915 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:04:20,917 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:04:20,920 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:04:20,922 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:04:20,923 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:04:20,924 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:04:20,927 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:04:20,935 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:04:20,936 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:04:20,936 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:04:20,937 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:04:20,938 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:04:20,942 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:04:20,942 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:04:20,943 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:04:20,946 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:04:20,947 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:04:20,950 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:04:20,950 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:04:20,951 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:04:20,951 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:04:20,951 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:04:20,956 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:04:20,958 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:04:20,991 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:04:21,003 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:04:21,007 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:04:21,009 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:04:21,009 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:04:21,010 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/random/RanFile089.bpl [2019-08-05 10:04:21,010 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/random/RanFile089.bpl' [2019-08-05 10:04:21,072 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:04:21,074 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:04:21,075 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:04:21,076 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:04:21,076 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:04:21,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "RanFile089.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:21" (1/1) ... [2019-08-05 10:04:21,118 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "RanFile089.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:21" (1/1) ... [2019-08-05 10:04:21,133 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:04:21,133 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:04:21,133 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:04:21,136 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:04:21,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:04:21,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:04:21,137 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:04:21,151 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "RanFile089.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:21" (1/1) ... [2019-08-05 10:04:21,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "RanFile089.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:21" (1/1) ... [2019-08-05 10:04:21,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "RanFile089.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:21" (1/1) ... [2019-08-05 10:04:21,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "RanFile089.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:21" (1/1) ... [2019-08-05 10:04:21,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "RanFile089.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:21" (1/1) ... [2019-08-05 10:04:21,196 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "RanFile089.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:21" (1/1) ... [2019-08-05 10:04:21,199 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "RanFile089.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:21" (1/1) ... [2019-08-05 10:04:21,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:04:21,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:04:21,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:04:21,215 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:04:21,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "RanFile089.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:21" (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:04:21,288 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:04:21,289 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:04:21,289 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:04:23,359 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:04:23,359 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:04:23,361 INFO L202 PluginConnector]: Adding new model RanFile089.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:04:23 BoogieIcfgContainer [2019-08-05 10:04:23,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:04:23,362 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:04:23,362 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:04:23,366 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:04:23,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RanFile089.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:21" (1/2) ... [2019-08-05 10:04:23,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dae6f2b and model type RanFile089.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:04:23, skipping insertion in model container [2019-08-05 10:04:23,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RanFile089.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:04:23" (2/2) ... [2019-08-05 10:04:23,370 INFO L109 eAbstractionObserver]: Analyzing ICFG RanFile089.bpl [2019-08-05 10:04:23,380 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:04:23,389 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-08-05 10:04:23,404 INFO L252 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-08-05 10:04:23,429 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:04:23,430 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:04:23,430 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:04:23,431 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:04:23,431 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:04:23,431 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:04:23,432 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:04:23,432 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:04:23,432 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:04:23,446 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2019-08-05 10:04:23,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:04:23,455 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:23,456 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] [2019-08-05 10:04:23,459 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:23,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:23,464 INFO L82 PathProgramCache]: Analyzing trace with hash 712955671, now seen corresponding path program 1 times [2019-08-05 10:04:23,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:23,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:23,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:04:23,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:24,194 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-08-05 10:04:24,246 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:04:24,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:24,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 10:04:24,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:04:24,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:04:24,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:04:24,278 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 6 states. [2019-08-05 10:04:25,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:25,215 INFO L93 Difference]: Finished difference Result 62 states and 110 transitions. [2019-08-05 10:04:25,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:04:25,223 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-08-05 10:04:25,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:25,234 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:04:25,235 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:04:25,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:04:25,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:04:25,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2019-08-05 10:04:25,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:04:25,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 101 transitions. [2019-08-05 10:04:25,284 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 101 transitions. Word has length 28 [2019-08-05 10:04:25,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:25,285 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 101 transitions. [2019-08-05 10:04:25,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:04:25,286 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 101 transitions. [2019-08-05 10:04:25,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:04:25,287 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:25,287 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:04:25,288 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:25,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:25,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1446388489, now seen corresponding path program 1 times [2019-08-05 10:04:25,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:25,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:04:25,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:25,615 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:04:25,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:25,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-08-05 10:04:25,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:04:25,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:04:25,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:04:25,619 INFO L87 Difference]: Start difference. First operand 56 states and 101 transitions. Second operand 9 states. [2019-08-05 10:04:27,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:27,229 INFO L93 Difference]: Finished difference Result 133 states and 239 transitions. [2019-08-05 10:04:27,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:04:27,230 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-08-05 10:04:27,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:27,234 INFO L225 Difference]: With dead ends: 133 [2019-08-05 10:04:27,234 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 10:04:27,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:04:27,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 10:04:27,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 82. [2019-08-05 10:04:27,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:04:27,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 148 transitions. [2019-08-05 10:04:27,249 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 148 transitions. Word has length 29 [2019-08-05 10:04:27,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:27,249 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 148 transitions. [2019-08-05 10:04:27,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:04:27,249 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 148 transitions. [2019-08-05 10:04:27,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:04:27,251 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:27,251 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:04:27,252 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:27,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:27,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1206387847, now seen corresponding path program 1 times [2019-08-05 10:04:27,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:27,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:04:27,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:27,402 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:04:27,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:27,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:04:27,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:04:27,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:04:27,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:04:27,404 INFO L87 Difference]: Start difference. First operand 82 states and 148 transitions. Second operand 3 states. [2019-08-05 10:04:27,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:27,632 INFO L93 Difference]: Finished difference Result 93 states and 168 transitions. [2019-08-05 10:04:27,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:04:27,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-08-05 10:04:27,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:27,636 INFO L225 Difference]: With dead ends: 93 [2019-08-05 10:04:27,636 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:04:27,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:04:27,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:04:27,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81. [2019-08-05 10:04:27,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:04:27,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 144 transitions. [2019-08-05 10:04:27,645 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 144 transitions. Word has length 29 [2019-08-05 10:04:27,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:27,645 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 144 transitions. [2019-08-05 10:04:27,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:04:27,646 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 144 transitions. [2019-08-05 10:04:27,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:04:27,647 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:27,647 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, 1] [2019-08-05 10:04:27,648 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:27,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:27,648 INFO L82 PathProgramCache]: Analyzing trace with hash 786701504, now seen corresponding path program 1 times [2019-08-05 10:04:27,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:27,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:04:27,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:28,071 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:04:28,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:28,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-08-05 10:04:28,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:04:28,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:04:28,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:04:28,073 INFO L87 Difference]: Start difference. First operand 81 states and 144 transitions. Second operand 8 states. [2019-08-05 10:04:30,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:30,929 INFO L93 Difference]: Finished difference Result 111 states and 197 transitions. [2019-08-05 10:04:30,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:04:30,930 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-08-05 10:04:30,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:30,932 INFO L225 Difference]: With dead ends: 111 [2019-08-05 10:04:30,932 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 10:04:30,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:04:30,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 10:04:30,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 92. [2019-08-05 10:04:30,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 10:04:30,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 162 transitions. [2019-08-05 10:04:30,941 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 162 transitions. Word has length 30 [2019-08-05 10:04:30,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:30,942 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 162 transitions. [2019-08-05 10:04:30,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:04:30,942 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 162 transitions. [2019-08-05 10:04:30,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:04:30,944 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:30,944 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, 1] [2019-08-05 10:04:30,944 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:30,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:30,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1707471108, now seen corresponding path program 1 times [2019-08-05 10:04:30,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:30,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:04:30,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:30,977 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:31,027 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:04:31,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:31,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:04:31,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:04:31,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:04:31,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:04:31,029 INFO L87 Difference]: Start difference. First operand 92 states and 162 transitions. Second operand 3 states. [2019-08-05 10:04:31,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:31,223 INFO L93 Difference]: Finished difference Result 143 states and 251 transitions. [2019-08-05 10:04:31,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:04:31,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-08-05 10:04:31,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:31,227 INFO L225 Difference]: With dead ends: 143 [2019-08-05 10:04:31,227 INFO L226 Difference]: Without dead ends: 132 [2019-08-05 10:04:31,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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:04:31,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-08-05 10:04:31,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 93. [2019-08-05 10:04:31,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:04:31,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 160 transitions. [2019-08-05 10:04:31,236 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 160 transitions. Word has length 30 [2019-08-05 10:04:31,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:31,237 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 160 transitions. [2019-08-05 10:04:31,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:04:31,237 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 160 transitions. [2019-08-05 10:04:31,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:04:31,239 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:31,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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:31,239 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:31,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:31,240 INFO L82 PathProgramCache]: Analyzing trace with hash -441028360, now seen corresponding path program 1 times [2019-08-05 10:04:31,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:31,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:31,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:04:31,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:31,398 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:04:31,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:31,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-08-05 10:04:31,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:04:31,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:04:31,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:04:31,400 INFO L87 Difference]: Start difference. First operand 93 states and 160 transitions. Second operand 8 states. [2019-08-05 10:04:31,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:31,895 INFO L93 Difference]: Finished difference Result 103 states and 175 transitions. [2019-08-05 10:04:31,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:04:31,895 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-08-05 10:04:31,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:31,897 INFO L225 Difference]: With dead ends: 103 [2019-08-05 10:04:31,897 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:04:31,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:04:31,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:04:31,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 10:04:31,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 10:04:31,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 169 transitions. [2019-08-05 10:04:31,904 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 169 transitions. Word has length 30 [2019-08-05 10:04:31,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:31,905 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 169 transitions. [2019-08-05 10:04:31,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:04:31,905 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 169 transitions. [2019-08-05 10:04:31,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:04:31,906 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:31,907 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, 1, 1] [2019-08-05 10:04:31,907 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:31,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:31,907 INFO L82 PathProgramCache]: Analyzing trace with hash 26365411, now seen corresponding path program 1 times [2019-08-05 10:04:31,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:31,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:04:31,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:31,963 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:32,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:32,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:32,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:04:32,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:04:32,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:04:32,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:04:32,108 INFO L87 Difference]: Start difference. First operand 98 states and 169 transitions. Second operand 7 states. [2019-08-05 10:04:33,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:33,012 INFO L93 Difference]: Finished difference Result 104 states and 179 transitions. [2019-08-05 10:04:33,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:04:33,013 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-08-05 10:04:33,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:33,014 INFO L225 Difference]: With dead ends: 104 [2019-08-05 10:04:33,014 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 10:04:33,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:04:33,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 10:04:33,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2019-08-05 10:04:33,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:04:33,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 171 transitions. [2019-08-05 10:04:33,021 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 171 transitions. Word has length 31 [2019-08-05 10:04:33,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:33,022 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 171 transitions. [2019-08-05 10:04:33,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:04:33,022 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 171 transitions. [2019-08-05 10:04:33,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:04:33,023 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:33,023 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, 1, 1] [2019-08-05 10:04:33,024 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:33,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:33,024 INFO L82 PathProgramCache]: Analyzing trace with hash 469371191, now seen corresponding path program 1 times [2019-08-05 10:04:33,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:33,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:04:33,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:33,279 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:04:33,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:33,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:04:33,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:04:33,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:04:33,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:04:33,281 INFO L87 Difference]: Start difference. First operand 99 states and 171 transitions. Second operand 5 states. [2019-08-05 10:04:34,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:34,024 INFO L93 Difference]: Finished difference Result 102 states and 176 transitions. [2019-08-05 10:04:34,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:04:34,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-08-05 10:04:34,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:34,026 INFO L225 Difference]: With dead ends: 102 [2019-08-05 10:04:34,027 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 10:04:34,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:04:34,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 10:04:34,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2019-08-05 10:04:34,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:04:34,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 170 transitions. [2019-08-05 10:04:34,045 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 170 transitions. Word has length 31 [2019-08-05 10:04:34,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:34,045 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 170 transitions. [2019-08-05 10:04:34,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:04:34,046 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 170 transitions. [2019-08-05 10:04:34,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:04:34,047 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:34,047 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, 1, 1] [2019-08-05 10:04:34,048 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:34,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:34,050 INFO L82 PathProgramCache]: Analyzing trace with hash -736684864, now seen corresponding path program 1 times [2019-08-05 10:04:34,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:34,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:04:34,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:34,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:04:34,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:34,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 10:04:34,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:04:34,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:04:34,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:04:34,204 INFO L87 Difference]: Start difference. First operand 99 states and 170 transitions. Second operand 6 states. [2019-08-05 10:04:34,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:34,595 INFO L93 Difference]: Finished difference Result 94 states and 161 transitions. [2019-08-05 10:04:34,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:04:34,596 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-08-05 10:04:34,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:34,597 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:04:34,597 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:04:34,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:04:34,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:04:34,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-08-05 10:04:34,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:04:34,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 153 transitions. [2019-08-05 10:04:34,602 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 153 transitions. Word has length 31 [2019-08-05 10:04:34,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:34,603 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 153 transitions. [2019-08-05 10:04:34,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:04:34,603 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 153 transitions. [2019-08-05 10:04:34,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:04:34,604 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:34,604 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, 1, 1] [2019-08-05 10:04:34,604 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:34,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:34,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1121105929, now seen corresponding path program 1 times [2019-08-05 10:04:34,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:34,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:34,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:04:34,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:34,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:34,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:34,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:04:34,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:04:34,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:04:34,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:04:34,994 INFO L87 Difference]: Start difference. First operand 88 states and 153 transitions. Second operand 9 states. [2019-08-05 10:04:35,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:35,518 INFO L93 Difference]: Finished difference Result 98 states and 170 transitions. [2019-08-05 10:04:35,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:04:35,519 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-08-05 10:04:35,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:35,520 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:04:35,520 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 10:04:35,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:04:35,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 10:04:35,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2019-08-05 10:04:35,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 10:04:35,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 157 transitions. [2019-08-05 10:04:35,525 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 157 transitions. Word has length 31 [2019-08-05 10:04:35,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:35,525 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 157 transitions. [2019-08-05 10:04:35,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:04:35,526 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 157 transitions. [2019-08-05 10:04:35,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:04:35,527 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:35,527 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, 1, 1, 1, 1, 1] [2019-08-05 10:04:35,527 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:35,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:35,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1630670424, now seen corresponding path program 2 times [2019-08-05 10:04:35,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:35,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:35,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:04:35,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:35,674 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 10:04:35,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:35,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:04:35,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:04:35,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:04:35,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:04:35,676 INFO L87 Difference]: Start difference. First operand 90 states and 157 transitions. Second operand 4 states. [2019-08-05 10:04:36,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:36,021 INFO L93 Difference]: Finished difference Result 85 states and 143 transitions. [2019-08-05 10:04:36,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:04:36,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-08-05 10:04:36,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:36,023 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:04:36,023 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:04:36,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 29 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:04:36,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:04:36,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 72. [2019-08-05 10:04:36,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:04:36,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 125 transitions. [2019-08-05 10:04:36,027 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 125 transitions. Word has length 32 [2019-08-05 10:04:36,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:36,028 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 125 transitions. [2019-08-05 10:04:36,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:04:36,028 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 125 transitions. [2019-08-05 10:04:36,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:04:36,028 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:36,029 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, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:36,029 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:36,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:36,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1709480360, now seen corresponding path program 1 times [2019-08-05 10:04:36,030 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:36,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:04:36,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:36,091 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:36,145 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:36,146 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:36,147 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:36,164 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:04:36,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:36,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:04:36,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:04:36,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:04:36,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:04:36,166 INFO L87 Difference]: Start difference. First operand 72 states and 125 transitions. Second operand 5 states. [2019-08-05 10:04:36,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:36,541 INFO L93 Difference]: Finished difference Result 86 states and 151 transitions. [2019-08-05 10:04:36,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:04:36,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-08-05 10:04:36,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:36,543 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:04:36,543 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:04:36,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:04:36,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:04:36,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 68. [2019-08-05 10:04:36,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:04:36,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 116 transitions. [2019-08-05 10:04:36,546 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 116 transitions. Word has length 34 [2019-08-05 10:04:36,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:36,547 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 116 transitions. [2019-08-05 10:04:36,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:04:36,547 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 116 transitions. [2019-08-05 10:04:36,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:04:36,547 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:36,548 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, 1, 1, 1, 1, 1] [2019-08-05 10:04:36,548 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:36,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:36,548 INFO L82 PathProgramCache]: Analyzing trace with hash 2001132862, now seen corresponding path program 1 times [2019-08-05 10:04:36,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:36,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:36,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:04:36,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:36,620 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:36,637 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:36,649 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:04:36,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:36,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:04:36,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:04:36,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:04:36,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:04:36,651 INFO L87 Difference]: Start difference. First operand 68 states and 116 transitions. Second operand 6 states. [2019-08-05 10:04:37,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:37,302 INFO L93 Difference]: Finished difference Result 112 states and 193 transitions. [2019-08-05 10:04:37,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:04:37,303 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-08-05 10:04:37,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:37,304 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:04:37,304 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 10:04:37,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:04:37,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 10:04:37,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2019-08-05 10:04:37,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 10:04:37,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 178 transitions. [2019-08-05 10:04:37,309 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 178 transitions. Word has length 34 [2019-08-05 10:04:37,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:37,310 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 178 transitions. [2019-08-05 10:04:37,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:04:37,310 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 178 transitions. [2019-08-05 10:04:37,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:04:37,311 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:37,311 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, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:37,311 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:37,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:37,312 INFO L82 PathProgramCache]: Analyzing trace with hash -202736872, now seen corresponding path program 1 times [2019-08-05 10:04:37,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:37,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:37,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:04:37,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:38,415 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-08-05 10:04:38,431 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:04:38,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:38,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:04:38,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:04:38,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:04:38,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:04:38,432 INFO L87 Difference]: Start difference. First operand 104 states and 178 transitions. Second operand 9 states. [2019-08-05 10:04:39,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:39,081 INFO L93 Difference]: Finished difference Result 112 states and 191 transitions. [2019-08-05 10:04:39,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:04:39,081 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-08-05 10:04:39,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:39,082 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:04:39,083 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 10:04:39,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:04:39,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 10:04:39,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2019-08-05 10:04:39,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:04:39,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 180 transitions. [2019-08-05 10:04:39,088 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 180 transitions. Word has length 34 [2019-08-05 10:04:39,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:39,088 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 180 transitions. [2019-08-05 10:04:39,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:04:39,088 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 180 transitions. [2019-08-05 10:04:39,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:04:39,089 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:39,089 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, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:39,090 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:39,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:39,090 INFO L82 PathProgramCache]: Analyzing trace with hash -621937890, now seen corresponding path program 1 times [2019-08-05 10:04:39,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:39,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:04:39,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:39,570 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:04:39,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:39,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-08-05 10:04:39,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:04:39,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:04:39,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:04:39,572 INFO L87 Difference]: Start difference. First operand 105 states and 180 transitions. Second operand 12 states. [2019-08-05 10:05:05,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:05,796 INFO L93 Difference]: Finished difference Result 142 states and 244 transitions. [2019-08-05 10:05:05,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:05:05,796 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2019-08-05 10:05:05,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:05,798 INFO L225 Difference]: With dead ends: 142 [2019-08-05 10:05:05,799 INFO L226 Difference]: Without dead ends: 142 [2019-08-05 10:05:05,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:05:05,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-08-05 10:05:05,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 127. [2019-08-05 10:05:05,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 10:05:05,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 217 transitions. [2019-08-05 10:05:05,804 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 217 transitions. Word has length 35 [2019-08-05 10:05:05,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:05,804 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 217 transitions. [2019-08-05 10:05:05,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:05:05,804 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 217 transitions. [2019-08-05 10:05:05,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:05:05,805 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:05,805 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, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:05,805 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:05,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:05,806 INFO L82 PathProgramCache]: Analyzing trace with hash -979775916, now seen corresponding path program 1 times [2019-08-05 10:05:05,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:05,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:05:05,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:05,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 10:05:05,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:05,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:05:05,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:05:05,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:05:05,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:05:05,891 INFO L87 Difference]: Start difference. First operand 127 states and 217 transitions. Second operand 5 states. [2019-08-05 10:05:06,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:06,358 INFO L93 Difference]: Finished difference Result 232 states and 375 transitions. [2019-08-05 10:05:06,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:05:06,359 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-08-05 10:05:06,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:06,361 INFO L225 Difference]: With dead ends: 232 [2019-08-05 10:05:06,361 INFO L226 Difference]: Without dead ends: 186 [2019-08-05 10:05:06,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:05:06,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-08-05 10:05:06,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 128. [2019-08-05 10:05:06,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-08-05 10:05:06,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 214 transitions. [2019-08-05 10:05:06,366 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 214 transitions. Word has length 35 [2019-08-05 10:05:06,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:06,366 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 214 transitions. [2019-08-05 10:05:06,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:05:06,367 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 214 transitions. [2019-08-05 10:05:06,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:05:06,367 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:06,367 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, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:06,368 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:06,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:06,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1528359860, now seen corresponding path program 1 times [2019-08-05 10:05:06,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:06,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:05:06,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:06,427 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-08-05 10:05:06,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:06,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:05:06,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:05:06,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:05:06,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:05:06,429 INFO L87 Difference]: Start difference. First operand 128 states and 214 transitions. Second operand 3 states. [2019-08-05 10:05:06,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:06,564 INFO L93 Difference]: Finished difference Result 129 states and 215 transitions. [2019-08-05 10:05:06,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:05:06,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-08-05 10:05:06,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:06,566 INFO L225 Difference]: With dead ends: 129 [2019-08-05 10:05:06,566 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 10:05:06,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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:06,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 10:05:06,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-08-05 10:05:06,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 10:05:06,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 210 transitions. [2019-08-05 10:05:06,571 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 210 transitions. Word has length 36 [2019-08-05 10:05:06,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:06,571 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 210 transitions. [2019-08-05 10:05:06,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:05:06,571 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 210 transitions. [2019-08-05 10:05:06,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:05:06,572 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:06,572 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, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:06,572 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:06,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:06,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1237681797, now seen corresponding path program 1 times [2019-08-05 10:05:06,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:06,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:06,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:05:06,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:06,778 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:05:06,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:06,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:05:06,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:05:06,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:05:06,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:05:06,779 INFO L87 Difference]: Start difference. First operand 127 states and 210 transitions. Second operand 10 states. [2019-08-05 10:05:07,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:07,795 INFO L93 Difference]: Finished difference Result 134 states and 220 transitions. [2019-08-05 10:05:07,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:05:07,796 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2019-08-05 10:05:07,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:07,797 INFO L225 Difference]: With dead ends: 134 [2019-08-05 10:05:07,797 INFO L226 Difference]: Without dead ends: 130 [2019-08-05 10:05:07,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:05:07,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-08-05 10:05:07,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2019-08-05 10:05:07,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-08-05 10:05:07,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 212 transitions. [2019-08-05 10:05:07,802 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 212 transitions. Word has length 36 [2019-08-05 10:05:07,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:07,802 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 212 transitions. [2019-08-05 10:05:07,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:05:07,803 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 212 transitions. [2019-08-05 10:05:07,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:05:07,803 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:07,803 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2019-08-05 10:05:07,804 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:07,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:07,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1328334893, now seen corresponding path program 1 times [2019-08-05 10:05:07,805 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:07,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:05:07,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:07,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:05:07,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:07,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:05:07,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:05:07,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:05:07,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:05:07,858 INFO L87 Difference]: Start difference. First operand 128 states and 212 transitions. Second operand 3 states. [2019-08-05 10:05:07,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:07,954 INFO L93 Difference]: Finished difference Result 112 states and 180 transitions. [2019-08-05 10:05:07,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:05:07,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-08-05 10:05:07,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:07,956 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:05:07,956 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 10:05:07,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 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:07,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 10:05:07,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-05 10:05:07,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:05:07,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 170 transitions. [2019-08-05 10:05:07,962 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 170 transitions. Word has length 37 [2019-08-05 10:05:07,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:07,962 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 170 transitions. [2019-08-05 10:05:07,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:05:07,962 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 170 transitions. [2019-08-05 10:05:07,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:05:07,963 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:07,963 INFO L399 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1] [2019-08-05 10:05:07,963 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:07,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:07,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1080394538, now seen corresponding path program 2 times [2019-08-05 10:05:07,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:08,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:05:08,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:08,559 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:05:08,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:08,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:05:08,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:05:08,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:05:08,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:05:08,561 INFO L87 Difference]: Start difference. First operand 105 states and 170 transitions. Second operand 11 states. [2019-08-05 10:05:09,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:09,449 INFO L93 Difference]: Finished difference Result 112 states and 180 transitions. [2019-08-05 10:05:09,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:05:09,449 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2019-08-05 10:05:09,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:09,450 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:05:09,451 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 10:05:09,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:05:09,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 10:05:09,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2019-08-05 10:05:09,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 10:05:09,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 172 transitions. [2019-08-05 10:05:09,455 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 172 transitions. Word has length 37 [2019-08-05 10:05:09,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:09,455 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 172 transitions. [2019-08-05 10:05:09,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:05:09,455 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 172 transitions. [2019-08-05 10:05:09,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:05:09,455 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:09,455 INFO L399 BasicCegarLoop]: trace histogram [5, 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, 1, 1, 1, 1] [2019-08-05 10:05:09,456 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:09,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:09,456 INFO L82 PathProgramCache]: Analyzing trace with hash 73683109, now seen corresponding path program 3 times [2019-08-05 10:05:09,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:09,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:05:09,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:09,752 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:09,755 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:10,149 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:05:10,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:10,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:05:10,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:05:10,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:05:10,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:05:10,152 INFO L87 Difference]: Start difference. First operand 106 states and 172 transitions. Second operand 16 states. [2019-08-05 10:05:54,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:54,969 INFO L93 Difference]: Finished difference Result 154 states and 247 transitions. [2019-08-05 10:05:54,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:05:54,969 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2019-08-05 10:05:54,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:54,970 INFO L225 Difference]: With dead ends: 154 [2019-08-05 10:05:54,971 INFO L226 Difference]: Without dead ends: 136 [2019-08-05 10:05:54,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=69, Invalid=391, Unknown=2, NotChecked=0, Total=462 [2019-08-05 10:05:54,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-08-05 10:05:54,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2019-08-05 10:05:54,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-08-05 10:05:54,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 213 transitions. [2019-08-05 10:05:54,976 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 213 transitions. Word has length 38 [2019-08-05 10:05:54,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:54,976 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 213 transitions. [2019-08-05 10:05:54,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:05:54,976 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 213 transitions. [2019-08-05 10:05:54,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:05:54,977 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:54,977 INFO L399 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1] [2019-08-05 10:05:54,977 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:54,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:54,978 INFO L82 PathProgramCache]: Analyzing trace with hash 886022473, now seen corresponding path program 1 times [2019-08-05 10:05:54,978 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:54,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:05:54,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:55,095 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:05:55,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:55,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:05:55,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:05:55,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:05:55,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:05:55,096 INFO L87 Difference]: Start difference. First operand 134 states and 213 transitions. Second operand 8 states. [2019-08-05 10:05:55,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:55,733 INFO L93 Difference]: Finished difference Result 138 states and 218 transitions. [2019-08-05 10:05:55,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:05:55,735 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-08-05 10:05:55,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:55,736 INFO L225 Difference]: With dead ends: 138 [2019-08-05 10:05:55,736 INFO L226 Difference]: Without dead ends: 136 [2019-08-05 10:05:55,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:05:55,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-08-05 10:05:55,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 132. [2019-08-05 10:05:55,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-08-05 10:05:55,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 209 transitions. [2019-08-05 10:05:55,739 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 209 transitions. Word has length 39 [2019-08-05 10:05:55,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:55,739 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 209 transitions. [2019-08-05 10:05:55,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:05:55,740 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 209 transitions. [2019-08-05 10:05:55,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:05:55,740 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:55,740 INFO L399 BasicCegarLoop]: trace histogram [5, 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, 1, 1, 1, 1] [2019-08-05 10:05:55,740 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:55,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:55,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1895045367, now seen corresponding path program 4 times [2019-08-05 10:05:55,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:55,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:05:55,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:56,304 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:56,393 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:05:56,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:56,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:05:56,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:05:56,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:05:56,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:05:56,394 INFO L87 Difference]: Start difference. First operand 132 states and 209 transitions. Second operand 14 states. [2019-08-05 10:06:01,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:01,197 INFO L93 Difference]: Finished difference Result 117 states and 187 transitions. [2019-08-05 10:06:01,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:06:01,198 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 39 [2019-08-05 10:06:01,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:01,199 INFO L225 Difference]: With dead ends: 117 [2019-08-05 10:06:01,199 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 10:06:01,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:06:01,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 10:06:01,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2019-08-05 10:06:01,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:06:01,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 170 transitions. [2019-08-05 10:06:01,202 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 170 transitions. Word has length 39 [2019-08-05 10:06:01,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:01,202 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 170 transitions. [2019-08-05 10:06:01,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:06:01,202 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 170 transitions. [2019-08-05 10:06:01,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:06:01,203 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:01,203 INFO L399 BasicCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1] [2019-08-05 10:06:01,203 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:01,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:01,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1490351798, now seen corresponding path program 5 times [2019-08-05 10:06:01,205 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:01,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:06:01,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:01,447 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:06:01,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:01,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:06:01,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:06:01,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:06:01,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:06:01,449 INFO L87 Difference]: Start difference. First operand 105 states and 170 transitions. Second operand 13 states. [2019-08-05 10:06:02,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:02,496 INFO L93 Difference]: Finished difference Result 112 states and 180 transitions. [2019-08-05 10:06:02,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:06:02,496 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2019-08-05 10:06:02,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:02,497 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:06:02,498 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 10:06:02,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:06:02,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 10:06:02,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2019-08-05 10:06:02,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 10:06:02,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 172 transitions. [2019-08-05 10:06:02,502 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 172 transitions. Word has length 39 [2019-08-05 10:06:02,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:02,502 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 172 transitions. [2019-08-05 10:06:02,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:06:02,502 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 172 transitions. [2019-08-05 10:06:02,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:06:02,503 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:02,503 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1] [2019-08-05 10:06:02,503 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:02,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:02,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1709665951, now seen corresponding path program 1 times [2019-08-05 10:06:02,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:02,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:06:02,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:02,587 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:06:02,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:02,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:06:02,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:06:02,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:06:02,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:06:02,589 INFO L87 Difference]: Start difference. First operand 106 states and 172 transitions. Second operand 5 states. [2019-08-05 10:06:03,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:03,707 INFO L93 Difference]: Finished difference Result 88 states and 143 transitions. [2019-08-05 10:06:03,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:06:03,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-08-05 10:06:03,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:03,708 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:06:03,708 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:06:03,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:06:03,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:06:03,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:06:03,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:06:03,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 121 transitions. [2019-08-05 10:06:03,712 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 121 transitions. Word has length 40 [2019-08-05 10:06:03,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:03,714 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 121 transitions. [2019-08-05 10:06:03,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:06:03,714 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 121 transitions. [2019-08-05 10:06:03,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:06:03,715 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:03,715 INFO L399 BasicCegarLoop]: trace histogram [7, 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, 1, 1, 1, 1] [2019-08-05 10:06:03,715 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:03,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:03,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1837559099, now seen corresponding path program 6 times [2019-08-05 10:06:03,716 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:03,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:06:03,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:04,269 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:06:04,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:04,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:06:04,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:06:04,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:06:04,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:06:04,270 INFO L87 Difference]: Start difference. First operand 78 states and 121 transitions. Second operand 14 states. [2019-08-05 10:06:05,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:05,379 INFO L93 Difference]: Finished difference Result 85 states and 130 transitions. [2019-08-05 10:06:05,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:06:05,379 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2019-08-05 10:06:05,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:05,381 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:06:05,381 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:06:05,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:06:05,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:06:05,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:06:05,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:06:05,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 122 transitions. [2019-08-05 10:06:05,384 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 122 transitions. Word has length 40 [2019-08-05 10:06:05,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:05,384 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 122 transitions. [2019-08-05 10:06:05,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:06:05,385 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 122 transitions. [2019-08-05 10:06:05,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:06:05,385 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:05,385 INFO L399 BasicCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1] [2019-08-05 10:06:05,386 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:05,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:05,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1923581802, now seen corresponding path program 7 times [2019-08-05 10:06:05,387 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:05,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:05,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:06:05,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:06,782 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:06:06,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:06,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:06:06,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:06:06,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:06:06,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:06:06,784 INFO L87 Difference]: Start difference. First operand 79 states and 122 transitions. Second operand 15 states. [2019-08-05 10:06:07,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:07,826 INFO L93 Difference]: Finished difference Result 86 states and 131 transitions. [2019-08-05 10:06:07,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:06:07,826 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2019-08-05 10:06:07,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:07,827 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:06:07,827 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:06:07,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:06:07,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:06:07,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:06:07,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:06:07,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 123 transitions. [2019-08-05 10:06:07,831 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 123 transitions. Word has length 41 [2019-08-05 10:06:07,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:07,831 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 123 transitions. [2019-08-05 10:06:07,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:06:07,832 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 123 transitions. [2019-08-05 10:06:07,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:06:07,832 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:07,832 INFO L399 BasicCegarLoop]: trace histogram [9, 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, 1, 1, 1, 1] [2019-08-05 10:06:07,833 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:07,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:07,833 INFO L82 PathProgramCache]: Analyzing trace with hash -295318299, now seen corresponding path program 8 times [2019-08-05 10:06:07,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:07,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:07,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:06:07,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:08,441 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:06:08,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:08,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:06:08,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:06:08,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:06:08,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:06:08,442 INFO L87 Difference]: Start difference. First operand 80 states and 123 transitions. Second operand 16 states. [2019-08-05 10:06:09,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:09,557 INFO L93 Difference]: Finished difference Result 87 states and 132 transitions. [2019-08-05 10:06:09,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:06:09,560 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2019-08-05 10:06:09,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:09,561 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:06:09,561 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:06:09,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:06:09,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:06:09,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:06:09,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:06:09,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 124 transitions. [2019-08-05 10:06:09,563 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 124 transitions. Word has length 42 [2019-08-05 10:06:09,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:09,564 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 124 transitions. [2019-08-05 10:06:09,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:06:09,564 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 124 transitions. [2019-08-05 10:06:09,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:06:09,565 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:09,565 INFO L399 BasicCegarLoop]: trace histogram [10, 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, 1, 1, 1, 1] [2019-08-05 10:06:09,565 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:09,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:09,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1358757258, now seen corresponding path program 9 times [2019-08-05 10:06:09,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:09,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:06:09,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:09,877 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:06:09,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:09,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:06:09,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:06:09,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:06:09,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:06:09,878 INFO L87 Difference]: Start difference. First operand 81 states and 124 transitions. Second operand 17 states. [2019-08-05 10:06:11,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:11,223 INFO L93 Difference]: Finished difference Result 88 states and 133 transitions. [2019-08-05 10:06:11,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:06:11,224 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 43 [2019-08-05 10:06:11,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:11,224 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:06:11,225 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:06:11,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:06:11,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:06:11,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:06:11,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:06:11,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 125 transitions. [2019-08-05 10:06:11,228 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 125 transitions. Word has length 43 [2019-08-05 10:06:11,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:11,229 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 125 transitions. [2019-08-05 10:06:11,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:06:11,229 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 125 transitions. [2019-08-05 10:06:11,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:06:11,229 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:11,230 INFO L399 BasicCegarLoop]: trace histogram [11, 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, 1, 1, 1, 1] [2019-08-05 10:06:11,230 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:11,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:11,230 INFO L82 PathProgramCache]: Analyzing trace with hash 34373381, now seen corresponding path program 10 times [2019-08-05 10:06:11,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:11,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:06:11,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:11,556 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:06:11,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:11,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:06:11,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:06:11,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:06:11,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:06:11,557 INFO L87 Difference]: Start difference. First operand 82 states and 125 transitions. Second operand 18 states. [2019-08-05 10:06:12,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:12,849 INFO L93 Difference]: Finished difference Result 89 states and 134 transitions. [2019-08-05 10:06:12,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:06:12,850 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 44 [2019-08-05 10:06:12,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:12,851 INFO L225 Difference]: With dead ends: 89 [2019-08-05 10:06:12,851 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:06:12,852 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:06:12,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:06:12,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:06:12,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:06:12,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 126 transitions. [2019-08-05 10:06:12,855 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 126 transitions. Word has length 44 [2019-08-05 10:06:12,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:12,855 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 126 transitions. [2019-08-05 10:06:12,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:06:12,855 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 126 transitions. [2019-08-05 10:06:12,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:06:12,856 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:12,856 INFO L399 BasicCegarLoop]: trace histogram [12, 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, 1, 1, 1, 1] [2019-08-05 10:06:12,856 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:12,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:12,856 INFO L82 PathProgramCache]: Analyzing trace with hash 271750230, now seen corresponding path program 11 times [2019-08-05 10:06:12,857 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:12,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:06:12,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:13,186 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:06:13,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:13,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:06:13,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:06:13,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:06:13,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:06:13,187 INFO L87 Difference]: Start difference. First operand 83 states and 126 transitions. Second operand 19 states. [2019-08-05 10:06:14,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:14,593 INFO L93 Difference]: Finished difference Result 90 states and 135 transitions. [2019-08-05 10:06:14,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:06:14,594 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2019-08-05 10:06:14,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:14,595 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:06:14,595 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:06:14,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:06:14,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:06:14,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:06:14,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:06:14,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 127 transitions. [2019-08-05 10:06:14,599 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 127 transitions. Word has length 45 [2019-08-05 10:06:14,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:14,600 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 127 transitions. [2019-08-05 10:06:14,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:06:14,600 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 127 transitions. [2019-08-05 10:06:14,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:06:14,600 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:14,600 INFO L399 BasicCegarLoop]: trace histogram [13, 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, 1, 1, 1, 1] [2019-08-05 10:06:14,601 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:14,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:14,601 INFO L82 PathProgramCache]: Analyzing trace with hash -959502043, now seen corresponding path program 12 times [2019-08-05 10:06:14,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:14,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:06:14,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:14,929 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:06:14,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:14,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:06:14,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:06:14,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:06:14,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:06:14,930 INFO L87 Difference]: Start difference. First operand 84 states and 127 transitions. Second operand 20 states. [2019-08-05 10:06:16,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:16,513 INFO L93 Difference]: Finished difference Result 91 states and 136 transitions. [2019-08-05 10:06:16,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:06:16,513 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 46 [2019-08-05 10:06:16,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:16,515 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:06:16,515 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:06:16,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:06:16,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:06:16,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:06:16,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:06:16,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 128 transitions. [2019-08-05 10:06:16,518 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 128 transitions. Word has length 46 [2019-08-05 10:06:16,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:16,519 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 128 transitions. [2019-08-05 10:06:16,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:06:16,519 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 128 transitions. [2019-08-05 10:06:16,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:06:16,519 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:16,520 INFO L399 BasicCegarLoop]: trace histogram [14, 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, 1, 1, 1, 1] [2019-08-05 10:06:16,520 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:16,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:16,520 INFO L82 PathProgramCache]: Analyzing trace with hash -473616842, now seen corresponding path program 13 times [2019-08-05 10:06:16,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:16,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:16,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:06:16,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:17,102 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:06:17,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:17,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:06:17,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:06:17,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:06:17,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:06:17,104 INFO L87 Difference]: Start difference. First operand 85 states and 128 transitions. Second operand 21 states. [2019-08-05 10:06:18,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:18,874 INFO L93 Difference]: Finished difference Result 92 states and 137 transitions. [2019-08-05 10:06:18,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:06:18,875 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 47 [2019-08-05 10:06:18,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:18,876 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:06:18,876 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:06:18,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:06:18,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:06:18,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 10:06:18,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:06:18,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 129 transitions. [2019-08-05 10:06:18,881 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 129 transitions. Word has length 47 [2019-08-05 10:06:18,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:18,881 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 129 transitions. [2019-08-05 10:06:18,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:06:18,881 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 129 transitions. [2019-08-05 10:06:18,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:06:18,882 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:18,882 INFO L399 BasicCegarLoop]: trace histogram [15, 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, 1, 1, 1, 1] [2019-08-05 10:06:18,882 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:18,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:18,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1703922501, now seen corresponding path program 14 times [2019-08-05 10:06:18,883 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:18,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:06:18,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:19,276 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:06:19,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:19,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:06:19,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:06:19,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:06:19,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:06:19,277 INFO L87 Difference]: Start difference. First operand 86 states and 129 transitions. Second operand 22 states. [2019-08-05 10:06:21,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:21,099 INFO L93 Difference]: Finished difference Result 93 states and 138 transitions. [2019-08-05 10:06:21,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:06:21,099 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2019-08-05 10:06:21,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:21,100 INFO L225 Difference]: With dead ends: 93 [2019-08-05 10:06:21,100 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:06:21,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:06:21,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:06:21,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 10:06:21,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:06:21,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 130 transitions. [2019-08-05 10:06:21,104 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 130 transitions. Word has length 48 [2019-08-05 10:06:21,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:21,104 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 130 transitions. [2019-08-05 10:06:21,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:06:21,104 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 130 transitions. [2019-08-05 10:06:21,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:06:21,105 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:21,105 INFO L399 BasicCegarLoop]: trace histogram [16, 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, 1, 1, 1, 1] [2019-08-05 10:06:21,105 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:21,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:21,105 INFO L82 PathProgramCache]: Analyzing trace with hash 488165398, now seen corresponding path program 15 times [2019-08-05 10:06:21,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:21,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:06:21,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:21,650 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:06:21,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:21,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:06:21,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:06:21,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:06:21,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:06:21,651 INFO L87 Difference]: Start difference. First operand 87 states and 130 transitions. Second operand 23 states. [2019-08-05 10:06:23,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:23,428 INFO L93 Difference]: Finished difference Result 94 states and 139 transitions. [2019-08-05 10:06:23,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:06:23,429 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 49 [2019-08-05 10:06:23,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:23,430 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:06:23,430 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:06:23,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:06:23,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:06:23,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 10:06:23,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:06:23,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 131 transitions. [2019-08-05 10:06:23,433 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 131 transitions. Word has length 49 [2019-08-05 10:06:23,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:23,434 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 131 transitions. [2019-08-05 10:06:23,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:06:23,434 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 131 transitions. [2019-08-05 10:06:23,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:06:23,434 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:23,434 INFO L399 BasicCegarLoop]: trace histogram [17, 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, 1, 1, 1, 1] [2019-08-05 10:06:23,435 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:23,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:23,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1454400869, now seen corresponding path program 16 times [2019-08-05 10:06:23,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:23,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:06:23,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:23,922 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:06:23,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:23,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:06:23,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:06:23,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:06:23,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:06:23,923 INFO L87 Difference]: Start difference. First operand 88 states and 131 transitions. Second operand 24 states. [2019-08-05 10:06:25,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:25,793 INFO L93 Difference]: Finished difference Result 95 states and 140 transitions. [2019-08-05 10:06:25,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:06:25,794 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2019-08-05 10:06:25,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:25,795 INFO L225 Difference]: With dead ends: 95 [2019-08-05 10:06:25,795 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 10:06:25,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=595, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:06:25,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 10:06:25,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 10:06:25,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:06:25,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 132 transitions. [2019-08-05 10:06:25,798 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 132 transitions. Word has length 50 [2019-08-05 10:06:25,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:25,799 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 132 transitions. [2019-08-05 10:06:25,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:06:25,799 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 132 transitions. [2019-08-05 10:06:25,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:06:25,799 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:25,799 INFO L399 BasicCegarLoop]: trace histogram [18, 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, 1, 1, 1, 1] [2019-08-05 10:06:25,799 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:25,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:25,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1342929398, now seen corresponding path program 17 times [2019-08-05 10:06:25,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:25,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:06:25,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:26,689 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:06:26,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:26,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:06:26,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:06:26,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:06:26,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:06:26,691 INFO L87 Difference]: Start difference. First operand 89 states and 132 transitions. Second operand 25 states. [2019-08-05 10:06:28,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:28,683 INFO L93 Difference]: Finished difference Result 96 states and 141 transitions. [2019-08-05 10:06:28,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:06:28,683 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 51 [2019-08-05 10:06:28,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:28,685 INFO L225 Difference]: With dead ends: 96 [2019-08-05 10:06:28,685 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:06:28,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=57, Invalid=645, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:06:28,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:06:28,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 10:06:28,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 10:06:28,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 133 transitions. [2019-08-05 10:06:28,688 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 133 transitions. Word has length 51 [2019-08-05 10:06:28,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:28,689 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 133 transitions. [2019-08-05 10:06:28,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:06:28,689 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 133 transitions. [2019-08-05 10:06:28,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:06:28,689 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:28,690 INFO L399 BasicCegarLoop]: trace histogram [19, 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, 1, 1, 1, 1] [2019-08-05 10:06:28,690 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:28,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:28,690 INFO L82 PathProgramCache]: Analyzing trace with hash -2112686203, now seen corresponding path program 18 times [2019-08-05 10:06:28,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:28,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:06:28,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:30,383 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 191 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:06:30,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:30,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:06:30,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:06:30,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:06:30,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:06:30,384 INFO L87 Difference]: Start difference. First operand 90 states and 133 transitions. Second operand 26 states. [2019-08-05 10:06:32,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:32,527 INFO L93 Difference]: Finished difference Result 97 states and 142 transitions. [2019-08-05 10:06:32,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:06:32,527 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 52 [2019-08-05 10:06:32,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:32,528 INFO L225 Difference]: With dead ends: 97 [2019-08-05 10:06:32,528 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:06:32,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=59, Invalid=697, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:06:32,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:06:32,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 10:06:32,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:06:32,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 134 transitions. [2019-08-05 10:06:32,532 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 134 transitions. Word has length 52 [2019-08-05 10:06:32,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:32,532 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 134 transitions. [2019-08-05 10:06:32,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:06:32,532 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 134 transitions. [2019-08-05 10:06:32,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:06:32,533 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:32,533 INFO L399 BasicCegarLoop]: trace histogram [20, 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, 1, 1, 1, 1] [2019-08-05 10:06:32,533 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:32,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:32,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1862587434, now seen corresponding path program 19 times [2019-08-05 10:06:32,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:32,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:06:32,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:33,089 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 211 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:06:33,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:33,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:06:33,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:06:33,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:06:33,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:06:33,091 INFO L87 Difference]: Start difference. First operand 91 states and 134 transitions. Second operand 27 states. [2019-08-05 10:06:35,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:35,331 INFO L93 Difference]: Finished difference Result 98 states and 143 transitions. [2019-08-05 10:06:35,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:06:35,332 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 53 [2019-08-05 10:06:35,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:35,333 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:06:35,333 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:06:35,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=751, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:06:35,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:06:35,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 10:06:35,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 10:06:35,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 135 transitions. [2019-08-05 10:06:35,336 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 135 transitions. Word has length 53 [2019-08-05 10:06:35,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:35,336 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 135 transitions. [2019-08-05 10:06:35,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:06:35,336 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 135 transitions. [2019-08-05 10:06:35,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:06:35,337 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:35,337 INFO L399 BasicCegarLoop]: trace histogram [21, 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, 1, 1, 1, 1] [2019-08-05 10:06:35,337 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:35,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:35,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1595507109, now seen corresponding path program 20 times [2019-08-05 10:06:35,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:35,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:35,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:06:35,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:35,953 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 232 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:06:35,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:35,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:06:35,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:06:35,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:06:35,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:06:35,954 INFO L87 Difference]: Start difference. First operand 92 states and 135 transitions. Second operand 28 states. [2019-08-05 10:06:38,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:38,406 INFO L93 Difference]: Finished difference Result 99 states and 144 transitions. [2019-08-05 10:06:38,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:06:38,406 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2019-08-05 10:06:38,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:38,407 INFO L225 Difference]: With dead ends: 99 [2019-08-05 10:06:38,407 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 10:06:38,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=807, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:06:38,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 10:06:38,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 10:06:38,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:06:38,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 136 transitions. [2019-08-05 10:06:38,411 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 136 transitions. Word has length 54 [2019-08-05 10:06:38,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:38,411 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 136 transitions. [2019-08-05 10:06:38,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:06:38,412 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 136 transitions. [2019-08-05 10:06:38,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:06:38,412 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:38,412 INFO L399 BasicCegarLoop]: trace histogram [22, 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, 1, 1, 1, 1] [2019-08-05 10:06:38,412 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:38,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:38,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1422255542, now seen corresponding path program 21 times [2019-08-05 10:06:38,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:38,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:06:38,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:39,321 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 254 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:06:39,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:39,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:06:39,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:06:39,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:06:39,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:06:39,323 INFO L87 Difference]: Start difference. First operand 93 states and 136 transitions. Second operand 29 states. [2019-08-05 10:06:41,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:41,938 INFO L93 Difference]: Finished difference Result 100 states and 145 transitions. [2019-08-05 10:06:41,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:06:41,938 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 55 [2019-08-05 10:06:41,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:41,939 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:06:41,939 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:06:41,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=65, Invalid=865, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:06:41,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:06:41,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-05 10:06:41,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 10:06:41,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 137 transitions. [2019-08-05 10:06:41,943 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 137 transitions. Word has length 55 [2019-08-05 10:06:41,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:41,943 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 137 transitions. [2019-08-05 10:06:41,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:06:41,943 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 137 transitions. [2019-08-05 10:06:41,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:06:41,943 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:41,944 INFO L399 BasicCegarLoop]: trace histogram [23, 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, 1, 1, 1, 1] [2019-08-05 10:06:41,944 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:41,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:41,944 INFO L82 PathProgramCache]: Analyzing trace with hash 346424261, now seen corresponding path program 22 times [2019-08-05 10:06:41,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:42,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:06:42,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:42,553 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 277 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:06:42,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:42,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:06:42,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:06:42,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:06:42,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:06:42,555 INFO L87 Difference]: Start difference. First operand 94 states and 137 transitions. Second operand 30 states. [2019-08-05 10:06:45,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:45,167 INFO L93 Difference]: Finished difference Result 101 states and 146 transitions. [2019-08-05 10:06:45,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:06:45,167 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2019-08-05 10:06:45,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:45,168 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:06:45,168 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 10:06:45,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=925, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:06:45,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 10:06:45,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-05 10:06:45,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:06:45,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 138 transitions. [2019-08-05 10:06:45,172 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 138 transitions. Word has length 56 [2019-08-05 10:06:45,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:45,172 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 138 transitions. [2019-08-05 10:06:45,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:06:45,172 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 138 transitions. [2019-08-05 10:06:45,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:06:45,173 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:45,173 INFO L399 BasicCegarLoop]: trace histogram [24, 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, 1, 1, 1, 1] [2019-08-05 10:06:45,173 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:45,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:45,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1355392918, now seen corresponding path program 23 times [2019-08-05 10:06:45,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:45,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:06:45,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:46,151 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:06:46,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:46,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:06:46,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:06:46,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:06:46,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:06:46,153 INFO L87 Difference]: Start difference. First operand 95 states and 138 transitions. Second operand 31 states. [2019-08-05 10:06:48,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:48,971 INFO L93 Difference]: Finished difference Result 102 states and 147 transitions. [2019-08-05 10:06:48,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:06:48,971 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 57 [2019-08-05 10:06:48,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:48,972 INFO L225 Difference]: With dead ends: 102 [2019-08-05 10:06:48,972 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 10:06:48,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=69, Invalid=987, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:06:48,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 10:06:48,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-05 10:06:48,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 10:06:48,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 139 transitions. [2019-08-05 10:06:48,976 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 139 transitions. Word has length 57 [2019-08-05 10:06:48,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:48,976 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 139 transitions. [2019-08-05 10:06:48,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:06:48,977 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 139 transitions. [2019-08-05 10:06:48,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:06:48,977 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:48,977 INFO L399 BasicCegarLoop]: trace histogram [25, 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, 1, 1, 1, 1] [2019-08-05 10:06:48,978 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:48,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:48,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1726317083, now seen corresponding path program 24 times [2019-08-05 10:06:48,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:49,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:49,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:06:49,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:49,836 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 0 proven. 326 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:06:49,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:49,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:06:49,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:06:49,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:06:49,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:06:49,837 INFO L87 Difference]: Start difference. First operand 96 states and 139 transitions. Second operand 32 states. [2019-08-05 10:06:52,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:52,823 INFO L93 Difference]: Finished difference Result 103 states and 148 transitions. [2019-08-05 10:06:52,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:06:52,823 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 58 [2019-08-05 10:06:52,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:52,824 INFO L225 Difference]: With dead ends: 103 [2019-08-05 10:06:52,824 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 10:06:52,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=1051, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:06:52,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 10:06:52,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-05 10:06:52,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:06:52,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 140 transitions. [2019-08-05 10:06:52,828 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 140 transitions. Word has length 58 [2019-08-05 10:06:52,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:52,828 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 140 transitions. [2019-08-05 10:06:52,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:06:52,828 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 140 transitions. [2019-08-05 10:06:52,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:06:52,829 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:52,829 INFO L399 BasicCegarLoop]: trace histogram [26, 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, 1, 1, 1, 1] [2019-08-05 10:06:52,829 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:52,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:52,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1524920694, now seen corresponding path program 25 times [2019-08-05 10:06:52,830 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:52,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:06:52,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:53,582 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:06:53,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:53,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:06:53,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:06:53,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:06:53,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:06:53,584 INFO L87 Difference]: Start difference. First operand 97 states and 140 transitions. Second operand 33 states. [2019-08-05 10:06:56,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:56,682 INFO L93 Difference]: Finished difference Result 104 states and 149 transitions. [2019-08-05 10:06:56,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:06:56,683 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 59 [2019-08-05 10:06:56,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:56,683 INFO L225 Difference]: With dead ends: 104 [2019-08-05 10:06:56,683 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:06:56,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=1117, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:06:56,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:06:56,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 10:06:56,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 10:06:56,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 141 transitions. [2019-08-05 10:06:56,686 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 141 transitions. Word has length 59 [2019-08-05 10:06:56,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:56,686 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 141 transitions. [2019-08-05 10:06:56,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:06:56,686 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 141 transitions. [2019-08-05 10:06:56,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:06:56,687 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:56,687 INFO L399 BasicCegarLoop]: trace histogram [27, 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, 1, 1, 1, 1] [2019-08-05 10:06:56,687 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:56,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:56,688 INFO L82 PathProgramCache]: Analyzing trace with hash -765923323, now seen corresponding path program 26 times [2019-08-05 10:06:56,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:56,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:06:56,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:58,452 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 379 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:06:58,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:58,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:06:58,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:06:58,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:06:58,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:06:58,455 INFO L87 Difference]: Start difference. First operand 98 states and 141 transitions. Second operand 34 states. [2019-08-05 10:07:02,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:02,082 INFO L93 Difference]: Finished difference Result 105 states and 150 transitions. [2019-08-05 10:07:02,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:07:02,083 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 60 [2019-08-05 10:07:02,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:02,084 INFO L225 Difference]: With dead ends: 105 [2019-08-05 10:07:02,084 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:07:02,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=75, Invalid=1185, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:07:02,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:07:02,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-05 10:07:02,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:07:02,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 142 transitions. [2019-08-05 10:07:02,088 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 142 transitions. Word has length 60 [2019-08-05 10:07:02,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:02,088 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 142 transitions. [2019-08-05 10:07:02,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:07:02,088 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 142 transitions. [2019-08-05 10:07:02,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:07:02,089 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:02,089 INFO L399 BasicCegarLoop]: trace histogram [28, 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, 1, 1, 1, 1] [2019-08-05 10:07:02,089 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:02,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:02,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1232356182, now seen corresponding path program 27 times [2019-08-05 10:07:02,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:02,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:02,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:07:02,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:03,927 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 0 proven. 407 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:07:03,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:03,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:07:03,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:07:03,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:07:03,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:07:03,928 INFO L87 Difference]: Start difference. First operand 99 states and 142 transitions. Second operand 35 states. [2019-08-05 10:07:07,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:07,296 INFO L93 Difference]: Finished difference Result 106 states and 151 transitions. [2019-08-05 10:07:07,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:07:07,297 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 61 [2019-08-05 10:07:07,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:07,298 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:07:07,298 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:07:07,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=77, Invalid=1255, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:07:07,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:07:07,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 10:07:07,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:07:07,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 143 transitions. [2019-08-05 10:07:07,300 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 143 transitions. Word has length 61 [2019-08-05 10:07:07,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:07,300 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 143 transitions. [2019-08-05 10:07:07,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:07:07,300 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 143 transitions. [2019-08-05 10:07:07,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:07:07,301 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:07,301 INFO L399 BasicCegarLoop]: trace histogram [29, 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, 1, 1, 1, 1] [2019-08-05 10:07:07,301 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:07,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:07,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1245488603, now seen corresponding path program 28 times [2019-08-05 10:07:07,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:07,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:07:07,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:08,443 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 0 proven. 436 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:07:08,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:08,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:07:08,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:07:08,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:07:08,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:07:08,444 INFO L87 Difference]: Start difference. First operand 100 states and 143 transitions. Second operand 36 states. [2019-08-05 10:07:11,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:11,773 INFO L93 Difference]: Finished difference Result 107 states and 152 transitions. [2019-08-05 10:07:11,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:07:11,774 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 62 [2019-08-05 10:07:11,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:11,775 INFO L225 Difference]: With dead ends: 107 [2019-08-05 10:07:11,775 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 10:07:11,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=79, Invalid=1327, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:07:11,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 10:07:11,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 10:07:11,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:07:11,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 144 transitions. [2019-08-05 10:07:11,779 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 144 transitions. Word has length 62 [2019-08-05 10:07:11,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:11,779 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 144 transitions. [2019-08-05 10:07:11,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:07:11,779 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 144 transitions. [2019-08-05 10:07:11,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:07:11,780 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:11,780 INFO L399 BasicCegarLoop]: trace histogram [30, 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, 1, 1, 1, 1] [2019-08-05 10:07:11,780 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:11,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:11,781 INFO L82 PathProgramCache]: Analyzing trace with hash -749265610, now seen corresponding path program 29 times [2019-08-05 10:07:11,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:11,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:07:11,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:12,995 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 466 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:07:12,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:12,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:07:12,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:07:12,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:07:12,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:07:12,997 INFO L87 Difference]: Start difference. First operand 101 states and 144 transitions. Second operand 37 states. [2019-08-05 10:07:16,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:16,437 INFO L93 Difference]: Finished difference Result 108 states and 153 transitions. [2019-08-05 10:07:16,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:07:16,437 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 63 [2019-08-05 10:07:16,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:16,439 INFO L225 Difference]: With dead ends: 108 [2019-08-05 10:07:16,439 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 10:07:16,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=81, Invalid=1401, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:07:16,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 10:07:16,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-08-05 10:07:16,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:07:16,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 145 transitions. [2019-08-05 10:07:16,442 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 145 transitions. Word has length 63 [2019-08-05 10:07:16,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:16,442 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 145 transitions. [2019-08-05 10:07:16,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:07:16,442 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 145 transitions. [2019-08-05 10:07:16,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:07:16,442 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:16,443 INFO L399 BasicCegarLoop]: trace histogram [31, 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, 1, 1, 1, 1] [2019-08-05 10:07:16,443 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:16,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:16,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1748745285, now seen corresponding path program 30 times [2019-08-05 10:07:16,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:16,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:07:16,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:17,810 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:07:17,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:17,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:07:17,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:07:17,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:07:17,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:07:17,812 INFO L87 Difference]: Start difference. First operand 102 states and 145 transitions. Second operand 38 states. [2019-08-05 10:07:21,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:21,582 INFO L93 Difference]: Finished difference Result 109 states and 154 transitions. [2019-08-05 10:07:21,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:07:21,583 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 64 [2019-08-05 10:07:21,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:21,584 INFO L225 Difference]: With dead ends: 109 [2019-08-05 10:07:21,584 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 10:07:21,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=83, Invalid=1477, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:07:21,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 10:07:21,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-05 10:07:21,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 10:07:21,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 146 transitions. [2019-08-05 10:07:21,587 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 146 transitions. Word has length 64 [2019-08-05 10:07:21,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:21,588 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 146 transitions. [2019-08-05 10:07:21,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:07:21,588 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 146 transitions. [2019-08-05 10:07:21,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:07:21,588 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:21,588 INFO L399 BasicCegarLoop]: trace histogram [32, 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, 1, 1, 1, 1] [2019-08-05 10:07:21,589 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:21,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:21,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1877671702, now seen corresponding path program 31 times [2019-08-05 10:07:21,590 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:21,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:07:21,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:22,921 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:07:22,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:22,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:07:22,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:07:22,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:07:22,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:07:22,923 INFO L87 Difference]: Start difference. First operand 103 states and 146 transitions. Second operand 39 states. [2019-08-05 10:07:26,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:26,680 INFO L93 Difference]: Finished difference Result 110 states and 155 transitions. [2019-08-05 10:07:26,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:07:26,681 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 65 [2019-08-05 10:07:26,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:26,682 INFO L225 Difference]: With dead ends: 110 [2019-08-05 10:07:26,682 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 10:07:26,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=85, Invalid=1555, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:07:26,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 10:07:26,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-08-05 10:07:26,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 10:07:26,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 147 transitions. [2019-08-05 10:07:26,686 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 147 transitions. Word has length 65 [2019-08-05 10:07:26,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:26,686 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 147 transitions. [2019-08-05 10:07:26,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:07:26,687 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 147 transitions. [2019-08-05 10:07:26,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:07:26,687 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:26,687 INFO L399 BasicCegarLoop]: trace histogram [33, 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, 1, 1, 1, 1] [2019-08-05 10:07:26,687 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:26,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:26,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1579423333, now seen corresponding path program 32 times [2019-08-05 10:07:26,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:26,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:07:26,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:28,149 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 0 proven. 562 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:07:28,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:28,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:07:28,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:07:28,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:07:28,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:07:28,150 INFO L87 Difference]: Start difference. First operand 104 states and 147 transitions. Second operand 40 states. [2019-08-05 10:07:32,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:32,066 INFO L93 Difference]: Finished difference Result 111 states and 156 transitions. [2019-08-05 10:07:32,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:07:32,067 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 66 [2019-08-05 10:07:32,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:32,068 INFO L225 Difference]: With dead ends: 111 [2019-08-05 10:07:32,068 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 10:07:32,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=87, Invalid=1635, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:07:32,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 10:07:32,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-05 10:07:32,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:07:32,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 148 transitions. [2019-08-05 10:07:32,072 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 148 transitions. Word has length 66 [2019-08-05 10:07:32,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:32,072 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 148 transitions. [2019-08-05 10:07:32,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:07:32,072 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 148 transitions. [2019-08-05 10:07:32,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:07:32,072 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:32,073 INFO L399 BasicCegarLoop]: trace histogram [34, 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, 1, 1, 1, 1] [2019-08-05 10:07:32,073 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:32,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:32,073 INFO L82 PathProgramCache]: Analyzing trace with hash 923658486, now seen corresponding path program 33 times [2019-08-05 10:07:32,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:32,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:07:32,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:33,477 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 0 proven. 596 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:07:33,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:33,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:07:33,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:07:33,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:07:33,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:07:33,479 INFO L87 Difference]: Start difference. First operand 105 states and 148 transitions. Second operand 41 states. [2019-08-05 10:07:37,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:37,540 INFO L93 Difference]: Finished difference Result 112 states and 157 transitions. [2019-08-05 10:07:37,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:07:37,541 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 67 [2019-08-05 10:07:37,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:37,542 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:07:37,542 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 10:07:37,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=89, Invalid=1717, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:07:37,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 10:07:37,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-08-05 10:07:37,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 10:07:37,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 149 transitions. [2019-08-05 10:07:37,545 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 149 transitions. Word has length 67 [2019-08-05 10:07:37,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:37,545 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 149 transitions. [2019-08-05 10:07:37,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:07:37,546 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 149 transitions. [2019-08-05 10:07:37,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:07:37,546 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:37,546 INFO L399 BasicCegarLoop]: trace histogram [35, 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, 1, 1, 1, 1] [2019-08-05 10:07:37,547 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:37,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:37,547 INFO L82 PathProgramCache]: Analyzing trace with hash 2069784709, now seen corresponding path program 34 times [2019-08-05 10:07:37,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:37,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:07:37,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:38,840 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 0 proven. 631 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:07:38,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:38,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:07:38,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:07:38,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:07:38,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:07:38,841 INFO L87 Difference]: Start difference. First operand 106 states and 149 transitions. Second operand 42 states. [2019-08-05 10:07:43,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:43,091 INFO L93 Difference]: Finished difference Result 113 states and 158 transitions. [2019-08-05 10:07:43,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:07:43,092 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 68 [2019-08-05 10:07:43,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:43,093 INFO L225 Difference]: With dead ends: 113 [2019-08-05 10:07:43,093 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 10:07:43,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=91, Invalid=1801, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:07:43,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 10:07:43,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-05 10:07:43,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 10:07:43,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 150 transitions. [2019-08-05 10:07:43,096 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 150 transitions. Word has length 68 [2019-08-05 10:07:43,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:43,096 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 150 transitions. [2019-08-05 10:07:43,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:07:43,097 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 150 transitions. [2019-08-05 10:07:43,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:07:43,097 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:43,097 INFO L399 BasicCegarLoop]: trace histogram [36, 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, 1, 1, 1, 1] [2019-08-05 10:07:43,098 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:43,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:43,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1055008042, now seen corresponding path program 35 times [2019-08-05 10:07:43,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:43,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:43,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:07:43,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:44,302 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 0 proven. 667 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:07:44,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:44,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:07:44,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:07:44,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:07:44,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:07:44,303 INFO L87 Difference]: Start difference. First operand 107 states and 150 transitions. Second operand 43 states. [2019-08-05 10:07:48,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:48,778 INFO L93 Difference]: Finished difference Result 114 states and 159 transitions. [2019-08-05 10:07:48,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:07:48,779 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 69 [2019-08-05 10:07:48,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:48,780 INFO L225 Difference]: With dead ends: 114 [2019-08-05 10:07:48,780 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 10:07:48,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=93, Invalid=1887, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:07:48,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 10:07:48,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-08-05 10:07:48,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 10:07:48,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 151 transitions. [2019-08-05 10:07:48,784 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 151 transitions. Word has length 69 [2019-08-05 10:07:48,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:48,784 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 151 transitions. [2019-08-05 10:07:48,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:07:48,784 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 151 transitions. [2019-08-05 10:07:48,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:07:48,784 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:48,784 INFO L399 BasicCegarLoop]: trace histogram [37, 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, 1, 1, 1, 1] [2019-08-05 10:07:48,785 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:48,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:48,785 INFO L82 PathProgramCache]: Analyzing trace with hash 860664485, now seen corresponding path program 36 times [2019-08-05 10:07:48,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:48,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:07:48,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:50,033 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 0 proven. 704 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:07:50,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:50,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:07:50,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:07:50,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:07:50,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:07:50,034 INFO L87 Difference]: Start difference. First operand 108 states and 151 transitions. Second operand 44 states. [2019-08-05 10:07:55,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:55,129 INFO L93 Difference]: Finished difference Result 115 states and 160 transitions. [2019-08-05 10:07:55,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:07:55,129 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 70 [2019-08-05 10:07:55,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:55,131 INFO L225 Difference]: With dead ends: 115 [2019-08-05 10:07:55,131 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 10:07:55,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=95, Invalid=1975, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:07:55,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 10:07:55,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-05 10:07:55,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 10:07:55,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 152 transitions. [2019-08-05 10:07:55,134 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 152 transitions. Word has length 70 [2019-08-05 10:07:55,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:55,135 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 152 transitions. [2019-08-05 10:07:55,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:07:55,135 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 152 transitions. [2019-08-05 10:07:55,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:07:55,135 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:55,136 INFO L399 BasicCegarLoop]: trace histogram [38, 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, 1, 1, 1, 1] [2019-08-05 10:07:55,136 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:55,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:55,136 INFO L82 PathProgramCache]: Analyzing trace with hash 116970678, now seen corresponding path program 37 times [2019-08-05 10:07:55,137 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:55,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:07:55,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:56,495 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 0 proven. 742 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:07:56,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:56,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:07:56,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:07:56,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:07:56,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:07:56,496 INFO L87 Difference]: Start difference. First operand 109 states and 152 transitions. Second operand 45 states. [2019-08-05 10:08:01,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:01,225 INFO L93 Difference]: Finished difference Result 116 states and 161 transitions. [2019-08-05 10:08:01,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:08:01,225 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 71 [2019-08-05 10:08:01,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:01,226 INFO L225 Difference]: With dead ends: 116 [2019-08-05 10:08:01,226 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 10:08:01,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=97, Invalid=2065, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:08:01,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 10:08:01,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-08-05 10:08:01,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 10:08:01,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 153 transitions. [2019-08-05 10:08:01,229 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 153 transitions. Word has length 71 [2019-08-05 10:08:01,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:01,229 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 153 transitions. [2019-08-05 10:08:01,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:08:01,230 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 153 transitions. [2019-08-05 10:08:01,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:08:01,230 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:01,230 INFO L399 BasicCegarLoop]: trace histogram [39, 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, 1, 1, 1, 1] [2019-08-05 10:08:01,230 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:01,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:01,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1462700859, now seen corresponding path program 38 times [2019-08-05 10:08:01,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:01,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:08:01,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:02,578 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 0 proven. 781 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:08:02,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:02,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:08:02,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:08:02,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:08:02,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:08:02,579 INFO L87 Difference]: Start difference. First operand 110 states and 153 transitions. Second operand 46 states. [2019-08-05 10:08:07,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:07,500 INFO L93 Difference]: Finished difference Result 117 states and 162 transitions. [2019-08-05 10:08:07,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:08:07,501 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 72 [2019-08-05 10:08:07,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:07,501 INFO L225 Difference]: With dead ends: 117 [2019-08-05 10:08:07,502 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 10:08:07,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=99, Invalid=2157, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:08:07,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 10:08:07,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-08-05 10:08:07,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 10:08:07,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 154 transitions. [2019-08-05 10:08:07,505 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 154 transitions. Word has length 72 [2019-08-05 10:08:07,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:07,505 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 154 transitions. [2019-08-05 10:08:07,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:08:07,506 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 154 transitions. [2019-08-05 10:08:07,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:08:07,506 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:07,506 INFO L399 BasicCegarLoop]: trace histogram [40, 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, 1, 1, 1, 1] [2019-08-05 10:08:07,507 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:07,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:07,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1107089046, now seen corresponding path program 39 times [2019-08-05 10:08:07,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:07,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:08:07,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:09,135 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 0 proven. 821 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:08:09,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:09,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:08:09,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:08:09,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:08:09,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:08:09,136 INFO L87 Difference]: Start difference. First operand 111 states and 154 transitions. Second operand 47 states. [2019-08-05 10:08:14,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:14,199 INFO L93 Difference]: Finished difference Result 118 states and 163 transitions. [2019-08-05 10:08:14,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:08:14,200 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 73 [2019-08-05 10:08:14,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:14,201 INFO L225 Difference]: With dead ends: 118 [2019-08-05 10:08:14,201 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 10:08:14,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=101, Invalid=2251, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:08:14,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 10:08:14,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-08-05 10:08:14,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 10:08:14,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 155 transitions. [2019-08-05 10:08:14,204 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 155 transitions. Word has length 73 [2019-08-05 10:08:14,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:14,204 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 155 transitions. [2019-08-05 10:08:14,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:08:14,205 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 155 transitions. [2019-08-05 10:08:14,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:08:14,205 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:14,205 INFO L399 BasicCegarLoop]: trace histogram [41, 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, 1, 1, 1, 1] [2019-08-05 10:08:14,206 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:14,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:14,206 INFO L82 PathProgramCache]: Analyzing trace with hash -833802523, now seen corresponding path program 40 times [2019-08-05 10:08:14,207 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:14,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:08:14,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:15,634 INFO L134 CoverageAnalysis]: Checked inductivity of 864 backedges. 0 proven. 862 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:08:15,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:15,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:08:15,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:08:15,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:08:15,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:08:15,636 INFO L87 Difference]: Start difference. First operand 112 states and 155 transitions. Second operand 48 states. [2019-08-05 10:08:21,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:21,015 INFO L93 Difference]: Finished difference Result 119 states and 164 transitions. [2019-08-05 10:08:21,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:08:21,016 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 74 [2019-08-05 10:08:21,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:21,017 INFO L225 Difference]: With dead ends: 119 [2019-08-05 10:08:21,017 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 10:08:21,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=103, Invalid=2347, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:08:21,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 10:08:21,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-08-05 10:08:21,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 10:08:21,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 156 transitions. [2019-08-05 10:08:21,020 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 156 transitions. Word has length 74 [2019-08-05 10:08:21,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:21,020 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 156 transitions. [2019-08-05 10:08:21,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:08:21,020 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 156 transitions. [2019-08-05 10:08:21,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:08:21,021 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:21,021 INFO L399 BasicCegarLoop]: trace histogram [42, 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, 1, 1, 1, 1] [2019-08-05 10:08:21,021 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:21,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:21,022 INFO L82 PathProgramCache]: Analyzing trace with hash -871899018, now seen corresponding path program 41 times [2019-08-05 10:08:21,022 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:21,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:08:21,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:22,516 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 904 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:08:22,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:22,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:08:22,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:08:22,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:08:22,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:08:22,517 INFO L87 Difference]: Start difference. First operand 113 states and 156 transitions. Second operand 49 states. [2019-08-05 10:08:27,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:27,974 INFO L93 Difference]: Finished difference Result 120 states and 165 transitions. [2019-08-05 10:08:27,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:08:27,975 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 75 [2019-08-05 10:08:27,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:27,976 INFO L225 Difference]: With dead ends: 120 [2019-08-05 10:08:27,976 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 10:08:27,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=105, Invalid=2445, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:08:27,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 10:08:27,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-08-05 10:08:27,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 10:08:27,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 157 transitions. [2019-08-05 10:08:27,980 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 157 transitions. Word has length 75 [2019-08-05 10:08:27,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:27,980 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 157 transitions. [2019-08-05 10:08:27,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:08:27,980 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 157 transitions. [2019-08-05 10:08:27,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:08:27,981 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:27,981 INFO L399 BasicCegarLoop]: trace histogram [43, 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, 1, 1, 1, 1] [2019-08-05 10:08:27,981 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:27,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:27,981 INFO L82 PathProgramCache]: Analyzing trace with hash -2052890363, now seen corresponding path program 42 times [2019-08-05 10:08:27,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:28,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:28,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:08:28,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:29,797 INFO L134 CoverageAnalysis]: Checked inductivity of 949 backedges. 0 proven. 947 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:08:29,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:29,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:08:29,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:08:29,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:08:29,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:08:29,798 INFO L87 Difference]: Start difference. First operand 114 states and 157 transitions. Second operand 50 states. [2019-08-05 10:08:35,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:35,493 INFO L93 Difference]: Finished difference Result 121 states and 166 transitions. [2019-08-05 10:08:35,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:08:35,494 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 76 [2019-08-05 10:08:35,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:35,495 INFO L225 Difference]: With dead ends: 121 [2019-08-05 10:08:35,495 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 10:08:35,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=107, Invalid=2545, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:08:35,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 10:08:35,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-08-05 10:08:35,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 10:08:35,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 158 transitions. [2019-08-05 10:08:35,498 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 158 transitions. Word has length 76 [2019-08-05 10:08:35,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:35,498 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 158 transitions. [2019-08-05 10:08:35,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:08:35,498 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 158 transitions. [2019-08-05 10:08:35,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:08:35,499 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:35,499 INFO L399 BasicCegarLoop]: trace histogram [44, 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, 1, 1, 1, 1] [2019-08-05 10:08:35,499 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:35,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:35,499 INFO L82 PathProgramCache]: Analyzing trace with hash -8916394, now seen corresponding path program 43 times [2019-08-05 10:08:35,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:35,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:35,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:08:35,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:37,211 INFO L134 CoverageAnalysis]: Checked inductivity of 993 backedges. 0 proven. 991 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:08:37,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:37,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:08:37,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:08:37,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:08:37,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:08:37,213 INFO L87 Difference]: Start difference. First operand 115 states and 158 transitions. Second operand 51 states. Received shutdown request... [2019-08-05 10:08:39,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:08:39,376 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:08:39,382 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:08:39,382 INFO L202 PluginConnector]: Adding new model RanFile089.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:08:39 BoogieIcfgContainer [2019-08-05 10:08:39,382 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:08:39,383 INFO L168 Benchmark]: Toolchain (without parser) took 258310.00 ms. Allocated memory was 138.4 MB in the beginning and 354.9 MB in the end (delta: 216.5 MB). Free memory was 106.8 MB in the beginning and 199.4 MB in the end (delta: -92.6 MB). Peak memory consumption was 123.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:08:39,384 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 138.4 MB. Free memory was 109.1 MB in the beginning and 108.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:08:39,386 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.73 ms. Allocated memory is still 138.4 MB. Free memory was 106.8 MB in the beginning and 104.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:08:39,386 INFO L168 Benchmark]: Boogie Preprocessor took 77.43 ms. Allocated memory is still 138.4 MB. Free memory was 104.9 MB in the beginning and 102.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:08:39,387 INFO L168 Benchmark]: RCFGBuilder took 2146.15 ms. Allocated memory was 138.4 MB in the beginning and 179.3 MB in the end (delta: 40.9 MB). Free memory was 102.7 MB in the beginning and 127.1 MB in the end (delta: -24.4 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:08:39,388 INFO L168 Benchmark]: TraceAbstraction took 256019.80 ms. Allocated memory was 179.3 MB in the beginning and 354.9 MB in the end (delta: 175.6 MB). Free memory was 127.1 MB in the beginning and 199.4 MB in the end (delta: -72.3 MB). Peak memory consumption was 103.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:08:39,391 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.21 ms. Allocated memory is still 138.4 MB. Free memory was 109.1 MB in the beginning and 108.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.73 ms. Allocated memory is still 138.4 MB. Free memory was 106.8 MB in the beginning and 104.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 77.43 ms. Allocated memory is still 138.4 MB. Free memory was 104.9 MB in the beginning and 102.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2146.15 ms. Allocated memory was 138.4 MB in the beginning and 179.3 MB in the end (delta: 40.9 MB). Free memory was 102.7 MB in the beginning and 127.1 MB in the end (delta: -24.4 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 256019.80 ms. Allocated memory was 179.3 MB in the beginning and 354.9 MB in the end (delta: 175.6 MB). Free memory was 127.1 MB in the beginning and 199.4 MB in the end (delta: -72.3 MB). Peak memory consumption was 103.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 285]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 285). Cancelled while BasicCegarLoop was constructing difference of abstraction (115states) and FLOYD_HOARE automaton (currently 26 states, 51 states before enhancement),while ReachableStatesComputation was computing reachable states (35 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 283]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 283). Cancelled while BasicCegarLoop was constructing difference of abstraction (115states) and FLOYD_HOARE automaton (currently 26 states, 51 states before enhancement),while ReachableStatesComputation was computing reachable states (35 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 284]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 284). Cancelled while BasicCegarLoop was constructing difference of abstraction (115states) and FLOYD_HOARE automaton (currently 26 states, 51 states before enhancement),while ReachableStatesComputation was computing reachable states (35 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 54 locations, 3 error locations. TIMEOUT Result, 255.9s OverallTime, 63 OverallIterations, 44 TraceHistogramMax, 207.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4640 SDtfs, 918 SDslu, 6949 SDs, 0 SdLazy, 131834 SolverSat, 354 SolverUnsat, 17 SolverUnknown, 0 SolverNotchecked, 181.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3125 GetRequests, 1698 SyntacticMatches, 11 SemanticMatches, 1416 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 49.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 62 MinimizatonAttempts, 250 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 3.9s SatisfiabilityAnalysisTime, 43.3s InterpolantComputationTime, 3068 NumberOfCodeBlocks, 3068 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 3005 ConstructedInterpolants, 515 QuantifiedInterpolants, 1267934 SizeOfPredicates, 312 NumberOfNonLiveVariables, 10707 ConjunctsInSsa, 1625 ConjunctsInUnsatCore, 63 InterpolantComputations, 14 PerfectInterpolantSequences, 144/15395 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown