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/20181010-MemSafetyPathprograms/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:57:26,456 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:57:26,458 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:57:26,475 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:57:26,475 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:57:26,477 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:57:26,479 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:57:26,481 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:57:26,485 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:57:26,491 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:57:26,492 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:57:26,493 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:57:26,496 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:57:26,497 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:57:26,498 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:57:26,501 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:57:26,503 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:57:26,505 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:57:26,511 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:57:26,515 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:57:26,516 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:57:26,520 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:57:26,521 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:57:26,521 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:57:26,525 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:57:26,525 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:57:26,526 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:57:26,527 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:57:26,528 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:57:26,531 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:57:26,531 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:57:26,532 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:57:26,533 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:57:26,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:57:26,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:57:26,536 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:57:26,537 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:57:26,538 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:57:26,538 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:57:26,539 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:57:26,541 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:57:26,574 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:57:26,591 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:57:26,595 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:57:26,598 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:57:26,599 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:57:26,599 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_11.bpl [2019-08-05 10:57:26,600 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_11.bpl' [2019-08-05 10:57:26,667 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:57:26,668 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:57:26,669 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:57:26,669 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:57:26,670 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:57:26,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:26" (1/1) ... [2019-08-05 10:57:26,704 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:26" (1/1) ... [2019-08-05 10:57:26,714 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:57:26,715 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:57:26,715 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:57:26,715 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:57:26,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:26" (1/1) ... [2019-08-05 10:57:26,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:26" (1/1) ... [2019-08-05 10:57:26,730 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:26" (1/1) ... [2019-08-05 10:57:26,732 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:26" (1/1) ... [2019-08-05 10:57:26,739 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:26" (1/1) ... [2019-08-05 10:57:26,741 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:26" (1/1) ... [2019-08-05 10:57:26,742 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:26" (1/1) ... [2019-08-05 10:57:26,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:57:26,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:57:26,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:57:26,752 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:57:26,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:26" (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:57:26,824 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:57:26,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:57:26,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:57:27,076 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-08-05 10:57:27,079 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:57:27,079 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:57:27,081 INFO L202 PluginConnector]: Adding new model ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:57:27 BoogieIcfgContainer [2019-08-05 10:57:27,081 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:57:27,082 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:57:27,083 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:57:27,085 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:57:27,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:26" (1/2) ... [2019-08-05 10:57:27,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193b6321 and model type ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:57:27, skipping insertion in model container [2019-08-05 10:57:27,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:57:27" (2/2) ... [2019-08-05 10:57:27,089 INFO L109 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_11.bpl [2019-08-05 10:57:27,099 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:57:27,108 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:57:27,139 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:57:27,171 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:57:27,171 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:57:27,172 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:57:27,172 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:57:27,172 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:57:27,172 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:57:27,172 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:57:27,172 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:57:27,173 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:57:27,198 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:57:27,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:57:27,208 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:27,215 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:57:27,221 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:27,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:27,236 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 10:57:27,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:27,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:57:27,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:27,386 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:57:27,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:57:27,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:57:27,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:57:27,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:57:27,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:57:27,411 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:57:27,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:27,463 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2019-08-05 10:57:27,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:57:27,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:57:27,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:27,477 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:57:27,477 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:57:27,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:57:27,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:57:27,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-08-05 10:57:27,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:57:27,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-08-05 10:57:27,512 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2019-08-05 10:57:27,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:27,512 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-08-05 10:57:27,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:57:27,513 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-08-05 10:57:27,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:57:27,513 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:27,514 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:57:27,514 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:27,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:27,515 INFO L82 PathProgramCache]: Analyzing trace with hash 28852267, now seen corresponding path program 1 times [2019-08-05 10:57:27,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:27,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:57:27,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:27,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:27,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:27,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:57:27,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:57:27,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:57:27,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:57:27,600 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2019-08-05 10:57:27,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:27,698 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2019-08-05 10:57:27,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:57:27,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 10:57:27,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:27,700 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:57:27,700 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:57:27,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:57:27,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:57:27,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-08-05 10:57:27,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:57:27,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-08-05 10:57:27,704 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 [2019-08-05 10:57:27,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:27,704 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-08-05 10:57:27,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:57:27,705 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2019-08-05 10:57:27,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:57:27,705 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:27,705 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2019-08-05 10:57:27,706 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:27,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:27,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1957290323, now seen corresponding path program 2 times [2019-08-05 10:57:27,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:27,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:57:27,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:27,821 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:57:27,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:57:27,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:57:27,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:57:27,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:57:27,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:57:27,823 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 4 states. [2019-08-05 10:57:27,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:27,902 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-08-05 10:57:27,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:57:27,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-08-05 10:57:27,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:27,904 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:57:27,905 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:57:27,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:57:27,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:57:27,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:57:27,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:57:27,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-08-05 10:57:27,911 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 7 [2019-08-05 10:57:27,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:27,912 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-08-05 10:57:27,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:57:27,924 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2019-08-05 10:57:27,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:57:27,925 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:27,925 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1] [2019-08-05 10:57:27,926 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:27,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:27,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1757340579, now seen corresponding path program 1 times [2019-08-05 10:57:27,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:27,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:28,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:57:28,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:28,087 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:57:28,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:28,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:57:28,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:57:28,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:57:28,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:57:28,089 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 5 states. [2019-08-05 10:57:28,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:28,283 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-08-05 10:57:28,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:57:28,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-08-05 10:57:28,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:28,284 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:57:28,284 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:57:28,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:57:28,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:57:28,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:57:28,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:57:28,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-08-05 10:57:28,287 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2019-08-05 10:57:28,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:28,288 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-08-05 10:57:28,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:57:28,288 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-08-05 10:57:28,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:57:28,289 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:28,289 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2019-08-05 10:57:28,289 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:28,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:28,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1701183725, now seen corresponding path program 2 times [2019-08-05 10:57:28,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:28,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:57:28,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:28,438 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:57:28,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:28,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:57:28,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:57:28,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:57:28,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:57:28,440 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 5 states. [2019-08-05 10:57:28,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:28,572 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-08-05 10:57:28,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:57:28,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-08-05 10:57:28,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:28,575 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:57:28,576 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:57:28,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:57:28,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:57:28,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2019-08-05 10:57:28,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:57:28,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-08-05 10:57:28,583 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 11 [2019-08-05 10:57:28,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:28,584 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-08-05 10:57:28,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:57:28,585 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2019-08-05 10:57:28,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:57:28,586 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:28,586 INFO L399 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2019-08-05 10:57:28,586 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:28,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:28,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1267687909, now seen corresponding path program 3 times [2019-08-05 10:57:28,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:28,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:57:28,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:28,834 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 23 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-08-05 10:57:28,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:28,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:57:28,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:57:28,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:57:28,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:57:28,836 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 7 states. [2019-08-05 10:57:29,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:29,076 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-08-05 10:57:29,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:57:29,077 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-08-05 10:57:29,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:29,078 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:57:29,080 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:57:29,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:57:29,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:57:29,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:57:29,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:57:29,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-08-05 10:57:29,087 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 15 [2019-08-05 10:57:29,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:29,087 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-08-05 10:57:29,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:57:29,088 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2019-08-05 10:57:29,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:57:29,088 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:29,088 INFO L399 BasicCegarLoop]: trace histogram [8, 3, 3, 1, 1, 1] [2019-08-05 10:57:29,089 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:29,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:29,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1317588373, now seen corresponding path program 4 times [2019-08-05 10:57:29,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:29,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:57:29,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:29,222 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-08-05 10:57:29,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:29,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:57:29,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:57:29,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:57:29,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:57:29,224 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 6 states. [2019-08-05 10:57:29,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:29,269 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2019-08-05 10:57:29,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:57:29,271 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-08-05 10:57:29,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:29,272 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:57:29,272 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:57:29,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:57:29,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:57:29,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2019-08-05 10:57:29,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:57:29,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-08-05 10:57:29,277 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 17 [2019-08-05 10:57:29,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:29,277 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-08-05 10:57:29,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:57:29,277 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-08-05 10:57:29,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:57:29,278 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:29,278 INFO L399 BasicCegarLoop]: trace histogram [11, 4, 4, 1, 1, 1] [2019-08-05 10:57:29,279 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:29,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:29,279 INFO L82 PathProgramCache]: Analyzing trace with hash 574183106, now seen corresponding path program 5 times [2019-08-05 10:57:29,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:29,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:57:29,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:29,619 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 65 proven. 34 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-08-05 10:57:29,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:29,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:57:29,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:57:29,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:57:29,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:57:29,628 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 9 states. [2019-08-05 10:57:30,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:30,216 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2019-08-05 10:57:30,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:57:30,216 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-08-05 10:57:30,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:30,217 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:57:30,217 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:57:30,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:57:30,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:57:30,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:57:30,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:57:30,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-08-05 10:57:30,221 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2019-08-05 10:57:30,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:30,221 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-08-05 10:57:30,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:57:30,222 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-08-05 10:57:30,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:57:30,222 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:30,223 INFO L399 BasicCegarLoop]: trace histogram [13, 4, 4, 1, 1, 1] [2019-08-05 10:57:30,223 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:30,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:30,223 INFO L82 PathProgramCache]: Analyzing trace with hash -179633550, now seen corresponding path program 6 times [2019-08-05 10:57:30,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:30,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:30,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:57:30,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:30,449 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-08-05 10:57:30,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:30,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:57:30,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:57:30,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:57:30,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:57:30,451 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 7 states. [2019-08-05 10:57:30,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:30,514 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2019-08-05 10:57:30,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:57:30,514 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-08-05 10:57:30,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:30,516 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:57:30,516 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:57:30,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:57:30,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:57:30,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2019-08-05 10:57:30,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:57:30,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-08-05 10:57:30,522 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 24 [2019-08-05 10:57:30,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:30,522 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-08-05 10:57:30,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:57:30,522 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-08-05 10:57:30,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:57:30,523 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:30,523 INFO L399 BasicCegarLoop]: trace histogram [17, 5, 5, 1, 1, 1] [2019-08-05 10:57:30,524 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:30,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:30,524 INFO L82 PathProgramCache]: Analyzing trace with hash -2131362278, now seen corresponding path program 7 times [2019-08-05 10:57:30,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:30,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:57:30,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:30,916 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 146 proven. 70 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-08-05 10:57:30,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:30,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:57:30,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:57:30,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:57:30,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:57:30,918 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 11 states. [2019-08-05 10:57:31,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:31,058 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2019-08-05 10:57:31,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:57:31,058 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2019-08-05 10:57:31,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:31,059 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:57:31,059 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:57:31,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:57:31,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:57:31,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:57:31,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:57:31,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-08-05 10:57:31,064 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 30 [2019-08-05 10:57:31,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:31,065 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-08-05 10:57:31,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:57:31,065 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-08-05 10:57:31,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:57:31,066 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:31,066 INFO L399 BasicCegarLoop]: trace histogram [19, 5, 5, 1, 1, 1] [2019-08-05 10:57:31,066 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:31,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:31,067 INFO L82 PathProgramCache]: Analyzing trace with hash 486093482, now seen corresponding path program 8 times [2019-08-05 10:57:31,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:31,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:57:31,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:31,463 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-08-05 10:57:31,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:31,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:57:31,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:57:31,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:57:31,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:57:31,464 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 8 states. [2019-08-05 10:57:31,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:31,542 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2019-08-05 10:57:31,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:57:31,542 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-08-05 10:57:31,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:31,543 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:57:31,543 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:57:31,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:57:31,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:57:31,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2019-08-05 10:57:31,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:57:31,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2019-08-05 10:57:31,547 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 32 [2019-08-05 10:57:31,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:31,548 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-08-05 10:57:31,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:57:31,548 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2019-08-05 10:57:31,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:57:31,549 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:31,549 INFO L399 BasicCegarLoop]: trace histogram [24, 6, 6, 1, 1, 1] [2019-08-05 10:57:31,550 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:31,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:31,550 INFO L82 PathProgramCache]: Analyzing trace with hash 134771651, now seen corresponding path program 9 times [2019-08-05 10:57:31,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:31,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:31,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:57:31,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:31,908 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 283 proven. 123 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-08-05 10:57:31,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:31,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:57:31,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:57:31,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:57:31,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:57:31,910 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 13 states. [2019-08-05 10:57:32,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:32,137 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2019-08-05 10:57:32,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:57:32,138 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2019-08-05 10:57:32,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:32,139 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:57:32,139 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:57:32,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:57:32,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:57:32,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:57:32,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:57:32,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2019-08-05 10:57:32,145 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 39 [2019-08-05 10:57:32,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:32,145 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2019-08-05 10:57:32,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:57:32,146 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2019-08-05 10:57:32,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:57:32,146 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:32,147 INFO L399 BasicCegarLoop]: trace histogram [26, 6, 6, 1, 1, 1] [2019-08-05 10:57:32,147 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:32,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:32,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1401339699, now seen corresponding path program 10 times [2019-08-05 10:57:32,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:32,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:57:32,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:32,361 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-08-05 10:57:32,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:32,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:57:32,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:57:32,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:57:32,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:57:32,363 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 9 states. [2019-08-05 10:57:32,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:32,437 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2019-08-05 10:57:32,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:57:32,438 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-08-05 10:57:32,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:32,439 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:57:32,439 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:57:32,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:57:32,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:57:32,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2019-08-05 10:57:32,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:57:32,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2019-08-05 10:57:32,444 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 41 [2019-08-05 10:57:32,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:32,444 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2019-08-05 10:57:32,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:57:32,445 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2019-08-05 10:57:32,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:57:32,445 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:32,446 INFO L399 BasicCegarLoop]: trace histogram [32, 7, 7, 1, 1, 1] [2019-08-05 10:57:32,446 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:32,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:32,446 INFO L82 PathProgramCache]: Analyzing trace with hash 401081851, now seen corresponding path program 11 times [2019-08-05 10:57:32,447 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:32,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 869 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:57:32,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:32,795 INFO L134 CoverageAnalysis]: Checked inductivity of 769 backedges. 496 proven. 196 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 10:57:32,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:32,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:57:32,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:57:32,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:57:32,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:57:32,797 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 15 states. [2019-08-05 10:57:33,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:33,317 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-08-05 10:57:33,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:57:33,319 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 49 [2019-08-05 10:57:33,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:33,320 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:57:33,320 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:57:33,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:57:33,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:57:33,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:57:33,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:57:33,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2019-08-05 10:57:33,325 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 49 [2019-08-05 10:57:33,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:33,326 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2019-08-05 10:57:33,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:57:33,326 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2019-08-05 10:57:33,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:57:33,327 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:33,327 INFO L399 BasicCegarLoop]: trace histogram [34, 7, 7, 1, 1, 1] [2019-08-05 10:57:33,327 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:33,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:33,328 INFO L82 PathProgramCache]: Analyzing trace with hash 130312779, now seen corresponding path program 12 times [2019-08-05 10:57:33,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:33,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 905 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:57:33,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:34,475 INFO L134 CoverageAnalysis]: Checked inductivity of 848 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-08-05 10:57:34,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:34,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:57:34,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:57:34,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:57:34,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:57:34,477 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 10 states. [2019-08-05 10:57:34,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:34,695 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2019-08-05 10:57:34,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:57:34,695 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2019-08-05 10:57:34,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:34,696 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:57:34,696 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:57:34,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:57:34,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:57:34,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61. [2019-08-05 10:57:34,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:57:34,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2019-08-05 10:57:34,701 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 51 [2019-08-05 10:57:34,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:34,702 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2019-08-05 10:57:34,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:57:34,702 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2019-08-05 10:57:34,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:57:34,703 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:34,703 INFO L399 BasicCegarLoop]: trace histogram [41, 8, 8, 1, 1, 1] [2019-08-05 10:57:34,703 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:34,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:34,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1695607006, now seen corresponding path program 13 times [2019-08-05 10:57:34,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:34,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:57:34,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:35,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1212 backedges. 808 proven. 292 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-08-05 10:57:35,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:35,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:57:35,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:57:35,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:57:35,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:57:35,160 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand 17 states. [2019-08-05 10:57:35,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:35,370 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2019-08-05 10:57:35,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:57:35,370 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 60 [2019-08-05 10:57:35,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:35,371 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:57:35,372 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:57:35,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=216, Invalid=384, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:57:35,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:57:35,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:57:35,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:57:35,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2019-08-05 10:57:35,378 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 60 [2019-08-05 10:57:35,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:35,378 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2019-08-05 10:57:35,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:57:35,378 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2019-08-05 10:57:35,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:57:35,379 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:35,379 INFO L399 BasicCegarLoop]: trace histogram [43, 8, 8, 1, 1, 1] [2019-08-05 10:57:35,380 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:35,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:35,380 INFO L82 PathProgramCache]: Analyzing trace with hash -2037718318, now seen corresponding path program 14 times [2019-08-05 10:57:35,381 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:35,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 1103 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:57:35,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:35,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-08-05 10:57:35,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:35,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:57:35,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:57:35,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:57:35,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:57:35,961 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 11 states. [2019-08-05 10:57:36,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:36,180 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2019-08-05 10:57:36,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:57:36,181 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2019-08-05 10:57:36,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:36,182 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:57:36,182 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:57:36,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:57:36,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:57:36,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 73. [2019-08-05 10:57:36,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:57:36,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2019-08-05 10:57:36,188 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 62 [2019-08-05 10:57:36,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:36,188 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2019-08-05 10:57:36,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:57:36,189 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2019-08-05 10:57:36,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:57:36,190 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:36,190 INFO L399 BasicCegarLoop]: trace histogram [51, 9, 9, 1, 1, 1] [2019-08-05 10:57:36,190 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:36,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:36,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1163946310, now seen corresponding path program 15 times [2019-08-05 10:57:36,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:36,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 1283 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:57:36,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:37,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1815 backedges. 1245 proven. 414 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-08-05 10:57:37,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:37,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:57:37,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:57:37,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:57:37,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:57:37,297 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand 19 states. [2019-08-05 10:57:37,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:37,638 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2019-08-05 10:57:37,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:57:37,639 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 72 [2019-08-05 10:57:37,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:37,640 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:57:37,641 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:57:37,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=270, Invalid=486, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:57:37,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:57:37,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:57:37,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:57:37,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2019-08-05 10:57:37,646 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 72 [2019-08-05 10:57:37,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:37,646 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2019-08-05 10:57:37,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:57:37,646 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2019-08-05 10:57:37,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:57:37,647 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:37,648 INFO L399 BasicCegarLoop]: trace histogram [53, 9, 9, 1, 1, 1] [2019-08-05 10:57:37,648 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:37,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:37,648 INFO L82 PathProgramCache]: Analyzing trace with hash 45968202, now seen corresponding path program 16 times [2019-08-05 10:57:37,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:37,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 1319 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:57:37,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:38,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1727 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2019-08-05 10:57:38,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:38,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:57:38,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:57:38,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:57:38,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:57:38,135 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand 12 states. [2019-08-05 10:57:38,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:38,186 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2019-08-05 10:57:38,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:57:38,186 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 74 [2019-08-05 10:57:38,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:38,187 INFO L225 Difference]: With dead ends: 96 [2019-08-05 10:57:38,187 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 10:57:38,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:57:38,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 10:57:38,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 86. [2019-08-05 10:57:38,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:57:38,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2019-08-05 10:57:38,191 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 74 [2019-08-05 10:57:38,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:38,192 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2019-08-05 10:57:38,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:57:38,192 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2019-08-05 10:57:38,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:57:38,193 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:38,193 INFO L399 BasicCegarLoop]: trace histogram [62, 10, 10, 1, 1, 1] [2019-08-05 10:57:38,193 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:38,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:38,194 INFO L82 PathProgramCache]: Analyzing trace with hash -452834589, now seen corresponding path program 17 times [2019-08-05 10:57:38,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:38,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 1517 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:57:38,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:38,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2611 backedges. 1836 proven. 565 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-08-05 10:57:38,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:38,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:57:38,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:57:38,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:57:38,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:57:38,736 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand 21 states. [2019-08-05 10:57:39,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:39,197 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2019-08-05 10:57:39,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:57:39,199 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 85 [2019-08-05 10:57:39,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:39,200 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:57:39,200 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:57:39,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=330, Invalid=600, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:57:39,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:57:39,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 10:57:39,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:57:39,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2019-08-05 10:57:39,204 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 85 [2019-08-05 10:57:39,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:39,204 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2019-08-05 10:57:39,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:57:39,204 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2019-08-05 10:57:39,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 10:57:39,205 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:39,206 INFO L399 BasicCegarLoop]: trace histogram [64, 10, 10, 1, 1, 1] [2019-08-05 10:57:39,206 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:39,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:39,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1829897811, now seen corresponding path program 18 times [2019-08-05 10:57:39,207 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:39,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 1553 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:57:39,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:39,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2482 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2019-08-05 10:57:39,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:39,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:57:39,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:57:39,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:57:39,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:57:39,496 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand 13 states. [2019-08-05 10:57:39,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:39,626 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2019-08-05 10:57:39,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:57:39,627 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 87 [2019-08-05 10:57:39,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:39,628 INFO L225 Difference]: With dead ends: 111 [2019-08-05 10:57:39,628 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 10:57:39,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:57:39,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 10:57:39,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2019-08-05 10:57:39,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:57:39,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2019-08-05 10:57:39,633 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 87 [2019-08-05 10:57:39,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:39,633 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2019-08-05 10:57:39,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:57:39,633 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2019-08-05 10:57:39,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:57:39,634 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:39,634 INFO L399 BasicCegarLoop]: trace histogram [74, 11, 11, 1, 1, 1] [2019-08-05 10:57:39,637 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:39,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:39,637 INFO L82 PathProgramCache]: Analyzing trace with hash -14191397, now seen corresponding path program 19 times [2019-08-05 10:57:39,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:39,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 1769 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:57:39,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:40,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3636 backedges. 2613 proven. 748 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-08-05 10:57:40,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:40,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:57:40,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:57:40,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:57:40,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:57:40,206 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand 23 states. [2019-08-05 10:57:40,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:40,559 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2019-08-05 10:57:40,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:57:40,562 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 99 [2019-08-05 10:57:40,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:40,563 INFO L225 Difference]: With dead ends: 102 [2019-08-05 10:57:40,563 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 10:57:40,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=396, Invalid=726, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:57:40,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 10:57:40,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-08-05 10:57:40,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:57:40,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2019-08-05 10:57:40,566 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 99 [2019-08-05 10:57:40,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:40,567 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2019-08-05 10:57:40,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:57:40,567 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2019-08-05 10:57:40,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 10:57:40,568 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:40,568 INFO L399 BasicCegarLoop]: trace histogram [76, 11, 11, 1, 1, 1] [2019-08-05 10:57:40,568 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:40,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:40,569 INFO L82 PathProgramCache]: Analyzing trace with hash -24123093, now seen corresponding path program 20 times [2019-08-05 10:57:40,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:40,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 1805 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:57:40,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:40,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3807 backedges. 0 proven. 3456 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-08-05 10:57:40,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:40,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:57:40,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:57:40,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:57:40,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:57:40,977 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand 14 states. [2019-08-05 10:57:41,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:41,026 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2019-08-05 10:57:41,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:57:41,027 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 101 [2019-08-05 10:57:41,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:41,029 INFO L225 Difference]: With dead ends: 127 [2019-08-05 10:57:41,029 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 10:57:41,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:57:41,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 10:57:41,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-08-05 10:57:41,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 10:57:41,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2019-08-05 10:57:41,033 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 101 [2019-08-05 10:57:41,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:41,033 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2019-08-05 10:57:41,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:57:41,034 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2019-08-05 10:57:41,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 10:57:41,034 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:41,035 INFO L399 BasicCegarLoop]: trace histogram [87, 12, 12, 1, 1, 1] [2019-08-05 10:57:41,035 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:41,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:41,035 INFO L82 PathProgramCache]: Analyzing trace with hash -963923838, now seen corresponding path program 21 times [2019-08-05 10:57:41,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:41,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 2039 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:57:41,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:41,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4929 backedges. 3611 proven. 966 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2019-08-05 10:57:41,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:41,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:57:41,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:57:41,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:57:41,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:57:41,625 INFO L87 Difference]: Start difference. First operand 115 states and 127 transitions. Second operand 25 states. [2019-08-05 10:57:42,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:42,230 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2019-08-05 10:57:42,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:57:42,230 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 114 [2019-08-05 10:57:42,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:42,231 INFO L225 Difference]: With dead ends: 117 [2019-08-05 10:57:42,231 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 10:57:42,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=468, Invalid=864, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:57:42,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 10:57:42,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-08-05 10:57:42,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 10:57:42,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 129 transitions. [2019-08-05 10:57:42,236 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 129 transitions. Word has length 114 [2019-08-05 10:57:42,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:42,237 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 129 transitions. [2019-08-05 10:57:42,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:57:42,237 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 129 transitions. [2019-08-05 10:57:42,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 10:57:42,238 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:42,238 INFO L399 BasicCegarLoop]: trace histogram [89, 12, 12, 1, 1, 1] [2019-08-05 10:57:42,238 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:42,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:42,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1857856462, now seen corresponding path program 22 times [2019-08-05 10:57:42,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:42,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 2075 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:57:42,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:42,921 INFO L134 CoverageAnalysis]: Checked inductivity of 5128 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-08-05 10:57:42,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:42,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:57:42,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:57:42,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:57:42,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:57:42,922 INFO L87 Difference]: Start difference. First operand 117 states and 129 transitions. Second operand 15 states. [2019-08-05 10:57:42,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:42,993 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2019-08-05 10:57:42,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:57:42,995 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 116 [2019-08-05 10:57:42,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:42,996 INFO L225 Difference]: With dead ends: 144 [2019-08-05 10:57:42,996 INFO L226 Difference]: Without dead ends: 144 [2019-08-05 10:57:42,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:57:42,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-08-05 10:57:42,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 131. [2019-08-05 10:57:42,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-08-05 10:57:42,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 144 transitions. [2019-08-05 10:57:42,999 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 144 transitions. Word has length 116 [2019-08-05 10:57:43,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:43,000 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 144 transitions. [2019-08-05 10:57:43,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:57:43,000 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 144 transitions. [2019-08-05 10:57:43,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-08-05 10:57:43,001 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:43,001 INFO L399 BasicCegarLoop]: trace histogram [101, 13, 13, 1, 1, 1] [2019-08-05 10:57:43,001 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:43,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:43,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1847167066, now seen corresponding path program 23 times [2019-08-05 10:57:43,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:43,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 2327 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:57:43,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:43,729 INFO L134 CoverageAnalysis]: Checked inductivity of 6532 backedges. 4868 proven. 1222 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-08-05 10:57:43,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:43,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:57:43,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:57:43,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:57:43,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:57:43,730 INFO L87 Difference]: Start difference. First operand 131 states and 144 transitions. Second operand 27 states. [2019-08-05 10:57:44,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:44,211 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2019-08-05 10:57:44,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:57:44,211 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 130 [2019-08-05 10:57:44,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:44,213 INFO L225 Difference]: With dead ends: 133 [2019-08-05 10:57:44,213 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 10:57:44,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=546, Invalid=1014, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:57:44,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 10:57:44,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-08-05 10:57:44,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 10:57:44,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 146 transitions. [2019-08-05 10:57:44,217 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 146 transitions. Word has length 130 [2019-08-05 10:57:44,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:44,218 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 146 transitions. [2019-08-05 10:57:44,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:57:44,218 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 146 transitions. [2019-08-05 10:57:44,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-08-05 10:57:44,218 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:44,218 INFO L399 BasicCegarLoop]: trace histogram [103, 13, 13, 1, 1, 1] [2019-08-05 10:57:44,219 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:44,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:44,219 INFO L82 PathProgramCache]: Analyzing trace with hash -415515414, now seen corresponding path program 24 times [2019-08-05 10:57:44,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:44,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 2363 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:57:44,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:44,737 INFO L134 CoverageAnalysis]: Checked inductivity of 6761 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 545 trivial. 0 not checked. [2019-08-05 10:57:44,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:44,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:57:44,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:57:44,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:57:44,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:57:44,738 INFO L87 Difference]: Start difference. First operand 133 states and 146 transitions. Second operand 16 states. [2019-08-05 10:57:44,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:44,797 INFO L93 Difference]: Finished difference Result 162 states and 177 transitions. [2019-08-05 10:57:44,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:57:44,797 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 132 [2019-08-05 10:57:44,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:44,799 INFO L225 Difference]: With dead ends: 162 [2019-08-05 10:57:44,799 INFO L226 Difference]: Without dead ends: 162 [2019-08-05 10:57:44,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:57:44,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-08-05 10:57:44,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 148. [2019-08-05 10:57:44,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-08-05 10:57:44,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 162 transitions. [2019-08-05 10:57:44,803 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 162 transitions. Word has length 132 [2019-08-05 10:57:44,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:44,803 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 162 transitions. [2019-08-05 10:57:44,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:57:44,803 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 162 transitions. [2019-08-05 10:57:44,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-08-05 10:57:44,804 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:44,804 INFO L399 BasicCegarLoop]: trace histogram [116, 14, 14, 1, 1, 1] [2019-08-05 10:57:44,804 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:44,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:44,805 INFO L82 PathProgramCache]: Analyzing trace with hash 606841091, now seen corresponding path program 25 times [2019-08-05 10:57:44,805 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:45,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 2633 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:57:45,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:45,677 INFO L134 CoverageAnalysis]: Checked inductivity of 8490 backedges. 6425 proven. 1519 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2019-08-05 10:57:45,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:45,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:57:45,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:57:45,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:57:45,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:57:45,679 INFO L87 Difference]: Start difference. First operand 148 states and 162 transitions. Second operand 29 states. [2019-08-05 10:57:46,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:46,233 INFO L93 Difference]: Finished difference Result 150 states and 164 transitions. [2019-08-05 10:57:46,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:57:46,234 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 147 [2019-08-05 10:57:46,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:46,235 INFO L225 Difference]: With dead ends: 150 [2019-08-05 10:57:46,235 INFO L226 Difference]: Without dead ends: 150 [2019-08-05 10:57:46,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=1176, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:57:46,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-08-05 10:57:46,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2019-08-05 10:57:46,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-08-05 10:57:46,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 164 transitions. [2019-08-05 10:57:46,240 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 164 transitions. Word has length 147 [2019-08-05 10:57:46,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:46,240 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 164 transitions. [2019-08-05 10:57:46,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:57:46,241 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 164 transitions. [2019-08-05 10:57:46,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-08-05 10:57:46,241 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:46,241 INFO L399 BasicCegarLoop]: trace histogram [118, 14, 14, 1, 1, 1] [2019-08-05 10:57:46,242 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:46,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:46,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1458246771, now seen corresponding path program 26 times [2019-08-05 10:57:46,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:46,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:46,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 2669 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:57:46,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:46,812 INFO L134 CoverageAnalysis]: Checked inductivity of 8751 backedges. 0 proven. 8087 refuted. 0 times theorem prover too weak. 664 trivial. 0 not checked. [2019-08-05 10:57:46,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:46,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:57:46,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:57:46,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:57:46,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:57:46,814 INFO L87 Difference]: Start difference. First operand 150 states and 164 transitions. Second operand 17 states. [2019-08-05 10:57:46,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:46,884 INFO L93 Difference]: Finished difference Result 181 states and 197 transitions. [2019-08-05 10:57:46,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:57:46,885 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 149 [2019-08-05 10:57:46,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:46,886 INFO L225 Difference]: With dead ends: 181 [2019-08-05 10:57:46,886 INFO L226 Difference]: Without dead ends: 181 [2019-08-05 10:57:46,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:57:46,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-08-05 10:57:46,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 166. [2019-08-05 10:57:46,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-08-05 10:57:46,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 181 transitions. [2019-08-05 10:57:46,890 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 181 transitions. Word has length 149 [2019-08-05 10:57:46,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:46,890 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 181 transitions. [2019-08-05 10:57:46,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:57:46,890 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 181 transitions. [2019-08-05 10:57:46,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-08-05 10:57:46,891 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:46,891 INFO L399 BasicCegarLoop]: trace histogram [132, 15, 15, 1, 1, 1] [2019-08-05 10:57:46,892 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:46,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:46,892 INFO L82 PathProgramCache]: Analyzing trace with hash 2018749115, now seen corresponding path program 27 times [2019-08-05 10:57:46,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:47,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 2957 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:57:47,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:48,674 INFO L134 CoverageAnalysis]: Checked inductivity of 10851 backedges. 8326 proven. 1860 refuted. 0 times theorem prover too weak. 665 trivial. 0 not checked. [2019-08-05 10:57:48,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:48,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:57:48,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:57:48,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:57:48,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:57:48,676 INFO L87 Difference]: Start difference. First operand 166 states and 181 transitions. Second operand 31 states. [2019-08-05 10:57:49,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:49,335 INFO L93 Difference]: Finished difference Result 168 states and 183 transitions. [2019-08-05 10:57:49,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:57:49,336 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 165 [2019-08-05 10:57:49,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:49,337 INFO L225 Difference]: With dead ends: 168 [2019-08-05 10:57:49,338 INFO L226 Difference]: Without dead ends: 168 [2019-08-05 10:57:49,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=720, Invalid=1350, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:57:49,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-08-05 10:57:49,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-08-05 10:57:49,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-08-05 10:57:49,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 183 transitions. [2019-08-05 10:57:49,342 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 183 transitions. Word has length 165 [2019-08-05 10:57:49,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:49,342 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 183 transitions. [2019-08-05 10:57:49,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:57:49,342 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 183 transitions. [2019-08-05 10:57:49,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-08-05 10:57:49,343 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:49,343 INFO L399 BasicCegarLoop]: trace histogram [134, 15, 15, 1, 1, 1] [2019-08-05 10:57:49,344 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:49,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:49,344 INFO L82 PathProgramCache]: Analyzing trace with hash -3248373, now seen corresponding path program 28 times [2019-08-05 10:57:49,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:49,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 2993 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:57:49,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:49,839 INFO L134 CoverageAnalysis]: Checked inductivity of 11146 backedges. 0 proven. 10347 refuted. 0 times theorem prover too weak. 799 trivial. 0 not checked. [2019-08-05 10:57:49,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:49,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:57:49,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:57:49,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:57:49,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:57:49,840 INFO L87 Difference]: Start difference. First operand 168 states and 183 transitions. Second operand 18 states. [2019-08-05 10:57:49,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:49,918 INFO L93 Difference]: Finished difference Result 201 states and 218 transitions. [2019-08-05 10:57:49,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:57:49,919 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 167 [2019-08-05 10:57:49,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:49,920 INFO L225 Difference]: With dead ends: 201 [2019-08-05 10:57:49,920 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 10:57:49,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:57:49,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 10:57:49,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 185. [2019-08-05 10:57:49,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-08-05 10:57:49,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 201 transitions. [2019-08-05 10:57:49,925 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 201 transitions. Word has length 167 [2019-08-05 10:57:49,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:49,925 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 201 transitions. [2019-08-05 10:57:49,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:57:49,926 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 201 transitions. [2019-08-05 10:57:49,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-08-05 10:57:49,926 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:49,926 INFO L399 BasicCegarLoop]: trace histogram [149, 16, 16, 1, 1, 1] [2019-08-05 10:57:49,927 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:49,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:49,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1807540962, now seen corresponding path program 29 times [2019-08-05 10:57:49,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:50,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 3299 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:57:50,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:51,381 INFO L134 CoverageAnalysis]: Checked inductivity of 13666 backedges. 10618 proven. 2248 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-08-05 10:57:51,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:51,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:57:51,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:57:51,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:57:51,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:57:51,383 INFO L87 Difference]: Start difference. First operand 185 states and 201 transitions. Second operand 33 states. [2019-08-05 10:57:52,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:52,026 INFO L93 Difference]: Finished difference Result 187 states and 203 transitions. [2019-08-05 10:57:52,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:57:52,027 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 184 [2019-08-05 10:57:52,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:52,028 INFO L225 Difference]: With dead ends: 187 [2019-08-05 10:57:52,028 INFO L226 Difference]: Without dead ends: 187 [2019-08-05 10:57:52,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=816, Invalid=1536, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:57:52,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-05 10:57:52,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-08-05 10:57:52,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-08-05 10:57:52,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 203 transitions. [2019-08-05 10:57:52,034 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 203 transitions. Word has length 184 [2019-08-05 10:57:52,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:52,034 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 203 transitions. [2019-08-05 10:57:52,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:57:52,034 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 203 transitions. [2019-08-05 10:57:52,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-08-05 10:57:52,035 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:52,036 INFO L399 BasicCegarLoop]: trace histogram [151, 16, 16, 1, 1, 1] [2019-08-05 10:57:52,036 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:52,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:52,036 INFO L82 PathProgramCache]: Analyzing trace with hash -709742958, now seen corresponding path program 30 times [2019-08-05 10:57:52,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:52,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 3335 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:57:52,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:52,591 INFO L134 CoverageAnalysis]: Checked inductivity of 13997 backedges. 0 proven. 13046 refuted. 0 times theorem prover too weak. 951 trivial. 0 not checked. [2019-08-05 10:57:52,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:52,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:57:52,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:57:52,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:57:52,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:57:52,593 INFO L87 Difference]: Start difference. First operand 187 states and 203 transitions. Second operand 19 states. [2019-08-05 10:57:52,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:52,750 INFO L93 Difference]: Finished difference Result 222 states and 240 transitions. [2019-08-05 10:57:52,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:57:52,755 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 186 [2019-08-05 10:57:52,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:52,757 INFO L225 Difference]: With dead ends: 222 [2019-08-05 10:57:52,757 INFO L226 Difference]: Without dead ends: 222 [2019-08-05 10:57:52,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:57:52,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-08-05 10:57:52,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 205. [2019-08-05 10:57:52,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-08-05 10:57:52,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 222 transitions. [2019-08-05 10:57:52,762 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 222 transitions. Word has length 186 [2019-08-05 10:57:52,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:52,763 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 222 transitions. [2019-08-05 10:57:52,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:57:52,763 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 222 transitions. [2019-08-05 10:57:52,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-08-05 10:57:52,764 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:52,765 INFO L399 BasicCegarLoop]: trace histogram [167, 17, 17, 1, 1, 1] [2019-08-05 10:57:52,765 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:52,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:52,766 INFO L82 PathProgramCache]: Analyzing trace with hash -489942278, now seen corresponding path program 31 times [2019-08-05 10:57:52,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:53,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 3659 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:57:53,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:54,181 INFO L134 CoverageAnalysis]: Checked inductivity of 16989 backedges. 13351 proven. 2686 refuted. 0 times theorem prover too weak. 952 trivial. 0 not checked. [2019-08-05 10:57:54,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:54,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:57:54,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:57:54,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:57:54,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:57:54,183 INFO L87 Difference]: Start difference. First operand 205 states and 222 transitions. Second operand 35 states. [2019-08-05 10:57:54,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:54,979 INFO L93 Difference]: Finished difference Result 207 states and 224 transitions. [2019-08-05 10:57:54,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:57:54,979 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 204 [2019-08-05 10:57:54,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:54,981 INFO L225 Difference]: With dead ends: 207 [2019-08-05 10:57:54,981 INFO L226 Difference]: Without dead ends: 207 [2019-08-05 10:57:54,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=918, Invalid=1734, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:57:54,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-08-05 10:57:54,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2019-08-05 10:57:54,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-08-05 10:57:54,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 224 transitions. [2019-08-05 10:57:54,987 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 224 transitions. Word has length 204 [2019-08-05 10:57:54,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:54,987 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 224 transitions. [2019-08-05 10:57:54,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:57:54,987 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 224 transitions. [2019-08-05 10:57:54,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-08-05 10:57:54,988 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:54,988 INFO L399 BasicCegarLoop]: trace histogram [169, 17, 17, 1, 1, 1] [2019-08-05 10:57:54,989 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:54,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:54,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1429444726, now seen corresponding path program 32 times [2019-08-05 10:57:54,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:55,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 3695 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:57:55,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:55,741 INFO L134 CoverageAnalysis]: Checked inductivity of 17358 backedges. 0 proven. 16237 refuted. 0 times theorem prover too weak. 1121 trivial. 0 not checked. [2019-08-05 10:57:55,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:55,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:57:55,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:57:55,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:57:55,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:57:55,742 INFO L87 Difference]: Start difference. First operand 207 states and 224 transitions. Second operand 20 states. [2019-08-05 10:57:55,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:55,818 INFO L93 Difference]: Finished difference Result 244 states and 263 transitions. [2019-08-05 10:57:55,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:57:55,818 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 206 [2019-08-05 10:57:55,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:55,820 INFO L225 Difference]: With dead ends: 244 [2019-08-05 10:57:55,821 INFO L226 Difference]: Without dead ends: 244 [2019-08-05 10:57:55,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:57:55,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-08-05 10:57:55,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 226. [2019-08-05 10:57:55,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-08-05 10:57:55,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 244 transitions. [2019-08-05 10:57:55,826 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 244 transitions. Word has length 206 [2019-08-05 10:57:55,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:55,826 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 244 transitions. [2019-08-05 10:57:55,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:57:55,826 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 244 transitions. [2019-08-05 10:57:55,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-08-05 10:57:55,827 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:55,828 INFO L399 BasicCegarLoop]: trace histogram [186, 18, 18, 1, 1, 1] [2019-08-05 10:57:55,828 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:55,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:55,828 INFO L82 PathProgramCache]: Analyzing trace with hash 319409699, now seen corresponding path program 33 times [2019-08-05 10:57:55,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:56,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 4037 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:57:56,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:57,249 INFO L134 CoverageAnalysis]: Checked inductivity of 20877 backedges. 16578 proven. 3177 refuted. 0 times theorem prover too weak. 1122 trivial. 0 not checked. [2019-08-05 10:57:57,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:57,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:57:57,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:57:57,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:57:57,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:57:57,250 INFO L87 Difference]: Start difference. First operand 226 states and 244 transitions. Second operand 37 states. [2019-08-05 10:57:58,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:58,181 INFO L93 Difference]: Finished difference Result 228 states and 246 transitions. [2019-08-05 10:57:58,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:57:58,182 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 225 [2019-08-05 10:57:58,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:58,184 INFO L225 Difference]: With dead ends: 228 [2019-08-05 10:57:58,185 INFO L226 Difference]: Without dead ends: 228 [2019-08-05 10:57:58,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1026, Invalid=1944, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:57:58,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-08-05 10:57:58,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2019-08-05 10:57:58,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-08-05 10:57:58,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 246 transitions. [2019-08-05 10:57:58,191 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 246 transitions. Word has length 225 [2019-08-05 10:57:58,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:58,192 INFO L475 AbstractCegarLoop]: Abstraction has 228 states and 246 transitions. [2019-08-05 10:57:58,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:57:58,192 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 246 transitions. [2019-08-05 10:57:58,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-08-05 10:57:58,194 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:58,194 INFO L399 BasicCegarLoop]: trace histogram [188, 18, 18, 1, 1, 1] [2019-08-05 10:57:58,194 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:58,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:58,195 INFO L82 PathProgramCache]: Analyzing trace with hash -2142819949, now seen corresponding path program 34 times [2019-08-05 10:57:58,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:59,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 4073 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:57:59,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:59,318 INFO L134 CoverageAnalysis]: Checked inductivity of 21286 backedges. 0 proven. 19976 refuted. 0 times theorem prover too weak. 1310 trivial. 0 not checked. [2019-08-05 10:57:59,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:59,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:57:59,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:57:59,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:57:59,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:57:59,320 INFO L87 Difference]: Start difference. First operand 228 states and 246 transitions. Second operand 21 states. [2019-08-05 10:57:59,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:59,490 INFO L93 Difference]: Finished difference Result 267 states and 287 transitions. [2019-08-05 10:57:59,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:57:59,490 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 227 [2019-08-05 10:57:59,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:59,492 INFO L225 Difference]: With dead ends: 267 [2019-08-05 10:57:59,492 INFO L226 Difference]: Without dead ends: 267 [2019-08-05 10:57:59,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:57:59,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-08-05 10:57:59,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 248. [2019-08-05 10:57:59,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-08-05 10:57:59,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 267 transitions. [2019-08-05 10:57:59,498 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 267 transitions. Word has length 227 [2019-08-05 10:57:59,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:59,498 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 267 transitions. [2019-08-05 10:57:59,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:57:59,499 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 267 transitions. [2019-08-05 10:57:59,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-08-05 10:57:59,500 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:59,500 INFO L399 BasicCegarLoop]: trace histogram [206, 19, 19, 1, 1, 1] [2019-08-05 10:57:59,500 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:59,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:59,501 INFO L82 PathProgramCache]: Analyzing trace with hash -32020581, now seen corresponding path program 35 times [2019-08-05 10:57:59,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:00,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:00,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 4433 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:58:00,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:01,844 INFO L134 CoverageAnalysis]: Checked inductivity of 25390 backedges. 20355 proven. 3724 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2019-08-05 10:58:01,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:01,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:58:01,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:58:01,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:58:01,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:58:01,845 INFO L87 Difference]: Start difference. First operand 248 states and 267 transitions. Second operand 39 states. [2019-08-05 10:58:03,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:03,203 INFO L93 Difference]: Finished difference Result 250 states and 269 transitions. [2019-08-05 10:58:03,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:58:03,203 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 247 [2019-08-05 10:58:03,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:03,205 INFO L225 Difference]: With dead ends: 250 [2019-08-05 10:58:03,205 INFO L226 Difference]: Without dead ends: 250 [2019-08-05 10:58:03,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1140, Invalid=2166, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:58:03,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-08-05 10:58:03,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2019-08-05 10:58:03,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-08-05 10:58:03,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 269 transitions. [2019-08-05 10:58:03,211 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 269 transitions. Word has length 247 [2019-08-05 10:58:03,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:03,212 INFO L475 AbstractCegarLoop]: Abstraction has 250 states and 269 transitions. [2019-08-05 10:58:03,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:58:03,212 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 269 transitions. [2019-08-05 10:58:03,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-08-05 10:58:03,213 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:03,213 INFO L399 BasicCegarLoop]: trace histogram [208, 19, 19, 1, 1, 1] [2019-08-05 10:58:03,213 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:03,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:03,214 INFO L82 PathProgramCache]: Analyzing trace with hash -663045141, now seen corresponding path program 36 times [2019-08-05 10:58:03,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:03,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:03,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 4469 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:58:03,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:04,038 INFO L134 CoverageAnalysis]: Checked inductivity of 25841 backedges. 0 proven. 24322 refuted. 0 times theorem prover too weak. 1519 trivial. 0 not checked. [2019-08-05 10:58:04,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:04,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:58:04,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:58:04,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:58:04,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:58:04,040 INFO L87 Difference]: Start difference. First operand 250 states and 269 transitions. Second operand 22 states. [2019-08-05 10:58:04,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:04,125 INFO L93 Difference]: Finished difference Result 291 states and 312 transitions. [2019-08-05 10:58:04,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:58:04,125 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 249 [2019-08-05 10:58:04,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:04,127 INFO L225 Difference]: With dead ends: 291 [2019-08-05 10:58:04,127 INFO L226 Difference]: Without dead ends: 291 [2019-08-05 10:58:04,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:58:04,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-08-05 10:58:04,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 271. [2019-08-05 10:58:04,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-08-05 10:58:04,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 291 transitions. [2019-08-05 10:58:04,132 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 291 transitions. Word has length 249 [2019-08-05 10:58:04,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:04,132 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 291 transitions. [2019-08-05 10:58:04,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:58:04,132 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 291 transitions. [2019-08-05 10:58:04,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-08-05 10:58:04,134 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:04,134 INFO L399 BasicCegarLoop]: trace histogram [227, 20, 20, 1, 1, 1] [2019-08-05 10:58:04,134 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:04,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:04,135 INFO L82 PathProgramCache]: Analyzing trace with hash 485125698, now seen corresponding path program 37 times [2019-08-05 10:58:04,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:04,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 4847 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:58:04,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:05,512 INFO L134 CoverageAnalysis]: Checked inductivity of 30591 backedges. 24741 proven. 4330 refuted. 0 times theorem prover too weak. 1520 trivial. 0 not checked. [2019-08-05 10:58:05,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:05,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:58:05,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:58:05,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:58:05,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:58:05,514 INFO L87 Difference]: Start difference. First operand 271 states and 291 transitions. Second operand 41 states. [2019-08-05 10:58:06,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:06,773 INFO L93 Difference]: Finished difference Result 273 states and 293 transitions. [2019-08-05 10:58:06,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:58:06,773 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 270 [2019-08-05 10:58:06,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:06,775 INFO L225 Difference]: With dead ends: 273 [2019-08-05 10:58:06,776 INFO L226 Difference]: Without dead ends: 273 [2019-08-05 10:58:06,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1260, Invalid=2400, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:58:06,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-08-05 10:58:06,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2019-08-05 10:58:06,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-08-05 10:58:06,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 293 transitions. [2019-08-05 10:58:06,781 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 293 transitions. Word has length 270 [2019-08-05 10:58:06,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:06,782 INFO L475 AbstractCegarLoop]: Abstraction has 273 states and 293 transitions. [2019-08-05 10:58:06,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:58:06,782 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 293 transitions. [2019-08-05 10:58:06,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-08-05 10:58:06,783 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:06,784 INFO L399 BasicCegarLoop]: trace histogram [229, 20, 20, 1, 1, 1] [2019-08-05 10:58:06,784 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:06,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:06,784 INFO L82 PathProgramCache]: Analyzing trace with hash -649127438, now seen corresponding path program 38 times [2019-08-05 10:58:06,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:07,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:07,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 4883 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:58:07,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:07,768 INFO L134 CoverageAnalysis]: Checked inductivity of 31086 backedges. 0 proven. 29337 refuted. 0 times theorem prover too weak. 1749 trivial. 0 not checked. [2019-08-05 10:58:07,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:07,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:58:07,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:58:07,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:58:07,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:58:07,769 INFO L87 Difference]: Start difference. First operand 273 states and 293 transitions. Second operand 23 states. [2019-08-05 10:58:07,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:07,860 INFO L93 Difference]: Finished difference Result 316 states and 338 transitions. [2019-08-05 10:58:07,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:58:07,860 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 272 [2019-08-05 10:58:07,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:07,863 INFO L225 Difference]: With dead ends: 316 [2019-08-05 10:58:07,863 INFO L226 Difference]: Without dead ends: 316 [2019-08-05 10:58:07,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:58:07,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-08-05 10:58:07,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 295. [2019-08-05 10:58:07,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-08-05 10:58:07,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 316 transitions. [2019-08-05 10:58:07,868 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 316 transitions. Word has length 272 [2019-08-05 10:58:07,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:07,868 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 316 transitions. [2019-08-05 10:58:07,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:58:07,868 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 316 transitions. [2019-08-05 10:58:07,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-08-05 10:58:07,870 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:07,870 INFO L399 BasicCegarLoop]: trace histogram [249, 21, 21, 1, 1, 1] [2019-08-05 10:58:07,870 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:07,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:07,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1478920550, now seen corresponding path program 39 times [2019-08-05 10:58:07,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:08,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 5279 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:58:08,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:09,674 INFO L134 CoverageAnalysis]: Checked inductivity of 36546 backedges. 29798 proven. 4998 refuted. 0 times theorem prover too weak. 1750 trivial. 0 not checked. [2019-08-05 10:58:09,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:09,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:58:09,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:58:09,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:58:09,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:58:09,675 INFO L87 Difference]: Start difference. First operand 295 states and 316 transitions. Second operand 43 states. [2019-08-05 10:58:10,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:10,824 INFO L93 Difference]: Finished difference Result 297 states and 318 transitions. [2019-08-05 10:58:10,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:58:10,830 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 294 [2019-08-05 10:58:10,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:10,832 INFO L225 Difference]: With dead ends: 297 [2019-08-05 10:58:10,832 INFO L226 Difference]: Without dead ends: 297 [2019-08-05 10:58:10,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1386, Invalid=2646, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:58:10,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-08-05 10:58:10,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2019-08-05 10:58:10,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-08-05 10:58:10,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 318 transitions. [2019-08-05 10:58:10,838 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 318 transitions. Word has length 294 [2019-08-05 10:58:10,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:10,838 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 318 transitions. [2019-08-05 10:58:10,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:58:10,838 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 318 transitions. [2019-08-05 10:58:10,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-08-05 10:58:10,840 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:10,840 INFO L399 BasicCegarLoop]: trace histogram [251, 21, 21, 1, 1, 1] [2019-08-05 10:58:10,840 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:10,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:10,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1862380330, now seen corresponding path program 40 times [2019-08-05 10:58:10,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:11,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:11,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 5315 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:58:11,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:12,091 INFO L134 CoverageAnalysis]: Checked inductivity of 37087 backedges. 0 proven. 35086 refuted. 0 times theorem prover too weak. 2001 trivial. 0 not checked. [2019-08-05 10:58:12,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:12,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:58:12,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:58:12,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:58:12,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:58:12,092 INFO L87 Difference]: Start difference. First operand 297 states and 318 transitions. Second operand 24 states. [2019-08-05 10:58:12,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:12,198 INFO L93 Difference]: Finished difference Result 342 states and 365 transitions. [2019-08-05 10:58:12,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:58:12,198 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 296 [2019-08-05 10:58:12,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:12,200 INFO L225 Difference]: With dead ends: 342 [2019-08-05 10:58:12,200 INFO L226 Difference]: Without dead ends: 342 [2019-08-05 10:58:12,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:58:12,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-08-05 10:58:12,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 320. [2019-08-05 10:58:12,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-08-05 10:58:12,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 342 transitions. [2019-08-05 10:58:12,206 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 342 transitions. Word has length 296 [2019-08-05 10:58:12,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:12,207 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 342 transitions. [2019-08-05 10:58:12,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:58:12,207 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 342 transitions. [2019-08-05 10:58:12,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-08-05 10:58:12,209 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:12,209 INFO L399 BasicCegarLoop]: trace histogram [272, 22, 22, 1, 1, 1] [2019-08-05 10:58:12,209 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:12,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:12,210 INFO L82 PathProgramCache]: Analyzing trace with hash 2007497283, now seen corresponding path program 41 times [2019-08-05 10:58:12,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:13,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 5729 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:58:13,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:14,689 INFO L134 CoverageAnalysis]: Checked inductivity of 43324 backedges. 35591 proven. 5731 refuted. 0 times theorem prover too weak. 2002 trivial. 0 not checked. [2019-08-05 10:58:14,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:14,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:58:14,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:58:14,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:58:14,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:58:14,691 INFO L87 Difference]: Start difference. First operand 320 states and 342 transitions. Second operand 45 states. [2019-08-05 10:58:15,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:15,901 INFO L93 Difference]: Finished difference Result 322 states and 344 transitions. [2019-08-05 10:58:15,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:58:15,901 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 319 [2019-08-05 10:58:15,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:15,903 INFO L225 Difference]: With dead ends: 322 [2019-08-05 10:58:15,903 INFO L226 Difference]: Without dead ends: 322 [2019-08-05 10:58:15,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1518, Invalid=2904, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:58:15,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-08-05 10:58:15,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2019-08-05 10:58:15,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-08-05 10:58:15,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 344 transitions. [2019-08-05 10:58:15,910 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 344 transitions. Word has length 319 [2019-08-05 10:58:15,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:15,910 INFO L475 AbstractCegarLoop]: Abstraction has 322 states and 344 transitions. [2019-08-05 10:58:15,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:58:15,910 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 344 transitions. [2019-08-05 10:58:15,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-08-05 10:58:15,912 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:15,912 INFO L399 BasicCegarLoop]: trace histogram [274, 22, 22, 1, 1, 1] [2019-08-05 10:58:15,912 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:15,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:15,913 INFO L82 PathProgramCache]: Analyzing trace with hash -949910093, now seen corresponding path program 42 times [2019-08-05 10:58:15,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:16,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 5765 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:58:16,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:17,261 INFO L134 CoverageAnalysis]: Checked inductivity of 43913 backedges. 0 proven. 41637 refuted. 0 times theorem prover too weak. 2276 trivial. 0 not checked. [2019-08-05 10:58:17,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:17,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:58:17,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:58:17,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:58:17,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:58:17,263 INFO L87 Difference]: Start difference. First operand 322 states and 344 transitions. Second operand 25 states. [2019-08-05 10:58:17,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:17,421 INFO L93 Difference]: Finished difference Result 369 states and 393 transitions. [2019-08-05 10:58:17,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:58:17,422 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 321 [2019-08-05 10:58:17,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:17,424 INFO L225 Difference]: With dead ends: 369 [2019-08-05 10:58:17,424 INFO L226 Difference]: Without dead ends: 369 [2019-08-05 10:58:17,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:58:17,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-08-05 10:58:17,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 346. [2019-08-05 10:58:17,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-08-05 10:58:17,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 369 transitions. [2019-08-05 10:58:17,430 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 369 transitions. Word has length 321 [2019-08-05 10:58:17,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:17,430 INFO L475 AbstractCegarLoop]: Abstraction has 346 states and 369 transitions. [2019-08-05 10:58:17,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:58:17,430 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 369 transitions. [2019-08-05 10:58:17,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-08-05 10:58:17,432 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:17,432 INFO L399 BasicCegarLoop]: trace histogram [296, 23, 23, 1, 1, 1] [2019-08-05 10:58:17,433 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:17,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:17,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1210280827, now seen corresponding path program 43 times [2019-08-05 10:58:17,434 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:18,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 6197 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:58:18,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:19,739 INFO L134 CoverageAnalysis]: Checked inductivity of 50997 backedges. 42188 proven. 6532 refuted. 0 times theorem prover too weak. 2277 trivial. 0 not checked. [2019-08-05 10:58:19,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:19,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:58:19,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:58:19,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:58:19,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:58:19,741 INFO L87 Difference]: Start difference. First operand 346 states and 369 transitions. Second operand 47 states. [2019-08-05 10:58:21,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:21,194 INFO L93 Difference]: Finished difference Result 348 states and 371 transitions. [2019-08-05 10:58:21,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:58:21,194 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 345 [2019-08-05 10:58:21,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:21,197 INFO L225 Difference]: With dead ends: 348 [2019-08-05 10:58:21,197 INFO L226 Difference]: Without dead ends: 348 [2019-08-05 10:58:21,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1656, Invalid=3174, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:58:21,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-08-05 10:58:21,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2019-08-05 10:58:21,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-08-05 10:58:21,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 371 transitions. [2019-08-05 10:58:21,202 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 371 transitions. Word has length 345 [2019-08-05 10:58:21,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:21,203 INFO L475 AbstractCegarLoop]: Abstraction has 348 states and 371 transitions. [2019-08-05 10:58:21,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:58:21,203 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 371 transitions. [2019-08-05 10:58:21,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2019-08-05 10:58:21,205 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:21,205 INFO L399 BasicCegarLoop]: trace histogram [298, 23, 23, 1, 1, 1] [2019-08-05 10:58:21,205 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:21,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:21,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1763020747, now seen corresponding path program 44 times [2019-08-05 10:58:21,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:22,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:22,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 6233 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:58:22,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:22,605 INFO L134 CoverageAnalysis]: Checked inductivity of 51636 backedges. 0 proven. 49061 refuted. 0 times theorem prover too weak. 2575 trivial. 0 not checked. [2019-08-05 10:58:22,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:22,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:58:22,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:58:22,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:58:22,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:58:22,607 INFO L87 Difference]: Start difference. First operand 348 states and 371 transitions. Second operand 26 states. [2019-08-05 10:58:22,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:22,710 INFO L93 Difference]: Finished difference Result 397 states and 422 transitions. [2019-08-05 10:58:22,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:58:22,710 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 347 [2019-08-05 10:58:22,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:22,713 INFO L225 Difference]: With dead ends: 397 [2019-08-05 10:58:22,713 INFO L226 Difference]: Without dead ends: 397 [2019-08-05 10:58:22,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:58:22,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-08-05 10:58:22,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 373. [2019-08-05 10:58:22,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-08-05 10:58:22,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 397 transitions. [2019-08-05 10:58:22,718 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 397 transitions. Word has length 347 [2019-08-05 10:58:22,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:22,718 INFO L475 AbstractCegarLoop]: Abstraction has 373 states and 397 transitions. [2019-08-05 10:58:22,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:58:22,719 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 397 transitions. [2019-08-05 10:58:22,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-08-05 10:58:22,721 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:22,721 INFO L399 BasicCegarLoop]: trace histogram [321, 24, 24, 1, 1, 1] [2019-08-05 10:58:22,721 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:22,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:22,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1454772898, now seen corresponding path program 45 times [2019-08-05 10:58:22,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:23,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 6683 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:58:23,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:25,465 INFO L134 CoverageAnalysis]: Checked inductivity of 59640 backedges. 49660 proven. 7404 refuted. 0 times theorem prover too weak. 2576 trivial. 0 not checked. [2019-08-05 10:58:25,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:25,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:58:25,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:58:25,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:58:25,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:58:25,467 INFO L87 Difference]: Start difference. First operand 373 states and 397 transitions. Second operand 49 states. [2019-08-05 10:58:26,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:26,439 INFO L93 Difference]: Finished difference Result 375 states and 399 transitions. [2019-08-05 10:58:26,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:58:26,440 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 372 [2019-08-05 10:58:26,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:26,442 INFO L225 Difference]: With dead ends: 375 [2019-08-05 10:58:26,442 INFO L226 Difference]: Without dead ends: 375 [2019-08-05 10:58:26,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1800, Invalid=3456, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:58:26,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-08-05 10:58:26,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2019-08-05 10:58:26,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-08-05 10:58:26,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 399 transitions. [2019-08-05 10:58:26,447 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 399 transitions. Word has length 372 [2019-08-05 10:58:26,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:26,448 INFO L475 AbstractCegarLoop]: Abstraction has 375 states and 399 transitions. [2019-08-05 10:58:26,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:58:26,448 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 399 transitions. [2019-08-05 10:58:26,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2019-08-05 10:58:26,450 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:26,450 INFO L399 BasicCegarLoop]: trace histogram [323, 24, 24, 1, 1, 1] [2019-08-05 10:58:26,450 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:26,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:26,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1699470930, now seen corresponding path program 46 times [2019-08-05 10:58:26,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:27,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 6719 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:58:27,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:28,576 INFO L134 CoverageAnalysis]: Checked inductivity of 60331 backedges. 0 proven. 57432 refuted. 0 times theorem prover too weak. 2899 trivial. 0 not checked. [2019-08-05 10:58:28,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:28,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:58:28,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:58:28,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:58:28,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:58:28,577 INFO L87 Difference]: Start difference. First operand 375 states and 399 transitions. Second operand 27 states. [2019-08-05 10:58:28,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:28,694 INFO L93 Difference]: Finished difference Result 426 states and 452 transitions. [2019-08-05 10:58:28,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:58:28,694 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 374 [2019-08-05 10:58:28,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:28,697 INFO L225 Difference]: With dead ends: 426 [2019-08-05 10:58:28,697 INFO L226 Difference]: Without dead ends: 426 [2019-08-05 10:58:28,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:58:28,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-08-05 10:58:28,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 401. [2019-08-05 10:58:28,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-08-05 10:58:28,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 426 transitions. [2019-08-05 10:58:28,703 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 426 transitions. Word has length 374 [2019-08-05 10:58:28,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:28,704 INFO L475 AbstractCegarLoop]: Abstraction has 401 states and 426 transitions. [2019-08-05 10:58:28,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:58:28,704 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 426 transitions. [2019-08-05 10:58:28,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-08-05 10:58:28,706 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:28,707 INFO L399 BasicCegarLoop]: trace histogram [347, 25, 25, 1, 1, 1] [2019-08-05 10:58:28,707 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:28,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:28,707 INFO L82 PathProgramCache]: Analyzing trace with hash -241306822, now seen corresponding path program 47 times [2019-08-05 10:58:28,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:30,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 7187 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:58:30,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:31,524 INFO L134 CoverageAnalysis]: Checked inductivity of 69331 backedges. 58081 proven. 8350 refuted. 0 times theorem prover too weak. 2900 trivial. 0 not checked. [2019-08-05 10:58:31,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:31,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:58:31,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:58:31,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:58:31,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:58:31,525 INFO L87 Difference]: Start difference. First operand 401 states and 426 transitions. Second operand 51 states. [2019-08-05 10:58:33,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:33,165 INFO L93 Difference]: Finished difference Result 403 states and 428 transitions. [2019-08-05 10:58:33,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:58:33,165 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 400 [2019-08-05 10:58:33,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:33,168 INFO L225 Difference]: With dead ends: 403 [2019-08-05 10:58:33,168 INFO L226 Difference]: Without dead ends: 403 [2019-08-05 10:58:33,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 875 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1950, Invalid=3750, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:58:33,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2019-08-05 10:58:33,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2019-08-05 10:58:33,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-08-05 10:58:33,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 428 transitions. [2019-08-05 10:58:33,174 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 428 transitions. Word has length 400 [2019-08-05 10:58:33,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:33,174 INFO L475 AbstractCegarLoop]: Abstraction has 403 states and 428 transitions. [2019-08-05 10:58:33,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:58:33,174 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 428 transitions. [2019-08-05 10:58:33,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2019-08-05 10:58:33,177 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:33,177 INFO L399 BasicCegarLoop]: trace histogram [349, 25, 25, 1, 1, 1] [2019-08-05 10:58:33,177 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:33,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:33,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1809332278, now seen corresponding path program 48 times [2019-08-05 10:58:33,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:34,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 7223 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:58:34,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:34,940 INFO L134 CoverageAnalysis]: Checked inductivity of 70076 backedges. 0 proven. 66827 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2019-08-05 10:58:34,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:34,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:58:34,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:58:34,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:58:34,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:58:34,942 INFO L87 Difference]: Start difference. First operand 403 states and 428 transitions. Second operand 28 states. [2019-08-05 10:58:35,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:35,064 INFO L93 Difference]: Finished difference Result 456 states and 483 transitions. [2019-08-05 10:58:35,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:58:35,064 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 402 [2019-08-05 10:58:35,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:35,067 INFO L225 Difference]: With dead ends: 456 [2019-08-05 10:58:35,067 INFO L226 Difference]: Without dead ends: 456 [2019-08-05 10:58:35,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:58:35,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-08-05 10:58:35,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 430. [2019-08-05 10:58:35,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-08-05 10:58:35,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 456 transitions. [2019-08-05 10:58:35,071 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 456 transitions. Word has length 402 [2019-08-05 10:58:35,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:35,071 INFO L475 AbstractCegarLoop]: Abstraction has 430 states and 456 transitions. [2019-08-05 10:58:35,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:58:35,071 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 456 transitions. [2019-08-05 10:58:35,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2019-08-05 10:58:35,073 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:35,074 INFO L399 BasicCegarLoop]: trace histogram [374, 26, 26, 1, 1, 1] [2019-08-05 10:58:35,074 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:35,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:35,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1005097629, now seen corresponding path program 49 times [2019-08-05 10:58:35,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:36,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 7709 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:58:36,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:37,610 INFO L134 CoverageAnalysis]: Checked inductivity of 80151 backedges. 67528 proven. 9373 refuted. 0 times theorem prover too weak. 3250 trivial. 0 not checked. [2019-08-05 10:58:37,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:37,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:58:37,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:58:37,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:58:37,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:58:37,612 INFO L87 Difference]: Start difference. First operand 430 states and 456 transitions. Second operand 53 states. [2019-08-05 10:58:38,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:38,717 INFO L93 Difference]: Finished difference Result 432 states and 458 transitions. [2019-08-05 10:58:38,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:58:38,717 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 429 [2019-08-05 10:58:38,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:38,720 INFO L225 Difference]: With dead ends: 432 [2019-08-05 10:58:38,720 INFO L226 Difference]: Without dead ends: 432 [2019-08-05 10:58:38,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2106, Invalid=4056, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:58:38,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-08-05 10:58:38,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2019-08-05 10:58:38,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-08-05 10:58:38,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 458 transitions. [2019-08-05 10:58:38,726 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 458 transitions. Word has length 429 [2019-08-05 10:58:38,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:38,726 INFO L475 AbstractCegarLoop]: Abstraction has 432 states and 458 transitions. [2019-08-05 10:58:38,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:58:38,726 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 458 transitions. [2019-08-05 10:58:38,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2019-08-05 10:58:38,729 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:38,729 INFO L399 BasicCegarLoop]: trace histogram [376, 26, 26, 1, 1, 1] [2019-08-05 10:58:38,729 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:38,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:38,730 INFO L82 PathProgramCache]: Analyzing trace with hash -855938861, now seen corresponding path program 50 times [2019-08-05 10:58:38,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:40,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:40,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 7745 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:58:40,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:41,473 INFO L134 CoverageAnalysis]: Checked inductivity of 80952 backedges. 0 proven. 77326 refuted. 0 times theorem prover too weak. 3626 trivial. 0 not checked. [2019-08-05 10:58:41,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:41,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:58:41,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:58:41,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:58:41,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:58:41,474 INFO L87 Difference]: Start difference. First operand 432 states and 458 transitions. Second operand 29 states. [2019-08-05 10:58:41,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:41,593 INFO L93 Difference]: Finished difference Result 487 states and 515 transitions. [2019-08-05 10:58:41,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:58:41,594 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 431 [2019-08-05 10:58:41,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:41,597 INFO L225 Difference]: With dead ends: 487 [2019-08-05 10:58:41,597 INFO L226 Difference]: Without dead ends: 487 [2019-08-05 10:58:41,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:58:41,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-08-05 10:58:41,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 460. [2019-08-05 10:58:41,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-08-05 10:58:41,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 487 transitions. [2019-08-05 10:58:41,602 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 487 transitions. Word has length 431 [2019-08-05 10:58:41,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:41,602 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 487 transitions. [2019-08-05 10:58:41,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:58:41,602 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 487 transitions. [2019-08-05 10:58:41,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2019-08-05 10:58:41,605 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:41,605 INFO L399 BasicCegarLoop]: trace histogram [402, 27, 27, 1, 1, 1] [2019-08-05 10:58:41,606 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:41,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:41,606 INFO L82 PathProgramCache]: Analyzing trace with hash -5343653, now seen corresponding path program 51 times [2019-08-05 10:58:41,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:44,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:44,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 8249 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:58:44,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:45,603 INFO L134 CoverageAnalysis]: Checked inductivity of 92184 backedges. 78081 proven. 10476 refuted. 0 times theorem prover too weak. 3627 trivial. 0 not checked. [2019-08-05 10:58:45,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:45,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:58:45,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:58:45,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:58:45,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:58:45,604 INFO L87 Difference]: Start difference. First operand 460 states and 487 transitions. Second operand 55 states. [2019-08-05 10:58:46,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:46,772 INFO L93 Difference]: Finished difference Result 462 states and 489 transitions. [2019-08-05 10:58:46,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:58:46,772 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 459 [2019-08-05 10:58:46,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:46,775 INFO L225 Difference]: With dead ends: 462 [2019-08-05 10:58:46,775 INFO L226 Difference]: Without dead ends: 462 [2019-08-05 10:58:46,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2268, Invalid=4374, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:58:46,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-08-05 10:58:46,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 462. [2019-08-05 10:58:46,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2019-08-05 10:58:46,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 489 transitions. [2019-08-05 10:58:46,781 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 489 transitions. Word has length 459 [2019-08-05 10:58:46,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:46,781 INFO L475 AbstractCegarLoop]: Abstraction has 462 states and 489 transitions. [2019-08-05 10:58:46,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:58:46,781 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 489 transitions. [2019-08-05 10:58:46,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2019-08-05 10:58:46,784 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:46,784 INFO L399 BasicCegarLoop]: trace histogram [404, 27, 27, 1, 1, 1] [2019-08-05 10:58:46,785 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:46,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:46,785 INFO L82 PathProgramCache]: Analyzing trace with hash 975547051, now seen corresponding path program 52 times [2019-08-05 10:58:46,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:48,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 8285 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:58:48,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:49,196 INFO L134 CoverageAnalysis]: Checked inductivity of 93043 backedges. 0 proven. 89012 refuted. 0 times theorem prover too weak. 4031 trivial. 0 not checked. [2019-08-05 10:58:49,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:49,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:58:49,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:58:49,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:58:49,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:58:49,197 INFO L87 Difference]: Start difference. First operand 462 states and 489 transitions. Second operand 30 states. [2019-08-05 10:58:49,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:49,320 INFO L93 Difference]: Finished difference Result 519 states and 548 transitions. [2019-08-05 10:58:49,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:58:49,320 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 461 [2019-08-05 10:58:49,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:49,323 INFO L225 Difference]: With dead ends: 519 [2019-08-05 10:58:49,323 INFO L226 Difference]: Without dead ends: 519 [2019-08-05 10:58:49,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 432 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:58:49,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-08-05 10:58:49,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 491. [2019-08-05 10:58:49,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2019-08-05 10:58:49,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 519 transitions. [2019-08-05 10:58:49,329 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 519 transitions. Word has length 461 [2019-08-05 10:58:49,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:49,330 INFO L475 AbstractCegarLoop]: Abstraction has 491 states and 519 transitions. [2019-08-05 10:58:49,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:58:49,330 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 519 transitions. [2019-08-05 10:58:49,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2019-08-05 10:58:49,333 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:49,333 INFO L399 BasicCegarLoop]: trace histogram [431, 28, 28, 1, 1, 1] [2019-08-05 10:58:49,333 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:49,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:49,334 INFO L82 PathProgramCache]: Analyzing trace with hash 981176322, now seen corresponding path program 53 times [2019-08-05 10:58:49,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:51,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 8807 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:58:51,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:52,865 INFO L134 CoverageAnalysis]: Checked inductivity of 105517 backedges. 89823 proven. 11662 refuted. 0 times theorem prover too weak. 4032 trivial. 0 not checked. [2019-08-05 10:58:52,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:52,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:58:52,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:58:52,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:58:52,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:58:52,866 INFO L87 Difference]: Start difference. First operand 491 states and 519 transitions. Second operand 57 states. [2019-08-05 10:58:55,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:55,163 INFO L93 Difference]: Finished difference Result 493 states and 521 transitions. [2019-08-05 10:58:55,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:58:55,163 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 490 [2019-08-05 10:58:55,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:55,166 INFO L225 Difference]: With dead ends: 493 [2019-08-05 10:58:55,166 INFO L226 Difference]: Without dead ends: 493 [2019-08-05 10:58:55,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 434 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1106 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2436, Invalid=4704, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:58:55,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-08-05 10:58:55,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2019-08-05 10:58:55,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-08-05 10:58:55,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 521 transitions. [2019-08-05 10:58:55,171 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 521 transitions. Word has length 490 [2019-08-05 10:58:55,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:55,171 INFO L475 AbstractCegarLoop]: Abstraction has 493 states and 521 transitions. [2019-08-05 10:58:55,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:58:55,171 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 521 transitions. [2019-08-05 10:58:55,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2019-08-05 10:58:55,173 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:55,174 INFO L399 BasicCegarLoop]: trace histogram [433, 28, 28, 1, 1, 1] [2019-08-05 10:58:55,174 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:55,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:55,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1592509518, now seen corresponding path program 54 times [2019-08-05 10:58:55,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:58,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:58,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 8843 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:58:58,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:58,835 INFO L134 CoverageAnalysis]: Checked inductivity of 106436 backedges. 0 proven. 101971 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-08-05 10:58:58,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:58,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:58:58,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:58:58,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:58:58,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:58:58,837 INFO L87 Difference]: Start difference. First operand 493 states and 521 transitions. Second operand 31 states. [2019-08-05 10:58:58,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:58,969 INFO L93 Difference]: Finished difference Result 552 states and 582 transitions. [2019-08-05 10:58:58,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:58:58,969 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 492 [2019-08-05 10:58:58,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:58,972 INFO L225 Difference]: With dead ends: 552 [2019-08-05 10:58:58,972 INFO L226 Difference]: Without dead ends: 552 [2019-08-05 10:58:58,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 462 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:58:58,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-08-05 10:58:58,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 523. [2019-08-05 10:58:58,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-08-05 10:58:58,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 552 transitions. [2019-08-05 10:58:58,978 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 552 transitions. Word has length 492 [2019-08-05 10:58:58,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:58,978 INFO L475 AbstractCegarLoop]: Abstraction has 523 states and 552 transitions. [2019-08-05 10:58:58,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:58:58,979 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 552 transitions. [2019-08-05 10:58:58,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2019-08-05 10:58:58,982 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:58,982 INFO L399 BasicCegarLoop]: trace histogram [461, 29, 29, 1, 1, 1] [2019-08-05 10:58:58,982 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:58,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:58,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1825584934, now seen corresponding path program 55 times [2019-08-05 10:58:58,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:02,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:02,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 9383 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:59:02,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:03,494 INFO L134 CoverageAnalysis]: Checked inductivity of 120240 backedges. 102840 proven. 12934 refuted. 0 times theorem prover too weak. 4466 trivial. 0 not checked. [2019-08-05 10:59:03,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:03,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:59:03,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:59:03,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:59:03,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:59:03,496 INFO L87 Difference]: Start difference. First operand 523 states and 552 transitions. Second operand 59 states. [2019-08-05 10:59:05,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:05,749 INFO L93 Difference]: Finished difference Result 525 states and 554 transitions. [2019-08-05 10:59:05,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:59:05,749 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 522 [2019-08-05 10:59:05,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:05,752 INFO L225 Difference]: With dead ends: 525 [2019-08-05 10:59:05,752 INFO L226 Difference]: Without dead ends: 525 [2019-08-05 10:59:05,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 464 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1189 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2610, Invalid=5046, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:59:05,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2019-08-05 10:59:05,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 525. [2019-08-05 10:59:05,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2019-08-05 10:59:05,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 554 transitions. [2019-08-05 10:59:05,757 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 554 transitions. Word has length 522 [2019-08-05 10:59:05,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:05,758 INFO L475 AbstractCegarLoop]: Abstraction has 525 states and 554 transitions. [2019-08-05 10:59:05,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:59:05,758 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 554 transitions. [2019-08-05 10:59:05,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2019-08-05 10:59:05,760 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:05,760 INFO L399 BasicCegarLoop]: trace histogram [463, 29, 29, 1, 1, 1] [2019-08-05 10:59:05,760 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:05,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:05,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1388641642, now seen corresponding path program 56 times [2019-08-05 10:59:05,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:09,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 9419 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:59:09,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:10,850 INFO L134 CoverageAnalysis]: Checked inductivity of 121221 backedges. 0 proven. 116292 refuted. 0 times theorem prover too weak. 4929 trivial. 0 not checked. [2019-08-05 10:59:10,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:10,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:59:10,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:59:10,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:59:10,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:59:10,851 INFO L87 Difference]: Start difference. First operand 525 states and 554 transitions. Second operand 32 states. [2019-08-05 10:59:10,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:10,985 INFO L93 Difference]: Finished difference Result 586 states and 617 transitions. [2019-08-05 10:59:10,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:59:10,986 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 524 [2019-08-05 10:59:10,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:10,989 INFO L225 Difference]: With dead ends: 586 [2019-08-05 10:59:10,989 INFO L226 Difference]: Without dead ends: 586 [2019-08-05 10:59:10,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:59:10,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-08-05 10:59:10,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 556. [2019-08-05 10:59:10,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2019-08-05 10:59:10,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 586 transitions. [2019-08-05 10:59:10,993 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 586 transitions. Word has length 524 [2019-08-05 10:59:10,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:10,993 INFO L475 AbstractCegarLoop]: Abstraction has 556 states and 586 transitions. [2019-08-05 10:59:10,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:59:10,994 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 586 transitions. [2019-08-05 10:59:10,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2019-08-05 10:59:10,996 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:10,997 INFO L399 BasicCegarLoop]: trace histogram [492, 30, 30, 1, 1, 1] [2019-08-05 10:59:10,997 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:10,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:10,997 INFO L82 PathProgramCache]: Analyzing trace with hash 770664323, now seen corresponding path program 57 times [2019-08-05 10:59:10,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:15,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 9977 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:59:15,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:16,860 INFO L134 CoverageAnalysis]: Checked inductivity of 136446 backedges. 117221 proven. 14295 refuted. 0 times theorem prover too weak. 4930 trivial. 0 not checked. [2019-08-05 10:59:16,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:16,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:59:16,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:59:16,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:59:16,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:59:16,862 INFO L87 Difference]: Start difference. First operand 556 states and 586 transitions. Second operand 61 states. [2019-08-05 10:59:17,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:17,958 INFO L93 Difference]: Finished difference Result 558 states and 588 transitions. [2019-08-05 10:59:17,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:59:17,959 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 555 [2019-08-05 10:59:17,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:17,961 INFO L225 Difference]: With dead ends: 558 [2019-08-05 10:59:17,962 INFO L226 Difference]: Without dead ends: 558 [2019-08-05 10:59:17,962 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 584 GetRequests, 495 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2790, Invalid=5400, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:59:17,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-08-05 10:59:17,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 558. [2019-08-05 10:59:17,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2019-08-05 10:59:17,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 588 transitions. [2019-08-05 10:59:17,966 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 588 transitions. Word has length 555 [2019-08-05 10:59:17,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:17,967 INFO L475 AbstractCegarLoop]: Abstraction has 558 states and 588 transitions. [2019-08-05 10:59:17,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:59:17,967 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 588 transitions. [2019-08-05 10:59:17,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2019-08-05 10:59:17,969 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:17,969 INFO L399 BasicCegarLoop]: trace histogram [494, 30, 30, 1, 1, 1] [2019-08-05 10:59:17,970 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:17,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:17,970 INFO L82 PathProgramCache]: Analyzing trace with hash 735843059, now seen corresponding path program 58 times [2019-08-05 10:59:17,970 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:21,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 10013 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:59:21,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:22,156 INFO L134 CoverageAnalysis]: Checked inductivity of 137491 backedges. 0 proven. 132067 refuted. 0 times theorem prover too weak. 5424 trivial. 0 not checked. [2019-08-05 10:59:22,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:22,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:59:22,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:59:22,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:59:22,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:59:22,158 INFO L87 Difference]: Start difference. First operand 558 states and 588 transitions. Second operand 33 states. [2019-08-05 10:59:22,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:22,305 INFO L93 Difference]: Finished difference Result 621 states and 653 transitions. [2019-08-05 10:59:22,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:59:22,306 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 557 [2019-08-05 10:59:22,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:22,309 INFO L225 Difference]: With dead ends: 621 [2019-08-05 10:59:22,309 INFO L226 Difference]: Without dead ends: 621 [2019-08-05 10:59:22,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:59:22,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-08-05 10:59:22,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 590. [2019-08-05 10:59:22,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-08-05 10:59:22,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 621 transitions. [2019-08-05 10:59:22,314 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 621 transitions. Word has length 557 [2019-08-05 10:59:22,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:22,315 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 621 transitions. [2019-08-05 10:59:22,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:59:22,315 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 621 transitions. [2019-08-05 10:59:22,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2019-08-05 10:59:22,317 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:22,318 INFO L399 BasicCegarLoop]: trace histogram [524, 31, 31, 1, 1, 1] [2019-08-05 10:59:22,318 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:22,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:22,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1475692603, now seen corresponding path program 59 times [2019-08-05 10:59:22,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:26,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 10589 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:59:26,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:27,693 INFO L134 CoverageAnalysis]: Checked inductivity of 154231 backedges. 133058 proven. 15748 refuted. 0 times theorem prover too weak. 5425 trivial. 0 not checked. [2019-08-05 10:59:27,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:27,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:59:27,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:59:27,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:59:27,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:59:27,694 INFO L87 Difference]: Start difference. First operand 590 states and 621 transitions. Second operand 63 states. [2019-08-05 10:59:29,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:29,229 INFO L93 Difference]: Finished difference Result 592 states and 623 transitions. [2019-08-05 10:59:29,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:59:29,230 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 589 [2019-08-05 10:59:29,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:29,233 INFO L225 Difference]: With dead ends: 592 [2019-08-05 10:59:29,233 INFO L226 Difference]: Without dead ends: 592 [2019-08-05 10:59:29,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 527 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1364 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2976, Invalid=5766, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:59:29,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-08-05 10:59:29,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-08-05 10:59:29,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-08-05 10:59:29,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 623 transitions. [2019-08-05 10:59:29,238 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 623 transitions. Word has length 589 [2019-08-05 10:59:29,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:29,238 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 623 transitions. [2019-08-05 10:59:29,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:59:29,238 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 623 transitions. [2019-08-05 10:59:29,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2019-08-05 10:59:29,241 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:29,241 INFO L399 BasicCegarLoop]: trace histogram [526, 31, 31, 1, 1, 1] [2019-08-05 10:59:29,242 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:29,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:29,242 INFO L82 PathProgramCache]: Analyzing trace with hash -189281141, now seen corresponding path program 60 times [2019-08-05 10:59:29,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:34,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 10625 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:59:34,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:35,002 INFO L134 CoverageAnalysis]: Checked inductivity of 155342 backedges. 0 proven. 149391 refuted. 0 times theorem prover too weak. 5951 trivial. 0 not checked. [2019-08-05 10:59:35,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:35,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:59:35,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:59:35,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:59:35,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:59:35,004 INFO L87 Difference]: Start difference. First operand 592 states and 623 transitions. Second operand 34 states. [2019-08-05 10:59:35,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:35,145 INFO L93 Difference]: Finished difference Result 625 states and 657 transitions. [2019-08-05 10:59:35,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:59:35,146 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 591 [2019-08-05 10:59:35,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:35,149 INFO L225 Difference]: With dead ends: 625 [2019-08-05 10:59:35,149 INFO L226 Difference]: Without dead ends: 625 [2019-08-05 10:59:35,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 558 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:59:35,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2019-08-05 10:59:35,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 625. [2019-08-05 10:59:35,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2019-08-05 10:59:35,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 657 transitions. [2019-08-05 10:59:35,154 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 657 transitions. Word has length 591 [2019-08-05 10:59:35,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:35,154 INFO L475 AbstractCegarLoop]: Abstraction has 625 states and 657 transitions. [2019-08-05 10:59:35,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:59:35,155 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 657 transitions. [2019-08-05 10:59:35,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 625 [2019-08-05 10:59:35,157 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:35,158 INFO L399 BasicCegarLoop]: trace histogram [557, 32, 32, 1, 1, 1] [2019-08-05 10:59:35,158 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:35,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:35,158 INFO L82 PathProgramCache]: Analyzing trace with hash -456087966, now seen corresponding path program 61 times [2019-08-05 10:59:35,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:40,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 11219 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:59:40,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:41,901 INFO L134 CoverageAnalysis]: Checked inductivity of 173694 backedges. 150446 proven. 17296 refuted. 0 times theorem prover too weak. 5952 trivial. 0 not checked. [2019-08-05 10:59:41,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:41,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:59:41,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:59:41,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:59:41,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:59:41,904 INFO L87 Difference]: Start difference. First operand 625 states and 657 transitions. Second operand 65 states. [2019-08-05 10:59:45,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:45,140 INFO L93 Difference]: Finished difference Result 627 states and 659 transitions. [2019-08-05 10:59:45,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:59:45,141 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 624 [2019-08-05 10:59:45,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:45,144 INFO L225 Difference]: With dead ends: 627 [2019-08-05 10:59:45,144 INFO L226 Difference]: Without dead ends: 627 [2019-08-05 10:59:45,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 560 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1456 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3168, Invalid=6144, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:59:45,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-08-05 10:59:45,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2019-08-05 10:59:45,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-08-05 10:59:45,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 659 transitions. [2019-08-05 10:59:45,150 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 659 transitions. Word has length 624 [2019-08-05 10:59:45,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:45,150 INFO L475 AbstractCegarLoop]: Abstraction has 627 states and 659 transitions. [2019-08-05 10:59:45,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:59:45,150 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 659 transitions. [2019-08-05 10:59:45,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2019-08-05 10:59:45,153 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:45,154 INFO L399 BasicCegarLoop]: trace histogram [559, 32, 32, 1, 1, 1] [2019-08-05 10:59:45,154 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:45,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:45,154 INFO L82 PathProgramCache]: Analyzing trace with hash -926027246, now seen corresponding path program 62 times [2019-08-05 10:59:45,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:51,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 11255 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:59:51,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:53,079 INFO L134 CoverageAnalysis]: Checked inductivity of 174873 backedges. 149948 proven. 18942 refuted. 0 times theorem prover too weak. 5983 trivial. 0 not checked. [2019-08-05 10:59:53,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:53,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:59:53,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:59:53,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:59:53,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:59:53,081 INFO L87 Difference]: Start difference. First operand 627 states and 659 transitions. Second operand 67 states. [2019-08-05 10:59:54,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:54,629 INFO L93 Difference]: Finished difference Result 628 states and 660 transitions. [2019-08-05 10:59:54,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:59:54,629 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 626 [2019-08-05 10:59:54,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:54,632 INFO L225 Difference]: With dead ends: 628 [2019-08-05 10:59:54,632 INFO L226 Difference]: Without dead ends: 628 [2019-08-05 10:59:54,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 658 GetRequests, 560 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1551 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3366, Invalid=6534, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:59:54,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-08-05 10:59:54,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 628. [2019-08-05 10:59:54,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-08-05 10:59:54,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 660 transitions. [2019-08-05 10:59:54,638 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 660 transitions. Word has length 626 [2019-08-05 10:59:54,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:54,639 INFO L475 AbstractCegarLoop]: Abstraction has 628 states and 660 transitions. [2019-08-05 10:59:54,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:59:54,639 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 660 transitions. [2019-08-05 10:59:54,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2019-08-05 10:59:54,642 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:54,642 INFO L399 BasicCegarLoop]: trace histogram [560, 32, 32, 1, 1, 1] [2019-08-05 10:59:54,642 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:54,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:54,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1357995523, now seen corresponding path program 63 times [2019-08-05 10:59:54,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:23,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 11273 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:00:23,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:23,691 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:00:23,692 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:23,748 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:23,749 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:23,749 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-08-05 11:00:24,865 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-08-05 11:00:24,865 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:24,916 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:24,916 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:24,916 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:7 [2019-08-05 11:00:25,587 INFO L134 CoverageAnalysis]: Checked inductivity of 175464 backedges. 149948 proven. 19037 refuted. 0 times theorem prover too weak. 6479 trivial. 0 not checked. [2019-08-05 11:00:25,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:25,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:00:25,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:00:25,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:00:25,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=568, Invalid=764, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:00:25,588 INFO L87 Difference]: Start difference. First operand 628 states and 660 transitions. Second operand 37 states. [2019-08-05 11:00:26,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:26,791 INFO L93 Difference]: Finished difference Result 625 states and 656 transitions. [2019-08-05 11:00:26,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:00:26,791 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 627 [2019-08-05 11:00:26,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:26,792 INFO L225 Difference]: With dead ends: 625 [2019-08-05 11:00:26,792 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:00:26,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 591 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=640, Invalid=842, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:00:26,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:00:26,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:00:26,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:00:26,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:00:26,794 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 627 [2019-08-05 11:00:26,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:26,794 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:00:26,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:00:26,794 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:00:26,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:00:26,799 INFO L202 PluginConnector]: Adding new model ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:00:26 BoogieIcfgContainer [2019-08-05 11:00:26,799 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:00:26,801 INFO L168 Benchmark]: Toolchain (without parser) took 180132.79 ms. Allocated memory was 136.3 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 113.5 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-08-05 11:00:26,802 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 136.3 MB. Free memory is still 114.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:00:26,802 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.50 ms. Allocated memory is still 136.3 MB. Free memory was 113.5 MB in the beginning and 111.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:00:26,803 INFO L168 Benchmark]: Boogie Preprocessor took 30.65 ms. Allocated memory is still 136.3 MB. Free memory was 111.8 MB in the beginning and 110.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:00:26,804 INFO L168 Benchmark]: RCFGBuilder took 329.55 ms. Allocated memory is still 136.3 MB. Free memory was 110.2 MB in the beginning and 97.7 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. [2019-08-05 11:00:26,804 INFO L168 Benchmark]: TraceAbstraction took 179717.06 ms. Allocated memory was 136.3 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 97.3 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-08-05 11:00:26,807 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.22 ms. Allocated memory is still 136.3 MB. Free memory is still 114.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.50 ms. Allocated memory is still 136.3 MB. Free memory was 113.5 MB in the beginning and 111.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.65 ms. Allocated memory is still 136.3 MB. Free memory was 111.8 MB in the beginning and 110.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 329.55 ms. Allocated memory is still 136.3 MB. Free memory was 110.2 MB in the beginning and 97.7 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 179717.06 ms. Allocated memory was 136.3 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 97.3 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 103]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 179.6s OverallTime, 66 OverallIterations, 560 TraceHistogramMax, 36.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 691 SDtfs, 1238 SDslu, 2330 SDs, 0 SdLazy, 21190 SolverSat, 850 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16329 GetRequests, 14113 SyntacticMatches, 0 SemanticMatches, 2216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17486 ImplicationChecksByTransitivity, 46.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=628occurred in iteration=65, 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, 66 MinimizatonAttempts, 495 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.9s SsaConstructionTime, 96.0s SatisfiabilityAnalysisTime, 45.6s InterpolantComputationTime, 15832 NumberOfCodeBlocks, 15832 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 15766 ConstructedInterpolants, 0 QuantifiedInterpolants, 21520924 SizeOfPredicates, 148 NumberOfNonLiveVariables, 284118 ConjunctsInSsa, 1801 ConjunctsInUnsatCore, 66 InterpolantComputations, 2 PerfectInterpolantSequences, 1486703/2732442 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...