java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-502d2f4 [2018-10-12 20:44:33,295 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-12 20:44:33,297 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-12 20:44:33,309 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-12 20:44:33,309 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-12 20:44:33,310 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-12 20:44:33,312 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-12 20:44:33,313 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-12 20:44:33,315 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-12 20:44:33,316 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-12 20:44:33,317 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-12 20:44:33,317 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-12 20:44:33,318 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-12 20:44:33,319 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-12 20:44:33,320 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-12 20:44:33,321 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-12 20:44:33,322 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-12 20:44:33,324 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-12 20:44:33,326 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-12 20:44:33,327 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-12 20:44:33,328 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-12 20:44:33,330 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-12 20:44:33,332 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-12 20:44:33,333 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-12 20:44:33,333 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-12 20:44:33,334 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-12 20:44:33,335 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-12 20:44:33,335 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-12 20:44:33,336 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-12 20:44:33,337 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-12 20:44:33,338 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-12 20:44:33,338 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-12 20:44:33,339 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-12 20:44:33,339 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-12 20:44:33,340 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-12 20:44:33,341 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-12 20:44:33,341 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-12 20:44:33,350 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-12 20:44:33,351 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-12 20:44:33,352 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-12 20:44:33,352 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-12 20:44:33,352 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-12 20:44:33,352 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-12 20:44:33,353 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-12 20:44:33,353 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-12 20:44:33,353 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-12 20:44:33,354 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-12 20:44:33,354 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-12 20:44:33,354 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-12 20:44:33,354 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-12 20:44:33,355 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-12 20:44:33,355 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-12 20:44:33,412 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-12 20:44:33,428 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-12 20:44:33,434 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-12 20:44:33,436 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-12 20:44:33,436 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-12 20:44:33,437 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl [2018-10-12 20:44:33,437 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl' [2018-10-12 20:44:33,535 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-12 20:44:33,536 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-12 20:44:33,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-12 20:44:33,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-12 20:44:33,538 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-12 20:44:33,565 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:33" (1/1) ... [2018-10-12 20:44:33,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:33" (1/1) ... [2018-10-12 20:44:33,583 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:33" (1/1) ... [2018-10-12 20:44:33,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:33" (1/1) ... [2018-10-12 20:44:33,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:33" (1/1) ... [2018-10-12 20:44:33,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:33" (1/1) ... [2018-10-12 20:44:33,597 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:33" (1/1) ... [2018-10-12 20:44:33,600 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-12 20:44:33,601 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-12 20:44:33,601 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-12 20:44:33,601 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-12 20:44:33,603 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:33" (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 [2018-10-12 20:44:33,667 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-12 20:44:33,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-12 20:44:33,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-12 20:44:34,385 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-12 20:44:34,387 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:44:34 BoogieIcfgContainer [2018-10-12 20:44:34,387 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-12 20:44:34,389 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-12 20:44:34,389 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-12 20:44:34,392 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-12 20:44:34,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:44:33" (1/2) ... [2018-10-12 20:44:34,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c686c1c and model type ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:44:34, skipping insertion in model container [2018-10-12 20:44:34,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:44:34" (2/2) ... [2018-10-12 20:44:34,396 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl [2018-10-12 20:44:34,406 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-12 20:44:34,415 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-12 20:44:34,433 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-12 20:44:34,462 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-12 20:44:34,463 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-12 20:44:34,464 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-12 20:44:34,464 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-12 20:44:34,464 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-12 20:44:34,464 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-12 20:44:34,464 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-12 20:44:34,464 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-12 20:44:34,465 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-12 20:44:34,486 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2018-10-12 20:44:34,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-12 20:44:34,495 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:34,496 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:44:34,500 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:34,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:34,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1350835290, now seen corresponding path program 1 times [2018-10-12 20:44:34,571 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:34,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:34,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:44:34,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-12 20:44:34,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-12 20:44:34,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-12 20:44:34,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-12 20:44:34,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-12 20:44:34,754 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 3 states. [2018-10-12 20:44:34,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:34,970 INFO L93 Difference]: Finished difference Result 197 states and 201 transitions. [2018-10-12 20:44:34,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-12 20:44:34,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-12 20:44:34,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:34,993 INFO L225 Difference]: With dead ends: 197 [2018-10-12 20:44:34,995 INFO L226 Difference]: Without dead ends: 197 [2018-10-12 20:44:34,997 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-12 20:44:35,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-12 20:44:35,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 112. [2018-10-12 20:44:35,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-12 20:44:35,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2018-10-12 20:44:35,048 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 24 [2018-10-12 20:44:35,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:35,048 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2018-10-12 20:44:35,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-12 20:44:35,049 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2018-10-12 20:44:35,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-12 20:44:35,052 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:35,052 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:44:35,053 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:35,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:35,054 INFO L82 PathProgramCache]: Analyzing trace with hash -886221148, now seen corresponding path program 1 times [2018-10-12 20:44:35,055 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:35,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:44:35,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:35,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-12 20:44:35,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-12 20:44:35,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-12 20:44:35,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-12 20:44:35,318 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 5 states. [2018-10-12 20:44:35,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:35,519 INFO L93 Difference]: Finished difference Result 284 states and 290 transitions. [2018-10-12 20:44:35,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-12 20:44:35,520 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-10-12 20:44:35,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:35,524 INFO L225 Difference]: With dead ends: 284 [2018-10-12 20:44:35,524 INFO L226 Difference]: Without dead ends: 284 [2018-10-12 20:44:35,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-12 20:44:35,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-10-12 20:44:35,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 199. [2018-10-12 20:44:35,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-10-12 20:44:35,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 203 transitions. [2018-10-12 20:44:35,548 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 203 transitions. Word has length 78 [2018-10-12 20:44:35,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:35,557 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 203 transitions. [2018-10-12 20:44:35,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-12 20:44:35,557 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 203 transitions. [2018-10-12 20:44:35,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-12 20:44:35,565 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:35,566 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:44:35,566 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:35,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:35,567 INFO L82 PathProgramCache]: Analyzing trace with hash 667016994, now seen corresponding path program 2 times [2018-10-12 20:44:35,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:35,913 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:44:35,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:35,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-12 20:44:35,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-12 20:44:35,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-12 20:44:35,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-12 20:44:35,916 INFO L87 Difference]: Start difference. First operand 199 states and 203 transitions. Second operand 7 states. [2018-10-12 20:44:36,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:36,405 INFO L93 Difference]: Finished difference Result 371 states and 379 transitions. [2018-10-12 20:44:36,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-12 20:44:36,406 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 132 [2018-10-12 20:44:36,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:36,409 INFO L225 Difference]: With dead ends: 371 [2018-10-12 20:44:36,410 INFO L226 Difference]: Without dead ends: 371 [2018-10-12 20:44:36,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-10-12 20:44:36,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-10-12 20:44:36,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 286. [2018-10-12 20:44:36,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-10-12 20:44:36,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 292 transitions. [2018-10-12 20:44:36,434 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 292 transitions. Word has length 132 [2018-10-12 20:44:36,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:36,435 INFO L481 AbstractCegarLoop]: Abstraction has 286 states and 292 transitions. [2018-10-12 20:44:36,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-12 20:44:36,435 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 292 transitions. [2018-10-12 20:44:36,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-12 20:44:36,440 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:36,440 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:44:36,441 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:36,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:36,441 INFO L82 PathProgramCache]: Analyzing trace with hash -232628960, now seen corresponding path program 3 times [2018-10-12 20:44:36,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:37,131 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:44:37,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:37,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-12 20:44:37,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-12 20:44:37,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-12 20:44:37,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-12 20:44:37,134 INFO L87 Difference]: Start difference. First operand 286 states and 292 transitions. Second operand 9 states. [2018-10-12 20:44:37,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:37,596 INFO L93 Difference]: Finished difference Result 458 states and 468 transitions. [2018-10-12 20:44:37,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-12 20:44:37,596 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 186 [2018-10-12 20:44:37,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:37,600 INFO L225 Difference]: With dead ends: 458 [2018-10-12 20:44:37,601 INFO L226 Difference]: Without dead ends: 458 [2018-10-12 20:44:37,601 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-10-12 20:44:37,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-10-12 20:44:37,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 373. [2018-10-12 20:44:37,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-10-12 20:44:37,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 381 transitions. [2018-10-12 20:44:37,621 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 381 transitions. Word has length 186 [2018-10-12 20:44:37,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:37,622 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 381 transitions. [2018-10-12 20:44:37,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-12 20:44:37,622 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 381 transitions. [2018-10-12 20:44:37,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-12 20:44:37,628 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:37,628 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:44:37,629 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:37,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:37,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1674555550, now seen corresponding path program 4 times [2018-10-12 20:44:37,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:38,022 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 0 proven. 328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:44:38,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:38,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-12 20:44:38,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-12 20:44:38,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-12 20:44:38,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-12 20:44:38,024 INFO L87 Difference]: Start difference. First operand 373 states and 381 transitions. Second operand 11 states. [2018-10-12 20:44:38,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:38,363 INFO L93 Difference]: Finished difference Result 545 states and 557 transitions. [2018-10-12 20:44:38,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-12 20:44:38,364 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 240 [2018-10-12 20:44:38,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:38,368 INFO L225 Difference]: With dead ends: 545 [2018-10-12 20:44:38,368 INFO L226 Difference]: Without dead ends: 545 [2018-10-12 20:44:38,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-10-12 20:44:38,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-10-12 20:44:38,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 460. [2018-10-12 20:44:38,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-10-12 20:44:38,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 470 transitions. [2018-10-12 20:44:38,385 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 470 transitions. Word has length 240 [2018-10-12 20:44:38,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:38,386 INFO L481 AbstractCegarLoop]: Abstraction has 460 states and 470 transitions. [2018-10-12 20:44:38,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-12 20:44:38,386 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 470 transitions. [2018-10-12 20:44:38,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-10-12 20:44:38,393 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:38,394 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:44:38,394 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:38,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:38,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1625471388, now seen corresponding path program 5 times [2018-10-12 20:44:38,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:38,875 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 0 proven. 545 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:44:38,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:38,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-12 20:44:38,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-12 20:44:38,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-12 20:44:38,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-10-12 20:44:38,878 INFO L87 Difference]: Start difference. First operand 460 states and 470 transitions. Second operand 13 states. [2018-10-12 20:44:39,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:39,411 INFO L93 Difference]: Finished difference Result 632 states and 646 transitions. [2018-10-12 20:44:39,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-12 20:44:39,412 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 294 [2018-10-12 20:44:39,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:39,415 INFO L225 Difference]: With dead ends: 632 [2018-10-12 20:44:39,415 INFO L226 Difference]: Without dead ends: 632 [2018-10-12 20:44:39,416 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2018-10-12 20:44:39,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2018-10-12 20:44:39,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 547. [2018-10-12 20:44:39,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2018-10-12 20:44:39,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 559 transitions. [2018-10-12 20:44:39,427 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 559 transitions. Word has length 294 [2018-10-12 20:44:39,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:39,428 INFO L481 AbstractCegarLoop]: Abstraction has 547 states and 559 transitions. [2018-10-12 20:44:39,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-12 20:44:39,428 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 559 transitions. [2018-10-12 20:44:39,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-10-12 20:44:39,433 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:39,433 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:44:39,434 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:39,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:39,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1777575910, now seen corresponding path program 6 times [2018-10-12 20:44:39,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:39,775 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 0 proven. 816 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:44:39,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:39,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-12 20:44:39,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-12 20:44:39,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-12 20:44:39,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-10-12 20:44:39,777 INFO L87 Difference]: Start difference. First operand 547 states and 559 transitions. Second operand 15 states. [2018-10-12 20:44:40,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:40,212 INFO L93 Difference]: Finished difference Result 719 states and 735 transitions. [2018-10-12 20:44:40,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-12 20:44:40,213 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 348 [2018-10-12 20:44:40,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:40,217 INFO L225 Difference]: With dead ends: 719 [2018-10-12 20:44:40,217 INFO L226 Difference]: Without dead ends: 719 [2018-10-12 20:44:40,218 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2018-10-12 20:44:40,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2018-10-12 20:44:40,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 634. [2018-10-12 20:44:40,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2018-10-12 20:44:40,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 648 transitions. [2018-10-12 20:44:40,229 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 648 transitions. Word has length 348 [2018-10-12 20:44:40,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:40,230 INFO L481 AbstractCegarLoop]: Abstraction has 634 states and 648 transitions. [2018-10-12 20:44:40,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-12 20:44:40,230 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 648 transitions. [2018-10-12 20:44:40,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-10-12 20:44:40,236 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:40,236 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:44:40,237 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:40,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:40,237 INFO L82 PathProgramCache]: Analyzing trace with hash 378891288, now seen corresponding path program 7 times [2018-10-12 20:44:40,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:41,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1141 backedges. 0 proven. 1141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:44:41,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:41,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-12 20:44:41,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-12 20:44:41,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-12 20:44:41,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-10-12 20:44:41,780 INFO L87 Difference]: Start difference. First operand 634 states and 648 transitions. Second operand 17 states. [2018-10-12 20:44:42,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:42,904 INFO L93 Difference]: Finished difference Result 806 states and 824 transitions. [2018-10-12 20:44:42,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-12 20:44:42,904 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 402 [2018-10-12 20:44:42,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:42,908 INFO L225 Difference]: With dead ends: 806 [2018-10-12 20:44:42,909 INFO L226 Difference]: Without dead ends: 806 [2018-10-12 20:44:42,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2018-10-12 20:44:42,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2018-10-12 20:44:42,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 721. [2018-10-12 20:44:42,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-10-12 20:44:42,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 737 transitions. [2018-10-12 20:44:42,922 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 737 transitions. Word has length 402 [2018-10-12 20:44:42,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:42,923 INFO L481 AbstractCegarLoop]: Abstraction has 721 states and 737 transitions. [2018-10-12 20:44:42,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-12 20:44:42,924 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 737 transitions. [2018-10-12 20:44:42,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2018-10-12 20:44:42,928 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:42,928 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:44:42,928 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:42,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:42,929 INFO L82 PathProgramCache]: Analyzing trace with hash 2053035414, now seen corresponding path program 8 times [2018-10-12 20:44:42,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:43,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:44:43,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:43,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-12 20:44:43,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-12 20:44:43,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-12 20:44:43,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-10-12 20:44:43,722 INFO L87 Difference]: Start difference. First operand 721 states and 737 transitions. Second operand 19 states. [2018-10-12 20:44:44,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:44,219 INFO L93 Difference]: Finished difference Result 893 states and 913 transitions. [2018-10-12 20:44:44,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-12 20:44:44,219 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 456 [2018-10-12 20:44:44,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:44,224 INFO L225 Difference]: With dead ends: 893 [2018-10-12 20:44:44,224 INFO L226 Difference]: Without dead ends: 893 [2018-10-12 20:44:44,225 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2018-10-12 20:44:44,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2018-10-12 20:44:44,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 808. [2018-10-12 20:44:44,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2018-10-12 20:44:44,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 826 transitions. [2018-10-12 20:44:44,238 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 826 transitions. Word has length 456 [2018-10-12 20:44:44,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:44,239 INFO L481 AbstractCegarLoop]: Abstraction has 808 states and 826 transitions. [2018-10-12 20:44:44,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-12 20:44:44,239 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 826 transitions. [2018-10-12 20:44:44,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2018-10-12 20:44:44,243 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:44,244 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:44:44,244 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:44,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:44,244 INFO L82 PathProgramCache]: Analyzing trace with hash 2078373012, now seen corresponding path program 9 times [2018-10-12 20:44:44,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:47,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:44:47,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:47,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-12 20:44:47,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-12 20:44:47,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-12 20:44:47,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-10-12 20:44:47,577 INFO L87 Difference]: Start difference. First operand 808 states and 826 transitions. Second operand 21 states. [2018-10-12 20:44:48,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:48,194 INFO L93 Difference]: Finished difference Result 980 states and 1002 transitions. [2018-10-12 20:44:48,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-12 20:44:48,195 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 510 [2018-10-12 20:44:48,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:48,199 INFO L225 Difference]: With dead ends: 980 [2018-10-12 20:44:48,200 INFO L226 Difference]: Without dead ends: 980 [2018-10-12 20:44:48,200 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=498, Invalid=984, Unknown=0, NotChecked=0, Total=1482 [2018-10-12 20:44:48,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2018-10-12 20:44:48,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 895. [2018-10-12 20:44:48,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-10-12 20:44:48,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 915 transitions. [2018-10-12 20:44:48,213 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 915 transitions. Word has length 510 [2018-10-12 20:44:48,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:48,214 INFO L481 AbstractCegarLoop]: Abstraction has 895 states and 915 transitions. [2018-10-12 20:44:48,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-12 20:44:48,215 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 915 transitions. [2018-10-12 20:44:48,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2018-10-12 20:44:48,219 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:48,219 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:44:48,219 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:48,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:48,220 INFO L82 PathProgramCache]: Analyzing trace with hash 372123922, now seen corresponding path program 10 times [2018-10-12 20:44:48,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:49,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2440 backedges. 0 proven. 2440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:44:49,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:49,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-12 20:44:49,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-12 20:44:49,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-12 20:44:49,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-10-12 20:44:49,385 INFO L87 Difference]: Start difference. First operand 895 states and 915 transitions. Second operand 23 states. [2018-10-12 20:44:50,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:50,029 INFO L93 Difference]: Finished difference Result 1067 states and 1091 transitions. [2018-10-12 20:44:50,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-12 20:44:50,029 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 564 [2018-10-12 20:44:50,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:50,036 INFO L225 Difference]: With dead ends: 1067 [2018-10-12 20:44:50,036 INFO L226 Difference]: Without dead ends: 1067 [2018-10-12 20:44:50,037 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=603, Invalid=1203, Unknown=0, NotChecked=0, Total=1806 [2018-10-12 20:44:50,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2018-10-12 20:44:50,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 982. [2018-10-12 20:44:50,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2018-10-12 20:44:50,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1004 transitions. [2018-10-12 20:44:50,075 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1004 transitions. Word has length 564 [2018-10-12 20:44:50,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:50,076 INFO L481 AbstractCegarLoop]: Abstraction has 982 states and 1004 transitions. [2018-10-12 20:44:50,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-12 20:44:50,076 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1004 transitions. [2018-10-12 20:44:50,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2018-10-12 20:44:50,082 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:50,083 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:44:50,083 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:50,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:50,084 INFO L82 PathProgramCache]: Analyzing trace with hash 586011408, now seen corresponding path program 11 times [2018-10-12 20:44:50,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:51,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2981 backedges. 0 proven. 2981 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:44:51,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:51,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-12 20:44:51,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-12 20:44:51,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-12 20:44:51,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-10-12 20:44:51,689 INFO L87 Difference]: Start difference. First operand 982 states and 1004 transitions. Second operand 25 states. [2018-10-12 20:44:52,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:52,384 INFO L93 Difference]: Finished difference Result 1154 states and 1180 transitions. [2018-10-12 20:44:52,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-12 20:44:52,384 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 618 [2018-10-12 20:44:52,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:52,390 INFO L225 Difference]: With dead ends: 1154 [2018-10-12 20:44:52,390 INFO L226 Difference]: Without dead ends: 1154 [2018-10-12 20:44:52,392 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=718, Invalid=1444, Unknown=0, NotChecked=0, Total=2162 [2018-10-12 20:44:52,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2018-10-12 20:44:52,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1069. [2018-10-12 20:44:52,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2018-10-12 20:44:52,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1093 transitions. [2018-10-12 20:44:52,407 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1093 transitions. Word has length 618 [2018-10-12 20:44:52,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:52,408 INFO L481 AbstractCegarLoop]: Abstraction has 1069 states and 1093 transitions. [2018-10-12 20:44:52,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-12 20:44:52,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1093 transitions. [2018-10-12 20:44:52,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2018-10-12 20:44:52,413 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:52,414 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:44:52,414 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:52,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:52,415 INFO L82 PathProgramCache]: Analyzing trace with hash 2019644046, now seen corresponding path program 12 times [2018-10-12 20:44:52,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:53,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3576 backedges. 0 proven. 3576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:44:53,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:53,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-12 20:44:53,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-12 20:44:53,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-12 20:44:53,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-10-12 20:44:53,699 INFO L87 Difference]: Start difference. First operand 1069 states and 1093 transitions. Second operand 27 states. [2018-10-12 20:44:54,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:54,404 INFO L93 Difference]: Finished difference Result 1241 states and 1269 transitions. [2018-10-12 20:44:54,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-12 20:44:54,404 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 672 [2018-10-12 20:44:54,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:54,409 INFO L225 Difference]: With dead ends: 1241 [2018-10-12 20:44:54,409 INFO L226 Difference]: Without dead ends: 1241 [2018-10-12 20:44:54,411 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=843, Invalid=1707, Unknown=0, NotChecked=0, Total=2550 [2018-10-12 20:44:54,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2018-10-12 20:44:54,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1156. [2018-10-12 20:44:54,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2018-10-12 20:44:54,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1182 transitions. [2018-10-12 20:44:54,428 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1182 transitions. Word has length 672 [2018-10-12 20:44:54,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:54,428 INFO L481 AbstractCegarLoop]: Abstraction has 1156 states and 1182 transitions. [2018-10-12 20:44:54,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-12 20:44:54,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1182 transitions. [2018-10-12 20:44:54,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 727 [2018-10-12 20:44:54,435 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:54,435 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:44:54,436 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:54,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:54,436 INFO L82 PathProgramCache]: Analyzing trace with hash -2023651444, now seen corresponding path program 13 times [2018-10-12 20:44:54,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:56,542 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:44:56,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:56,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-12 20:44:56,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-12 20:44:56,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-12 20:44:56,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-10-12 20:44:56,544 INFO L87 Difference]: Start difference. First operand 1156 states and 1182 transitions. Second operand 29 states. [2018-10-12 20:44:57,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:57,706 INFO L93 Difference]: Finished difference Result 1328 states and 1358 transitions. [2018-10-12 20:44:57,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-12 20:44:57,706 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 726 [2018-10-12 20:44:57,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:57,712 INFO L225 Difference]: With dead ends: 1328 [2018-10-12 20:44:57,712 INFO L226 Difference]: Without dead ends: 1328 [2018-10-12 20:44:57,714 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=978, Invalid=1992, Unknown=0, NotChecked=0, Total=2970 [2018-10-12 20:44:57,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2018-10-12 20:44:57,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1243. [2018-10-12 20:44:57,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1243 states. [2018-10-12 20:44:57,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1271 transitions. [2018-10-12 20:44:57,730 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 1271 transitions. Word has length 726 [2018-10-12 20:44:57,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:57,730 INFO L481 AbstractCegarLoop]: Abstraction has 1243 states and 1271 transitions. [2018-10-12 20:44:57,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-12 20:44:57,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1271 transitions. [2018-10-12 20:44:57,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2018-10-12 20:44:57,737 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:57,738 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:44:57,738 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:57,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:57,738 INFO L82 PathProgramCache]: Analyzing trace with hash 2036290058, now seen corresponding path program 14 times [2018-10-12 20:44:57,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:59,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4928 backedges. 0 proven. 4928 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:44:59,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:59,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-12 20:44:59,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-12 20:44:59,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-12 20:44:59,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2018-10-12 20:44:59,013 INFO L87 Difference]: Start difference. First operand 1243 states and 1271 transitions. Second operand 31 states. [2018-10-12 20:44:59,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:59,918 INFO L93 Difference]: Finished difference Result 1415 states and 1447 transitions. [2018-10-12 20:44:59,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-12 20:44:59,919 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 780 [2018-10-12 20:44:59,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:59,924 INFO L225 Difference]: With dead ends: 1415 [2018-10-12 20:44:59,925 INFO L226 Difference]: Without dead ends: 1415 [2018-10-12 20:44:59,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1123, Invalid=2299, Unknown=0, NotChecked=0, Total=3422 [2018-10-12 20:44:59,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2018-10-12 20:44:59,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1330. [2018-10-12 20:44:59,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1330 states. [2018-10-12 20:44:59,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1360 transitions. [2018-10-12 20:44:59,942 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1360 transitions. Word has length 780 [2018-10-12 20:44:59,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:59,942 INFO L481 AbstractCegarLoop]: Abstraction has 1330 states and 1360 transitions. [2018-10-12 20:44:59,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-12 20:44:59,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1360 transitions. [2018-10-12 20:44:59,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 835 [2018-10-12 20:44:59,950 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:59,951 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:44:59,951 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:59,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:59,951 INFO L82 PathProgramCache]: Analyzing trace with hash -832335352, now seen corresponding path program 15 times [2018-10-12 20:44:59,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:01,038 INFO L134 CoverageAnalysis]: Checked inductivity of 5685 backedges. 0 proven. 5685 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:45:01,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:01,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-12 20:45:01,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-12 20:45:01,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-12 20:45:01,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2018-10-12 20:45:01,040 INFO L87 Difference]: Start difference. First operand 1330 states and 1360 transitions. Second operand 33 states. [2018-10-12 20:45:01,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:01,865 INFO L93 Difference]: Finished difference Result 1502 states and 1536 transitions. [2018-10-12 20:45:01,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-12 20:45:01,866 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 834 [2018-10-12 20:45:01,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:01,871 INFO L225 Difference]: With dead ends: 1502 [2018-10-12 20:45:01,871 INFO L226 Difference]: Without dead ends: 1502 [2018-10-12 20:45:01,873 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1278, Invalid=2628, Unknown=0, NotChecked=0, Total=3906 [2018-10-12 20:45:01,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2018-10-12 20:45:01,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1417. [2018-10-12 20:45:01,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1417 states. [2018-10-12 20:45:01,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 1449 transitions. [2018-10-12 20:45:01,889 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 1449 transitions. Word has length 834 [2018-10-12 20:45:01,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:01,890 INFO L481 AbstractCegarLoop]: Abstraction has 1417 states and 1449 transitions. [2018-10-12 20:45:01,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-12 20:45:01,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1449 transitions. [2018-10-12 20:45:01,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 889 [2018-10-12 20:45:01,898 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:01,898 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:01,899 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:01,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:01,899 INFO L82 PathProgramCache]: Analyzing trace with hash 2064590726, now seen corresponding path program 16 times [2018-10-12 20:45:01,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:03,035 INFO L134 CoverageAnalysis]: Checked inductivity of 6496 backedges. 0 proven. 6496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:45:03,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:03,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-12 20:45:03,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-12 20:45:03,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-12 20:45:03,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-10-12 20:45:03,037 INFO L87 Difference]: Start difference. First operand 1417 states and 1449 transitions. Second operand 35 states. [2018-10-12 20:45:03,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:03,968 INFO L93 Difference]: Finished difference Result 1589 states and 1625 transitions. [2018-10-12 20:45:03,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-12 20:45:03,968 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 888 [2018-10-12 20:45:03,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:03,974 INFO L225 Difference]: With dead ends: 1589 [2018-10-12 20:45:03,974 INFO L226 Difference]: Without dead ends: 1589 [2018-10-12 20:45:03,976 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1443, Invalid=2979, Unknown=0, NotChecked=0, Total=4422 [2018-10-12 20:45:03,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2018-10-12 20:45:03,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1504. [2018-10-12 20:45:03,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1504 states. [2018-10-12 20:45:03,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 1538 transitions. [2018-10-12 20:45:03,998 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 1538 transitions. Word has length 888 [2018-10-12 20:45:03,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:03,999 INFO L481 AbstractCegarLoop]: Abstraction has 1504 states and 1538 transitions. [2018-10-12 20:45:03,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-12 20:45:03,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1538 transitions. [2018-10-12 20:45:04,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 943 [2018-10-12 20:45:04,012 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:04,012 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:04,013 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:04,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:04,013 INFO L82 PathProgramCache]: Analyzing trace with hash -2036665724, now seen corresponding path program 17 times [2018-10-12 20:45:04,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:05,558 INFO L134 CoverageAnalysis]: Checked inductivity of 7361 backedges. 0 proven. 7361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:45:05,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:05,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-12 20:45:05,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-12 20:45:05,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-12 20:45:05,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-10-12 20:45:05,560 INFO L87 Difference]: Start difference. First operand 1504 states and 1538 transitions. Second operand 37 states. [2018-10-12 20:45:06,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:06,574 INFO L93 Difference]: Finished difference Result 1676 states and 1714 transitions. [2018-10-12 20:45:06,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-12 20:45:06,574 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 942 [2018-10-12 20:45:06,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:06,581 INFO L225 Difference]: With dead ends: 1676 [2018-10-12 20:45:06,581 INFO L226 Difference]: Without dead ends: 1676 [2018-10-12 20:45:06,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1618, Invalid=3352, Unknown=0, NotChecked=0, Total=4970 [2018-10-12 20:45:06,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2018-10-12 20:45:06,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1591. [2018-10-12 20:45:06,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1591 states. [2018-10-12 20:45:06,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 1627 transitions. [2018-10-12 20:45:06,600 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 1627 transitions. Word has length 942 [2018-10-12 20:45:06,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:06,601 INFO L481 AbstractCegarLoop]: Abstraction has 1591 states and 1627 transitions. [2018-10-12 20:45:06,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-12 20:45:06,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 1627 transitions. [2018-10-12 20:45:06,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 997 [2018-10-12 20:45:06,610 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:06,611 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:06,611 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:06,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:06,611 INFO L82 PathProgramCache]: Analyzing trace with hash 685232898, now seen corresponding path program 18 times [2018-10-12 20:45:06,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:08,311 INFO L134 CoverageAnalysis]: Checked inductivity of 8280 backedges. 0 proven. 8280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:45:08,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:08,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-12 20:45:08,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-12 20:45:08,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-12 20:45:08,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-10-12 20:45:08,314 INFO L87 Difference]: Start difference. First operand 1591 states and 1627 transitions. Second operand 39 states. [2018-10-12 20:45:09,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:09,404 INFO L93 Difference]: Finished difference Result 1763 states and 1803 transitions. [2018-10-12 20:45:09,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-12 20:45:09,405 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 996 [2018-10-12 20:45:09,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:09,411 INFO L225 Difference]: With dead ends: 1763 [2018-10-12 20:45:09,411 INFO L226 Difference]: Without dead ends: 1763 [2018-10-12 20:45:09,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1803, Invalid=3747, Unknown=0, NotChecked=0, Total=5550 [2018-10-12 20:45:09,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2018-10-12 20:45:09,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1678. [2018-10-12 20:45:09,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1678 states. [2018-10-12 20:45:09,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 1716 transitions. [2018-10-12 20:45:09,430 INFO L78 Accepts]: Start accepts. Automaton has 1678 states and 1716 transitions. Word has length 996 [2018-10-12 20:45:09,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:09,431 INFO L481 AbstractCegarLoop]: Abstraction has 1678 states and 1716 transitions. [2018-10-12 20:45:09,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-12 20:45:09,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 1716 transitions. [2018-10-12 20:45:09,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1051 [2018-10-12 20:45:09,442 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:09,442 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:09,442 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:09,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:09,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1747888384, now seen corresponding path program 19 times [2018-10-12 20:45:09,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:10,916 INFO L134 CoverageAnalysis]: Checked inductivity of 9253 backedges. 0 proven. 9253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:45:10,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:10,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-12 20:45:10,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-12 20:45:10,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-12 20:45:10,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2018-10-12 20:45:10,918 INFO L87 Difference]: Start difference. First operand 1678 states and 1716 transitions. Second operand 41 states. [2018-10-12 20:45:12,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:12,145 INFO L93 Difference]: Finished difference Result 1850 states and 1892 transitions. [2018-10-12 20:45:12,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-12 20:45:12,145 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 1050 [2018-10-12 20:45:12,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:12,152 INFO L225 Difference]: With dead ends: 1850 [2018-10-12 20:45:12,152 INFO L226 Difference]: Without dead ends: 1850 [2018-10-12 20:45:12,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1998, Invalid=4164, Unknown=0, NotChecked=0, Total=6162 [2018-10-12 20:45:12,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2018-10-12 20:45:12,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1765. [2018-10-12 20:45:12,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1765 states. [2018-10-12 20:45:12,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 1805 transitions. [2018-10-12 20:45:12,172 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 1805 transitions. Word has length 1050 [2018-10-12 20:45:12,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:12,173 INFO L481 AbstractCegarLoop]: Abstraction has 1765 states and 1805 transitions. [2018-10-12 20:45:12,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-12 20:45:12,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 1805 transitions. [2018-10-12 20:45:12,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1105 [2018-10-12 20:45:12,184 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:12,185 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:12,185 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:12,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:12,186 INFO L82 PathProgramCache]: Analyzing trace with hash 933254270, now seen corresponding path program 20 times [2018-10-12 20:45:12,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:13,792 INFO L134 CoverageAnalysis]: Checked inductivity of 10280 backedges. 0 proven. 10280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:45:13,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:13,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-12 20:45:13,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-12 20:45:13,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-12 20:45:13,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2018-10-12 20:45:13,794 INFO L87 Difference]: Start difference. First operand 1765 states and 1805 transitions. Second operand 43 states. [2018-10-12 20:45:15,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:15,052 INFO L93 Difference]: Finished difference Result 1937 states and 1981 transitions. [2018-10-12 20:45:15,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-12 20:45:15,053 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 1104 [2018-10-12 20:45:15,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:15,060 INFO L225 Difference]: With dead ends: 1937 [2018-10-12 20:45:15,060 INFO L226 Difference]: Without dead ends: 1937 [2018-10-12 20:45:15,062 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2203, Invalid=4603, Unknown=0, NotChecked=0, Total=6806 [2018-10-12 20:45:15,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1937 states. [2018-10-12 20:45:15,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1937 to 1852. [2018-10-12 20:45:15,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1852 states. [2018-10-12 20:45:15,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1852 states and 1894 transitions. [2018-10-12 20:45:15,077 INFO L78 Accepts]: Start accepts. Automaton has 1852 states and 1894 transitions. Word has length 1104 [2018-10-12 20:45:15,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:15,078 INFO L481 AbstractCegarLoop]: Abstraction has 1852 states and 1894 transitions. [2018-10-12 20:45:15,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-12 20:45:15,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 1894 transitions. [2018-10-12 20:45:15,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1159 [2018-10-12 20:45:15,091 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:15,091 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:15,091 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:15,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:15,092 INFO L82 PathProgramCache]: Analyzing trace with hash 348501372, now seen corresponding path program 21 times [2018-10-12 20:45:15,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:17,187 INFO L134 CoverageAnalysis]: Checked inductivity of 11361 backedges. 0 proven. 11361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:45:17,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:17,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-12 20:45:17,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-12 20:45:17,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-12 20:45:17,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2018-10-12 20:45:17,190 INFO L87 Difference]: Start difference. First operand 1852 states and 1894 transitions. Second operand 45 states. [2018-10-12 20:45:18,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:18,904 INFO L93 Difference]: Finished difference Result 2024 states and 2070 transitions. [2018-10-12 20:45:18,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-12 20:45:18,911 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 1158 [2018-10-12 20:45:18,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:18,919 INFO L225 Difference]: With dead ends: 2024 [2018-10-12 20:45:18,919 INFO L226 Difference]: Without dead ends: 2024 [2018-10-12 20:45:18,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2418, Invalid=5064, Unknown=0, NotChecked=0, Total=7482 [2018-10-12 20:45:18,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2024 states. [2018-10-12 20:45:18,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2024 to 1939. [2018-10-12 20:45:18,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1939 states. [2018-10-12 20:45:18,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 1983 transitions. [2018-10-12 20:45:18,938 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 1983 transitions. Word has length 1158 [2018-10-12 20:45:18,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:18,939 INFO L481 AbstractCegarLoop]: Abstraction has 1939 states and 1983 transitions. [2018-10-12 20:45:18,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-12 20:45:18,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 1983 transitions. [2018-10-12 20:45:18,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2018-10-12 20:45:18,952 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:18,953 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:18,953 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:18,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:18,954 INFO L82 PathProgramCache]: Analyzing trace with hash 634366970, now seen corresponding path program 22 times [2018-10-12 20:45:18,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:19,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:21,017 INFO L134 CoverageAnalysis]: Checked inductivity of 12496 backedges. 0 proven. 12496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:45:21,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:21,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-12 20:45:21,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-12 20:45:21,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-12 20:45:21,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2018-10-12 20:45:21,020 INFO L87 Difference]: Start difference. First operand 1939 states and 1983 transitions. Second operand 47 states. [2018-10-12 20:45:22,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:22,965 INFO L93 Difference]: Finished difference Result 2111 states and 2159 transitions. [2018-10-12 20:45:22,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-12 20:45:22,966 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 1212 [2018-10-12 20:45:22,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:22,973 INFO L225 Difference]: With dead ends: 2111 [2018-10-12 20:45:22,973 INFO L226 Difference]: Without dead ends: 2111 [2018-10-12 20:45:22,974 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2643, Invalid=5547, Unknown=0, NotChecked=0, Total=8190 [2018-10-12 20:45:22,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2018-10-12 20:45:22,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 2026. [2018-10-12 20:45:22,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2026 states. [2018-10-12 20:45:22,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 2072 transitions. [2018-10-12 20:45:22,988 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 2072 transitions. Word has length 1212 [2018-10-12 20:45:22,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:22,989 INFO L481 AbstractCegarLoop]: Abstraction has 2026 states and 2072 transitions. [2018-10-12 20:45:22,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-12 20:45:22,989 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2072 transitions. [2018-10-12 20:45:23,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1267 [2018-10-12 20:45:23,002 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:23,002 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:23,003 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:23,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:23,003 INFO L82 PathProgramCache]: Analyzing trace with hash -679012360, now seen corresponding path program 23 times [2018-10-12 20:45:23,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:25,134 INFO L134 CoverageAnalysis]: Checked inductivity of 13685 backedges. 0 proven. 13685 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:45:25,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:25,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-12 20:45:25,136 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-12 20:45:25,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-12 20:45:25,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2018-10-12 20:45:25,137 INFO L87 Difference]: Start difference. First operand 2026 states and 2072 transitions. Second operand 49 states. [2018-10-12 20:45:26,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:26,770 INFO L93 Difference]: Finished difference Result 2198 states and 2248 transitions. [2018-10-12 20:45:26,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-12 20:45:26,770 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 1266 [2018-10-12 20:45:26,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:26,778 INFO L225 Difference]: With dead ends: 2198 [2018-10-12 20:45:26,778 INFO L226 Difference]: Without dead ends: 2198 [2018-10-12 20:45:26,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2878, Invalid=6052, Unknown=0, NotChecked=0, Total=8930 [2018-10-12 20:45:26,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2198 states. [2018-10-12 20:45:26,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2198 to 2113. [2018-10-12 20:45:26,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2113 states. [2018-10-12 20:45:26,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 2113 states and 2161 transitions. [2018-10-12 20:45:26,797 INFO L78 Accepts]: Start accepts. Automaton has 2113 states and 2161 transitions. Word has length 1266 [2018-10-12 20:45:26,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:26,798 INFO L481 AbstractCegarLoop]: Abstraction has 2113 states and 2161 transitions. [2018-10-12 20:45:26,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-12 20:45:26,798 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 2161 transitions. [2018-10-12 20:45:26,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1321 [2018-10-12 20:45:26,810 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:26,810 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:26,810 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:26,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:26,811 INFO L82 PathProgramCache]: Analyzing trace with hash -78849674, now seen corresponding path program 24 times [2018-10-12 20:45:26,812 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:29,100 INFO L134 CoverageAnalysis]: Checked inductivity of 14928 backedges. 0 proven. 14928 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:45:29,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:29,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-12 20:45:29,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-12 20:45:29,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-12 20:45:29,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-10-12 20:45:29,103 INFO L87 Difference]: Start difference. First operand 2113 states and 2161 transitions. Second operand 51 states. [2018-10-12 20:45:31,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:31,139 INFO L93 Difference]: Finished difference Result 2285 states and 2337 transitions. [2018-10-12 20:45:31,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-12 20:45:31,140 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 1320 [2018-10-12 20:45:31,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:31,150 INFO L225 Difference]: With dead ends: 2285 [2018-10-12 20:45:31,150 INFO L226 Difference]: Without dead ends: 2285 [2018-10-12 20:45:31,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3123, Invalid=6579, Unknown=0, NotChecked=0, Total=9702 [2018-10-12 20:45:31,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2285 states. [2018-10-12 20:45:31,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2285 to 2200. [2018-10-12 20:45:31,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2200 states. [2018-10-12 20:45:31,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 2200 states and 2250 transitions. [2018-10-12 20:45:31,181 INFO L78 Accepts]: Start accepts. Automaton has 2200 states and 2250 transitions. Word has length 1320 [2018-10-12 20:45:31,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:31,182 INFO L481 AbstractCegarLoop]: Abstraction has 2200 states and 2250 transitions. [2018-10-12 20:45:31,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-12 20:45:31,182 INFO L276 IsEmpty]: Start isEmpty. Operand 2200 states and 2250 transitions. [2018-10-12 20:45:31,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1375 [2018-10-12 20:45:31,210 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:31,210 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:31,211 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:31,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:31,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1696190580, now seen corresponding path program 25 times [2018-10-12 20:45:31,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:33,562 INFO L134 CoverageAnalysis]: Checked inductivity of 16225 backedges. 0 proven. 16225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:45:33,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:33,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-12 20:45:33,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-12 20:45:33,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-12 20:45:33,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2018-10-12 20:45:33,565 INFO L87 Difference]: Start difference. First operand 2200 states and 2250 transitions. Second operand 53 states. [2018-10-12 20:45:35,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:35,377 INFO L93 Difference]: Finished difference Result 2372 states and 2426 transitions. [2018-10-12 20:45:35,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-12 20:45:35,384 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 1374 [2018-10-12 20:45:35,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:35,390 INFO L225 Difference]: With dead ends: 2372 [2018-10-12 20:45:35,390 INFO L226 Difference]: Without dead ends: 2372 [2018-10-12 20:45:35,392 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1825 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3378, Invalid=7128, Unknown=0, NotChecked=0, Total=10506 [2018-10-12 20:45:35,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2372 states. [2018-10-12 20:45:35,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2372 to 2287. [2018-10-12 20:45:35,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2287 states. [2018-10-12 20:45:35,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 2287 states and 2339 transitions. [2018-10-12 20:45:35,412 INFO L78 Accepts]: Start accepts. Automaton has 2287 states and 2339 transitions. Word has length 1374 [2018-10-12 20:45:35,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:35,413 INFO L481 AbstractCegarLoop]: Abstraction has 2287 states and 2339 transitions. [2018-10-12 20:45:35,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-12 20:45:35,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 2339 transitions. [2018-10-12 20:45:35,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1429 [2018-10-12 20:45:35,428 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:35,429 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:35,429 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:35,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:35,430 INFO L82 PathProgramCache]: Analyzing trace with hash 159309042, now seen corresponding path program 26 times [2018-10-12 20:45:35,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:35,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:38,186 INFO L134 CoverageAnalysis]: Checked inductivity of 17576 backedges. 0 proven. 17576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:45:38,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:38,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-12 20:45:38,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-12 20:45:38,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-12 20:45:38,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2018-10-12 20:45:38,188 INFO L87 Difference]: Start difference. First operand 2287 states and 2339 transitions. Second operand 55 states. [2018-10-12 20:45:40,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:40,250 INFO L93 Difference]: Finished difference Result 2459 states and 2515 transitions. [2018-10-12 20:45:40,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-12 20:45:40,250 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 1428 [2018-10-12 20:45:40,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:40,256 INFO L225 Difference]: With dead ends: 2459 [2018-10-12 20:45:40,256 INFO L226 Difference]: Without dead ends: 2459 [2018-10-12 20:45:40,257 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1976 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3643, Invalid=7699, Unknown=0, NotChecked=0, Total=11342 [2018-10-12 20:45:40,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2459 states. [2018-10-12 20:45:40,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2459 to 2374. [2018-10-12 20:45:40,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2374 states. [2018-10-12 20:45:40,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2374 states to 2374 states and 2428 transitions. [2018-10-12 20:45:40,273 INFO L78 Accepts]: Start accepts. Automaton has 2374 states and 2428 transitions. Word has length 1428 [2018-10-12 20:45:40,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:40,274 INFO L481 AbstractCegarLoop]: Abstraction has 2374 states and 2428 transitions. [2018-10-12 20:45:40,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-12 20:45:40,274 INFO L276 IsEmpty]: Start isEmpty. Operand 2374 states and 2428 transitions. [2018-10-12 20:45:40,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1483 [2018-10-12 20:45:40,286 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:40,287 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:40,287 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:40,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:40,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1683693840, now seen corresponding path program 27 times [2018-10-12 20:45:40,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:42,914 INFO L134 CoverageAnalysis]: Checked inductivity of 18981 backedges. 0 proven. 18981 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:45:42,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:42,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-12 20:45:42,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-12 20:45:42,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-12 20:45:42,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2018-10-12 20:45:42,916 INFO L87 Difference]: Start difference. First operand 2374 states and 2428 transitions. Second operand 57 states. [2018-10-12 20:45:45,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:45,295 INFO L93 Difference]: Finished difference Result 2546 states and 2604 transitions. [2018-10-12 20:45:45,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-12 20:45:45,295 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 1482 [2018-10-12 20:45:45,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:45,299 INFO L225 Difference]: With dead ends: 2546 [2018-10-12 20:45:45,299 INFO L226 Difference]: Without dead ends: 2546 [2018-10-12 20:45:45,300 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3918, Invalid=8292, Unknown=0, NotChecked=0, Total=12210 [2018-10-12 20:45:45,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2018-10-12 20:45:45,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2461. [2018-10-12 20:45:45,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2461 states. [2018-10-12 20:45:45,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2461 states to 2461 states and 2517 transitions. [2018-10-12 20:45:45,315 INFO L78 Accepts]: Start accepts. Automaton has 2461 states and 2517 transitions. Word has length 1482 [2018-10-12 20:45:45,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:45,315 INFO L481 AbstractCegarLoop]: Abstraction has 2461 states and 2517 transitions. [2018-10-12 20:45:45,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-12 20:45:45,316 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 2517 transitions. [2018-10-12 20:45:45,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1537 [2018-10-12 20:45:45,329 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:45,330 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:45,330 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:45,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:45,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1421035922, now seen corresponding path program 28 times [2018-10-12 20:45:45,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:48,011 INFO L134 CoverageAnalysis]: Checked inductivity of 20440 backedges. 0 proven. 20440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:45:48,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:48,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-12 20:45:48,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-12 20:45:48,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-12 20:45:48,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2018-10-12 20:45:48,013 INFO L87 Difference]: Start difference. First operand 2461 states and 2517 transitions. Second operand 59 states. [2018-10-12 20:45:50,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:50,635 INFO L93 Difference]: Finished difference Result 2633 states and 2693 transitions. [2018-10-12 20:45:50,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-12 20:45:50,635 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 1536 [2018-10-12 20:45:50,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:50,640 INFO L225 Difference]: With dead ends: 2633 [2018-10-12 20:45:50,640 INFO L226 Difference]: Without dead ends: 2633 [2018-10-12 20:45:50,642 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4203, Invalid=8907, Unknown=0, NotChecked=0, Total=13110 [2018-10-12 20:45:50,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2633 states. [2018-10-12 20:45:50,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2633 to 2548. [2018-10-12 20:45:50,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2548 states. [2018-10-12 20:45:50,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 2606 transitions. [2018-10-12 20:45:50,658 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 2606 transitions. Word has length 1536 [2018-10-12 20:45:50,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:50,659 INFO L481 AbstractCegarLoop]: Abstraction has 2548 states and 2606 transitions. [2018-10-12 20:45:50,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-12 20:45:50,659 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 2606 transitions. [2018-10-12 20:45:50,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1591 [2018-10-12 20:45:50,673 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:50,674 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:50,674 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:50,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:50,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1120879468, now seen corresponding path program 29 times [2018-10-12 20:45:50,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:50,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:53,980 INFO L134 CoverageAnalysis]: Checked inductivity of 21953 backedges. 0 proven. 21953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:45:53,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:53,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-12 20:45:53,982 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-12 20:45:53,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-12 20:45:53,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2018-10-12 20:45:53,982 INFO L87 Difference]: Start difference. First operand 2548 states and 2606 transitions. Second operand 61 states. [2018-10-12 20:45:56,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:56,619 INFO L93 Difference]: Finished difference Result 2720 states and 2782 transitions. [2018-10-12 20:45:56,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-12 20:45:56,619 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 1590 [2018-10-12 20:45:56,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:56,625 INFO L225 Difference]: With dead ends: 2720 [2018-10-12 20:45:56,625 INFO L226 Difference]: Without dead ends: 2720 [2018-10-12 20:45:56,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2465 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4498, Invalid=9544, Unknown=0, NotChecked=0, Total=14042 [2018-10-12 20:45:56,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2018-10-12 20:45:56,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 2635. [2018-10-12 20:45:56,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2635 states. [2018-10-12 20:45:56,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 2695 transitions. [2018-10-12 20:45:56,648 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 2695 transitions. Word has length 1590 [2018-10-12 20:45:56,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:56,649 INFO L481 AbstractCegarLoop]: Abstraction has 2635 states and 2695 transitions. [2018-10-12 20:45:56,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-12 20:45:56,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 2695 transitions. [2018-10-12 20:45:56,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1645 [2018-10-12 20:45:56,671 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:56,672 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:56,672 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:56,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:56,673 INFO L82 PathProgramCache]: Analyzing trace with hash 85812714, now seen corresponding path program 30 times [2018-10-12 20:45:56,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:00,325 INFO L134 CoverageAnalysis]: Checked inductivity of 23520 backedges. 0 proven. 23520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:46:00,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:00,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-12 20:46:00,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-12 20:46:00,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-12 20:46:00,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-10-12 20:46:00,328 INFO L87 Difference]: Start difference. First operand 2635 states and 2695 transitions. Second operand 63 states. [2018-10-12 20:46:02,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:02,917 INFO L93 Difference]: Finished difference Result 2807 states and 2871 transitions. [2018-10-12 20:46:02,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-12 20:46:02,917 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 1644 [2018-10-12 20:46:02,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:02,922 INFO L225 Difference]: With dead ends: 2807 [2018-10-12 20:46:02,922 INFO L226 Difference]: Without dead ends: 2807 [2018-10-12 20:46:02,923 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2640 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4803, Invalid=10203, Unknown=0, NotChecked=0, Total=15006 [2018-10-12 20:46:02,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2807 states. [2018-10-12 20:46:02,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2807 to 2722. [2018-10-12 20:46:02,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2722 states. [2018-10-12 20:46:02,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2722 states to 2722 states and 2784 transitions. [2018-10-12 20:46:02,945 INFO L78 Accepts]: Start accepts. Automaton has 2722 states and 2784 transitions. Word has length 1644 [2018-10-12 20:46:02,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:02,947 INFO L481 AbstractCegarLoop]: Abstraction has 2722 states and 2784 transitions. [2018-10-12 20:46:02,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-12 20:46:02,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2722 states and 2784 transitions. [2018-10-12 20:46:02,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1699 [2018-10-12 20:46:02,973 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:02,973 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:46:02,974 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:02,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:02,974 INFO L82 PathProgramCache]: Analyzing trace with hash -876610072, now seen corresponding path program 31 times [2018-10-12 20:46:02,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:06,408 INFO L134 CoverageAnalysis]: Checked inductivity of 25141 backedges. 0 proven. 25141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:46:06,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:06,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-12 20:46:06,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-12 20:46:06,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-12 20:46:06,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2018-10-12 20:46:06,411 INFO L87 Difference]: Start difference. First operand 2722 states and 2784 transitions. Second operand 65 states. [2018-10-12 20:46:09,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:09,572 INFO L93 Difference]: Finished difference Result 2894 states and 2960 transitions. [2018-10-12 20:46:09,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-12 20:46:09,572 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 1698 [2018-10-12 20:46:09,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:09,578 INFO L225 Difference]: With dead ends: 2894 [2018-10-12 20:46:09,578 INFO L226 Difference]: Without dead ends: 2894 [2018-10-12 20:46:09,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2821 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5118, Invalid=10884, Unknown=0, NotChecked=0, Total=16002 [2018-10-12 20:46:09,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2018-10-12 20:46:09,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 2809. [2018-10-12 20:46:09,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2809 states. [2018-10-12 20:46:09,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2809 states to 2809 states and 2873 transitions. [2018-10-12 20:46:09,603 INFO L78 Accepts]: Start accepts. Automaton has 2809 states and 2873 transitions. Word has length 1698 [2018-10-12 20:46:09,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:09,604 INFO L481 AbstractCegarLoop]: Abstraction has 2809 states and 2873 transitions. [2018-10-12 20:46:09,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-12 20:46:09,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2809 states and 2873 transitions. [2018-10-12 20:46:09,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1753 [2018-10-12 20:46:09,630 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:09,630 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:46:09,631 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:09,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:09,631 INFO L82 PathProgramCache]: Analyzing trace with hash -992482458, now seen corresponding path program 32 times [2018-10-12 20:46:09,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:13,120 INFO L134 CoverageAnalysis]: Checked inductivity of 26816 backedges. 0 proven. 26816 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:46:13,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:13,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-12 20:46:13,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-12 20:46:13,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-12 20:46:13,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2018-10-12 20:46:13,123 INFO L87 Difference]: Start difference. First operand 2809 states and 2873 transitions. Second operand 67 states. [2018-10-12 20:46:16,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:16,479 INFO L93 Difference]: Finished difference Result 2981 states and 3049 transitions. [2018-10-12 20:46:16,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-12 20:46:16,480 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 1752 [2018-10-12 20:46:16,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:16,484 INFO L225 Difference]: With dead ends: 2981 [2018-10-12 20:46:16,484 INFO L226 Difference]: Without dead ends: 2981 [2018-10-12 20:46:16,486 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3008 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5443, Invalid=11587, Unknown=0, NotChecked=0, Total=17030 [2018-10-12 20:46:16,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2018-10-12 20:46:16,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 2896. [2018-10-12 20:46:16,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2896 states. [2018-10-12 20:46:16,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2896 states to 2896 states and 2962 transitions. [2018-10-12 20:46:16,509 INFO L78 Accepts]: Start accepts. Automaton has 2896 states and 2962 transitions. Word has length 1752 [2018-10-12 20:46:16,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:16,510 INFO L481 AbstractCegarLoop]: Abstraction has 2896 states and 2962 transitions. [2018-10-12 20:46:16,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-12 20:46:16,510 INFO L276 IsEmpty]: Start isEmpty. Operand 2896 states and 2962 transitions. [2018-10-12 20:46:16,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1807 [2018-10-12 20:46:16,536 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:16,537 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:46:16,537 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:16,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:16,538 INFO L82 PathProgramCache]: Analyzing trace with hash 287182436, now seen corresponding path program 33 times [2018-10-12 20:46:16,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:20,230 INFO L134 CoverageAnalysis]: Checked inductivity of 28545 backedges. 0 proven. 28545 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:46:20,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:20,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-12 20:46:20,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-12 20:46:20,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-12 20:46:20,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2018-10-12 20:46:20,232 INFO L87 Difference]: Start difference. First operand 2896 states and 2962 transitions. Second operand 69 states. [2018-10-12 20:46:23,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:23,501 INFO L93 Difference]: Finished difference Result 3068 states and 3138 transitions. [2018-10-12 20:46:23,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-12 20:46:23,502 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 1806 [2018-10-12 20:46:23,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:23,504 INFO L225 Difference]: With dead ends: 3068 [2018-10-12 20:46:23,504 INFO L226 Difference]: Without dead ends: 3068 [2018-10-12 20:46:23,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3201 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5778, Invalid=12312, Unknown=0, NotChecked=0, Total=18090 [2018-10-12 20:46:23,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2018-10-12 20:46:23,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 2983. [2018-10-12 20:46:23,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2983 states. [2018-10-12 20:46:23,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2983 states to 2983 states and 3051 transitions. [2018-10-12 20:46:23,526 INFO L78 Accepts]: Start accepts. Automaton has 2983 states and 3051 transitions. Word has length 1806 [2018-10-12 20:46:23,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:23,527 INFO L481 AbstractCegarLoop]: Abstraction has 2983 states and 3051 transitions. [2018-10-12 20:46:23,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-12 20:46:23,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2983 states and 3051 transitions. [2018-10-12 20:46:23,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1861 [2018-10-12 20:46:23,557 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:23,558 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:46:23,558 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:23,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:23,559 INFO L82 PathProgramCache]: Analyzing trace with hash -505198878, now seen corresponding path program 34 times [2018-10-12 20:46:23,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:27,422 INFO L134 CoverageAnalysis]: Checked inductivity of 30328 backedges. 0 proven. 30328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:46:27,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:27,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-12 20:46:27,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-12 20:46:27,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-12 20:46:27,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2018-10-12 20:46:27,424 INFO L87 Difference]: Start difference. First operand 2983 states and 3051 transitions. Second operand 71 states. [2018-10-12 20:46:30,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:30,841 INFO L93 Difference]: Finished difference Result 3155 states and 3227 transitions. [2018-10-12 20:46:30,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-12 20:46:30,841 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 1860 [2018-10-12 20:46:30,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:30,845 INFO L225 Difference]: With dead ends: 3155 [2018-10-12 20:46:30,845 INFO L226 Difference]: Without dead ends: 3155 [2018-10-12 20:46:30,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3400 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6123, Invalid=13059, Unknown=0, NotChecked=0, Total=19182 [2018-10-12 20:46:30,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3155 states. [2018-10-12 20:46:30,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3155 to 3070. [2018-10-12 20:46:30,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3070 states. [2018-10-12 20:46:30,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3070 states to 3070 states and 3140 transitions. [2018-10-12 20:46:30,864 INFO L78 Accepts]: Start accepts. Automaton has 3070 states and 3140 transitions. Word has length 1860 [2018-10-12 20:46:30,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:30,865 INFO L481 AbstractCegarLoop]: Abstraction has 3070 states and 3140 transitions. [2018-10-12 20:46:30,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-12 20:46:30,865 INFO L276 IsEmpty]: Start isEmpty. Operand 3070 states and 3140 transitions. [2018-10-12 20:46:30,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1915 [2018-10-12 20:46:30,885 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:30,886 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:46:30,886 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:30,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:30,886 INFO L82 PathProgramCache]: Analyzing trace with hash 386954464, now seen corresponding path program 35 times [2018-10-12 20:46:30,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:34,718 INFO L134 CoverageAnalysis]: Checked inductivity of 32165 backedges. 0 proven. 32165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:46:34,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:34,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-12 20:46:34,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-12 20:46:34,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-12 20:46:34,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2018-10-12 20:46:34,722 INFO L87 Difference]: Start difference. First operand 3070 states and 3140 transitions. Second operand 73 states. [2018-10-12 20:46:38,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:38,627 INFO L93 Difference]: Finished difference Result 3242 states and 3316 transitions. [2018-10-12 20:46:38,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-12 20:46:38,627 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 1914 [2018-10-12 20:46:38,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:38,630 INFO L225 Difference]: With dead ends: 3242 [2018-10-12 20:46:38,630 INFO L226 Difference]: Without dead ends: 3242 [2018-10-12 20:46:38,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3605 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=6478, Invalid=13828, Unknown=0, NotChecked=0, Total=20306 [2018-10-12 20:46:38,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3242 states. [2018-10-12 20:46:38,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3242 to 3157. [2018-10-12 20:46:38,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3157 states. [2018-10-12 20:46:38,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3157 states to 3157 states and 3229 transitions. [2018-10-12 20:46:38,646 INFO L78 Accepts]: Start accepts. Automaton has 3157 states and 3229 transitions. Word has length 1914 [2018-10-12 20:46:38,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:38,647 INFO L481 AbstractCegarLoop]: Abstraction has 3157 states and 3229 transitions. [2018-10-12 20:46:38,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-12 20:46:38,647 INFO L276 IsEmpty]: Start isEmpty. Operand 3157 states and 3229 transitions. [2018-10-12 20:46:38,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1969 [2018-10-12 20:46:38,670 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:38,670 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:46:38,671 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:38,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:38,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1562802270, now seen corresponding path program 36 times [2018-10-12 20:46:38,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:43,174 INFO L134 CoverageAnalysis]: Checked inductivity of 34056 backedges. 0 proven. 34056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:46:43,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:43,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-12 20:46:43,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-12 20:46:43,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-12 20:46:43,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-10-12 20:46:43,177 INFO L87 Difference]: Start difference. First operand 3157 states and 3229 transitions. Second operand 75 states. [2018-10-12 20:46:46,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:46,993 INFO L93 Difference]: Finished difference Result 3329 states and 3405 transitions. [2018-10-12 20:46:46,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-12 20:46:46,993 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 1968 [2018-10-12 20:46:46,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:46,997 INFO L225 Difference]: With dead ends: 3329 [2018-10-12 20:46:46,997 INFO L226 Difference]: Without dead ends: 3329 [2018-10-12 20:46:46,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3816 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6843, Invalid=14619, Unknown=0, NotChecked=0, Total=21462 [2018-10-12 20:46:47,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2018-10-12 20:46:47,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3244. [2018-10-12 20:46:47,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3244 states. [2018-10-12 20:46:47,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3244 states to 3244 states and 3318 transitions. [2018-10-12 20:46:47,017 INFO L78 Accepts]: Start accepts. Automaton has 3244 states and 3318 transitions. Word has length 1968 [2018-10-12 20:46:47,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:47,018 INFO L481 AbstractCegarLoop]: Abstraction has 3244 states and 3318 transitions. [2018-10-12 20:46:47,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-12 20:46:47,018 INFO L276 IsEmpty]: Start isEmpty. Operand 3244 states and 3318 transitions. [2018-10-12 20:46:47,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2023 [2018-10-12 20:46:47,042 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:47,043 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:46:47,043 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:47,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:47,044 INFO L82 PathProgramCache]: Analyzing trace with hash -885116580, now seen corresponding path program 37 times [2018-10-12 20:46:47,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:51,284 INFO L134 CoverageAnalysis]: Checked inductivity of 36001 backedges. 0 proven. 36001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:46:51,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:51,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-12 20:46:51,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-12 20:46:51,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-12 20:46:51,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2018-10-12 20:46:51,287 INFO L87 Difference]: Start difference. First operand 3244 states and 3318 transitions. Second operand 77 states. [2018-10-12 20:46:55,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:55,242 INFO L93 Difference]: Finished difference Result 3416 states and 3494 transitions. [2018-10-12 20:46:55,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-12 20:46:55,243 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 2022 [2018-10-12 20:46:55,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:55,246 INFO L225 Difference]: With dead ends: 3416 [2018-10-12 20:46:55,246 INFO L226 Difference]: Without dead ends: 3416 [2018-10-12 20:46:55,248 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4033 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7218, Invalid=15432, Unknown=0, NotChecked=0, Total=22650 [2018-10-12 20:46:55,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3416 states. [2018-10-12 20:46:55,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3416 to 3331. [2018-10-12 20:46:55,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3331 states. [2018-10-12 20:46:55,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3331 states to 3331 states and 3407 transitions. [2018-10-12 20:46:55,266 INFO L78 Accepts]: Start accepts. Automaton has 3331 states and 3407 transitions. Word has length 2022 [2018-10-12 20:46:55,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:55,267 INFO L481 AbstractCegarLoop]: Abstraction has 3331 states and 3407 transitions. [2018-10-12 20:46:55,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-12 20:46:55,267 INFO L276 IsEmpty]: Start isEmpty. Operand 3331 states and 3407 transitions. [2018-10-12 20:46:55,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2077 [2018-10-12 20:46:55,292 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:55,292 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:46:55,293 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:55,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:55,293 INFO L82 PathProgramCache]: Analyzing trace with hash 17334234, now seen corresponding path program 38 times [2018-10-12 20:46:55,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:59,773 INFO L134 CoverageAnalysis]: Checked inductivity of 38000 backedges. 0 proven. 38000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:46:59,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:59,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-12 20:46:59,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-12 20:46:59,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-12 20:46:59,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=4563, Unknown=0, NotChecked=0, Total=6162 [2018-10-12 20:46:59,775 INFO L87 Difference]: Start difference. First operand 3331 states and 3407 transitions. Second operand 79 states. [2018-10-12 20:47:03,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:47:03,854 INFO L93 Difference]: Finished difference Result 3503 states and 3583 transitions. [2018-10-12 20:47:03,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-12 20:47:03,854 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 2076 [2018-10-12 20:47:03,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:47:03,858 INFO L225 Difference]: With dead ends: 3503 [2018-10-12 20:47:03,858 INFO L226 Difference]: Without dead ends: 3503 [2018-10-12 20:47:03,859 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4256 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7603, Invalid=16267, Unknown=0, NotChecked=0, Total=23870 [2018-10-12 20:47:03,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3503 states. [2018-10-12 20:47:03,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3503 to 3418. [2018-10-12 20:47:03,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3418 states. [2018-10-12 20:47:03,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3418 states to 3418 states and 3496 transitions. [2018-10-12 20:47:03,878 INFO L78 Accepts]: Start accepts. Automaton has 3418 states and 3496 transitions. Word has length 2076 [2018-10-12 20:47:03,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:47:03,878 INFO L481 AbstractCegarLoop]: Abstraction has 3418 states and 3496 transitions. [2018-10-12 20:47:03,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-12 20:47:03,878 INFO L276 IsEmpty]: Start isEmpty. Operand 3418 states and 3496 transitions. [2018-10-12 20:47:03,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2131 [2018-10-12 20:47:03,899 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:47:03,899 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:47:03,900 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:47:03,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:47:03,900 INFO L82 PathProgramCache]: Analyzing trace with hash -993115176, now seen corresponding path program 39 times [2018-10-12 20:47:03,901 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:47:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:47:08,941 INFO L134 CoverageAnalysis]: Checked inductivity of 40053 backedges. 0 proven. 40053 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:47:08,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:47:08,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-12 20:47:08,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-12 20:47:08,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-12 20:47:08,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2018-10-12 20:47:08,944 INFO L87 Difference]: Start difference. First operand 3418 states and 3496 transitions. Second operand 81 states. [2018-10-12 20:47:13,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:47:13,667 INFO L93 Difference]: Finished difference Result 3590 states and 3672 transitions. [2018-10-12 20:47:13,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-12 20:47:13,667 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 2130 [2018-10-12 20:47:13,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:47:13,671 INFO L225 Difference]: With dead ends: 3590 [2018-10-12 20:47:13,671 INFO L226 Difference]: Without dead ends: 3590 [2018-10-12 20:47:13,673 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4485 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7998, Invalid=17124, Unknown=0, NotChecked=0, Total=25122 [2018-10-12 20:47:13,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3590 states. [2018-10-12 20:47:13,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3590 to 3505. [2018-10-12 20:47:13,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3505 states. [2018-10-12 20:47:13,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3505 states to 3505 states and 3585 transitions. [2018-10-12 20:47:13,692 INFO L78 Accepts]: Start accepts. Automaton has 3505 states and 3585 transitions. Word has length 2130 [2018-10-12 20:47:13,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:47:13,693 INFO L481 AbstractCegarLoop]: Abstraction has 3505 states and 3585 transitions. [2018-10-12 20:47:13,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-12 20:47:13,693 INFO L276 IsEmpty]: Start isEmpty. Operand 3505 states and 3585 transitions. [2018-10-12 20:47:13,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2185 [2018-10-12 20:47:13,718 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:47:13,718 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:47:13,719 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:47:13,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:47:13,719 INFO L82 PathProgramCache]: Analyzing trace with hash 561012054, now seen corresponding path program 40 times [2018-10-12 20:47:13,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:47:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:47:18,972 INFO L134 CoverageAnalysis]: Checked inductivity of 42160 backedges. 0 proven. 42160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:47:18,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:47:18,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-12 20:47:18,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-12 20:47:18,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-12 20:47:18,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2018-10-12 20:47:18,974 INFO L87 Difference]: Start difference. First operand 3505 states and 3585 transitions. Second operand 83 states. [2018-10-12 20:47:23,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:47:23,752 INFO L93 Difference]: Finished difference Result 3677 states and 3761 transitions. [2018-10-12 20:47:23,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-12 20:47:23,752 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 2184 [2018-10-12 20:47:23,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:47:23,756 INFO L225 Difference]: With dead ends: 3677 [2018-10-12 20:47:23,756 INFO L226 Difference]: Without dead ends: 3677 [2018-10-12 20:47:23,758 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8403, Invalid=18003, Unknown=0, NotChecked=0, Total=26406 [2018-10-12 20:47:23,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3677 states. [2018-10-12 20:47:23,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3677 to 3592. [2018-10-12 20:47:23,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3592 states. [2018-10-12 20:47:23,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 3674 transitions. [2018-10-12 20:47:23,778 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 3674 transitions. Word has length 2184 [2018-10-12 20:47:23,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:47:23,780 INFO L481 AbstractCegarLoop]: Abstraction has 3592 states and 3674 transitions. [2018-10-12 20:47:23,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-12 20:47:23,780 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 3674 transitions. [2018-10-12 20:47:23,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2239 [2018-10-12 20:47:23,805 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:47:23,806 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:47:23,806 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:47:23,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:47:23,807 INFO L82 PathProgramCache]: Analyzing trace with hash 73903188, now seen corresponding path program 41 times [2018-10-12 20:47:23,808 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:47:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:47:29,293 INFO L134 CoverageAnalysis]: Checked inductivity of 44321 backedges. 0 proven. 44321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:47:29,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:47:29,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-12 20:47:29,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-12 20:47:29,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-12 20:47:29,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2018-10-12 20:47:29,295 INFO L87 Difference]: Start difference. First operand 3592 states and 3674 transitions. Second operand 85 states. [2018-10-12 20:47:34,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:47:34,499 INFO L93 Difference]: Finished difference Result 3764 states and 3850 transitions. [2018-10-12 20:47:34,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-12 20:47:34,499 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 2238 [2018-10-12 20:47:34,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:47:34,503 INFO L225 Difference]: With dead ends: 3764 [2018-10-12 20:47:34,503 INFO L226 Difference]: Without dead ends: 3764 [2018-10-12 20:47:34,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4961 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8818, Invalid=18904, Unknown=0, NotChecked=0, Total=27722 [2018-10-12 20:47:34,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2018-10-12 20:47:34,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3679. [2018-10-12 20:47:34,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3679 states. [2018-10-12 20:47:34,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3679 states to 3679 states and 3763 transitions. [2018-10-12 20:47:34,523 INFO L78 Accepts]: Start accepts. Automaton has 3679 states and 3763 transitions. Word has length 2238 [2018-10-12 20:47:34,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:47:34,524 INFO L481 AbstractCegarLoop]: Abstraction has 3679 states and 3763 transitions. [2018-10-12 20:47:34,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-12 20:47:34,524 INFO L276 IsEmpty]: Start isEmpty. Operand 3679 states and 3763 transitions. [2018-10-12 20:47:34,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2293 [2018-10-12 20:47:34,551 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:47:34,552 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:47:34,552 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:47:34,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:47:34,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1539641554, now seen corresponding path program 42 times [2018-10-12 20:47:34,553 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:47:34,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:47:40,352 INFO L134 CoverageAnalysis]: Checked inductivity of 46536 backedges. 0 proven. 46536 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:47:40,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:47:40,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-12 20:47:40,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-12 20:47:40,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-12 20:47:40,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2018-10-12 20:47:40,355 INFO L87 Difference]: Start difference. First operand 3679 states and 3763 transitions. Second operand 87 states. [2018-10-12 20:47:45,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:47:45,679 INFO L93 Difference]: Finished difference Result 3851 states and 3939 transitions. [2018-10-12 20:47:45,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-12 20:47:45,680 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 2292 [2018-10-12 20:47:45,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:47:45,682 INFO L225 Difference]: With dead ends: 3851 [2018-10-12 20:47:45,682 INFO L226 Difference]: Without dead ends: 3851 [2018-10-12 20:47:45,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5208 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9243, Invalid=19827, Unknown=0, NotChecked=0, Total=29070 [2018-10-12 20:47:45,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3851 states. [2018-10-12 20:47:45,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3851 to 3766. [2018-10-12 20:47:45,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3766 states. [2018-10-12 20:47:45,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3766 states to 3766 states and 3852 transitions. [2018-10-12 20:47:45,702 INFO L78 Accepts]: Start accepts. Automaton has 3766 states and 3852 transitions. Word has length 2292 [2018-10-12 20:47:45,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:47:45,703 INFO L481 AbstractCegarLoop]: Abstraction has 3766 states and 3852 transitions. [2018-10-12 20:47:45,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-12 20:47:45,704 INFO L276 IsEmpty]: Start isEmpty. Operand 3766 states and 3852 transitions. [2018-10-12 20:47:45,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2347 [2018-10-12 20:47:45,731 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:47:45,732 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:47:45,732 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:47:45,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:47:45,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1271829808, now seen corresponding path program 43 times [2018-10-12 20:47:45,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:47:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:47:51,388 INFO L134 CoverageAnalysis]: Checked inductivity of 48805 backedges. 0 proven. 48805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:47:51,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:47:51,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-12 20:47:51,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-12 20:47:51,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-12 20:47:51,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2018-10-12 20:47:51,391 INFO L87 Difference]: Start difference. First operand 3766 states and 3852 transitions. Second operand 89 states. [2018-10-12 20:47:56,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:47:56,814 INFO L93 Difference]: Finished difference Result 3938 states and 4028 transitions. [2018-10-12 20:47:56,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-12 20:47:56,814 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 2346 [2018-10-12 20:47:56,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:47:56,818 INFO L225 Difference]: With dead ends: 3938 [2018-10-12 20:47:56,819 INFO L226 Difference]: Without dead ends: 3938 [2018-10-12 20:47:56,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5461 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=9678, Invalid=20772, Unknown=0, NotChecked=0, Total=30450 [2018-10-12 20:47:56,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3938 states. [2018-10-12 20:47:56,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3938 to 3853. [2018-10-12 20:47:56,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3853 states. [2018-10-12 20:47:56,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3853 states to 3853 states and 3941 transitions. [2018-10-12 20:47:56,837 INFO L78 Accepts]: Start accepts. Automaton has 3853 states and 3941 transitions. Word has length 2346 [2018-10-12 20:47:56,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:47:56,838 INFO L481 AbstractCegarLoop]: Abstraction has 3853 states and 3941 transitions. [2018-10-12 20:47:56,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-12 20:47:56,839 INFO L276 IsEmpty]: Start isEmpty. Operand 3853 states and 3941 transitions. [2018-10-12 20:47:56,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2401 [2018-10-12 20:47:56,867 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:47:56,868 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:47:56,868 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:47:56,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:47:56,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1458412110, now seen corresponding path program 44 times [2018-10-12 20:47:56,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:47:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:48:02,953 INFO L134 CoverageAnalysis]: Checked inductivity of 51128 backedges. 0 proven. 51128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:48:02,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:48:02,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-12 20:48:02,955 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-12 20:48:02,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-12 20:48:02,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2115, Invalid=6075, Unknown=0, NotChecked=0, Total=8190 [2018-10-12 20:48:02,956 INFO L87 Difference]: Start difference. First operand 3853 states and 3941 transitions. Second operand 91 states. [2018-10-12 20:48:08,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:48:08,838 INFO L93 Difference]: Finished difference Result 4025 states and 4117 transitions. [2018-10-12 20:48:08,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-12 20:48:08,839 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 2400 [2018-10-12 20:48:08,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:48:08,842 INFO L225 Difference]: With dead ends: 4025 [2018-10-12 20:48:08,843 INFO L226 Difference]: Without dead ends: 4025 [2018-10-12 20:48:08,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=10123, Invalid=21739, Unknown=0, NotChecked=0, Total=31862 [2018-10-12 20:48:08,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4025 states. [2018-10-12 20:48:08,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4025 to 3940. [2018-10-12 20:48:08,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3940 states. [2018-10-12 20:48:08,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3940 states to 3940 states and 4030 transitions. [2018-10-12 20:48:08,871 INFO L78 Accepts]: Start accepts. Automaton has 3940 states and 4030 transitions. Word has length 2400 [2018-10-12 20:48:08,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:48:08,872 INFO L481 AbstractCegarLoop]: Abstraction has 3940 states and 4030 transitions. [2018-10-12 20:48:08,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-12 20:48:08,872 INFO L276 IsEmpty]: Start isEmpty. Operand 3940 states and 4030 transitions. [2018-10-12 20:48:08,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2455 [2018-10-12 20:48:08,969 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:48:08,970 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:48:08,970 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:48:08,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:48:08,971 INFO L82 PathProgramCache]: Analyzing trace with hash -405635252, now seen corresponding path program 45 times [2018-10-12 20:48:08,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:48:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:48:15,436 INFO L134 CoverageAnalysis]: Checked inductivity of 53505 backedges. 0 proven. 53505 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:48:15,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:48:15,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-12 20:48:15,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-12 20:48:15,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-12 20:48:15,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2208, Invalid=6348, Unknown=0, NotChecked=0, Total=8556 [2018-10-12 20:48:15,439 INFO L87 Difference]: Start difference. First operand 3940 states and 4030 transitions. Second operand 93 states. [2018-10-12 20:48:21,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:48:21,488 INFO L93 Difference]: Finished difference Result 4112 states and 4206 transitions. [2018-10-12 20:48:21,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-12 20:48:21,488 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 2454 [2018-10-12 20:48:21,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:48:21,492 INFO L225 Difference]: With dead ends: 4112 [2018-10-12 20:48:21,492 INFO L226 Difference]: Without dead ends: 4112 [2018-10-12 20:48:21,494 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5985 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10578, Invalid=22728, Unknown=0, NotChecked=0, Total=33306 [2018-10-12 20:48:21,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4112 states. [2018-10-12 20:48:21,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4112 to 4027. [2018-10-12 20:48:21,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4027 states. [2018-10-12 20:48:21,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4027 states to 4027 states and 4119 transitions. [2018-10-12 20:48:21,519 INFO L78 Accepts]: Start accepts. Automaton has 4027 states and 4119 transitions. Word has length 2454 [2018-10-12 20:48:21,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:48:21,521 INFO L481 AbstractCegarLoop]: Abstraction has 4027 states and 4119 transitions. [2018-10-12 20:48:21,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-12 20:48:21,521 INFO L276 IsEmpty]: Start isEmpty. Operand 4027 states and 4119 transitions. [2018-10-12 20:48:21,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2509 [2018-10-12 20:48:21,563 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:48:21,564 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:48:21,564 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:48:21,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:48:21,565 INFO L82 PathProgramCache]: Analyzing trace with hash -2091845174, now seen corresponding path program 46 times [2018-10-12 20:48:21,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:48:21,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:48:28,134 INFO L134 CoverageAnalysis]: Checked inductivity of 55936 backedges. 0 proven. 55936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:48:28,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:48:28,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-12 20:48:28,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-12 20:48:28,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-12 20:48:28,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2018-10-12 20:48:28,136 INFO L87 Difference]: Start difference. First operand 4027 states and 4119 transitions. Second operand 95 states. [2018-10-12 20:48:34,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:48:34,502 INFO L93 Difference]: Finished difference Result 4199 states and 4295 transitions. [2018-10-12 20:48:34,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-12 20:48:34,502 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 2508 [2018-10-12 20:48:34,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:48:34,507 INFO L225 Difference]: With dead ends: 4199 [2018-10-12 20:48:34,507 INFO L226 Difference]: Without dead ends: 4199 [2018-10-12 20:48:34,509 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6256 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=11043, Invalid=23739, Unknown=0, NotChecked=0, Total=34782 [2018-10-12 20:48:34,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4199 states. [2018-10-12 20:48:34,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4199 to 4114. [2018-10-12 20:48:34,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4114 states. [2018-10-12 20:48:34,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4114 states to 4114 states and 4208 transitions. [2018-10-12 20:48:34,530 INFO L78 Accepts]: Start accepts. Automaton has 4114 states and 4208 transitions. Word has length 2508 [2018-10-12 20:48:34,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:48:34,531 INFO L481 AbstractCegarLoop]: Abstraction has 4114 states and 4208 transitions. [2018-10-12 20:48:34,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-12 20:48:34,531 INFO L276 IsEmpty]: Start isEmpty. Operand 4114 states and 4208 transitions. [2018-10-12 20:48:34,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2563 [2018-10-12 20:48:34,564 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:48:34,565 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:48:34,566 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:48:34,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:48:34,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1550969288, now seen corresponding path program 47 times [2018-10-12 20:48:34,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:48:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:48:41,604 INFO L134 CoverageAnalysis]: Checked inductivity of 58421 backedges. 0 proven. 58421 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:48:41,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:48:41,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-12 20:48:41,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-12 20:48:41,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-12 20:48:41,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2018-10-12 20:48:41,608 INFO L87 Difference]: Start difference. First operand 4114 states and 4208 transitions. Second operand 97 states. [2018-10-12 20:48:48,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:48:48,397 INFO L93 Difference]: Finished difference Result 4286 states and 4384 transitions. [2018-10-12 20:48:48,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-12 20:48:48,398 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 2562 [2018-10-12 20:48:48,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:48:48,401 INFO L225 Difference]: With dead ends: 4286 [2018-10-12 20:48:48,401 INFO L226 Difference]: Without dead ends: 4286 [2018-10-12 20:48:48,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6533 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=11518, Invalid=24772, Unknown=0, NotChecked=0, Total=36290 [2018-10-12 20:48:48,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4286 states. [2018-10-12 20:48:48,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4286 to 4201. [2018-10-12 20:48:48,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4201 states. [2018-10-12 20:48:48,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4201 states to 4201 states and 4297 transitions. [2018-10-12 20:48:48,430 INFO L78 Accepts]: Start accepts. Automaton has 4201 states and 4297 transitions. Word has length 2562 [2018-10-12 20:48:48,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:48:48,432 INFO L481 AbstractCegarLoop]: Abstraction has 4201 states and 4297 transitions. [2018-10-12 20:48:48,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-12 20:48:48,432 INFO L276 IsEmpty]: Start isEmpty. Operand 4201 states and 4297 transitions. [2018-10-12 20:48:48,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2617 [2018-10-12 20:48:48,478 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:48:48,479 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:48:48,479 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:48:48,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:48:48,480 INFO L82 PathProgramCache]: Analyzing trace with hash -623497402, now seen corresponding path program 48 times [2018-10-12 20:48:48,480 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:48:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:48:55,520 INFO L134 CoverageAnalysis]: Checked inductivity of 60960 backedges. 0 proven. 60960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:48:55,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:48:55,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-12 20:48:55,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-12 20:48:55,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-12 20:48:55,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-10-12 20:48:55,523 INFO L87 Difference]: Start difference. First operand 4201 states and 4297 transitions. Second operand 99 states. [2018-10-12 20:49:02,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:49:02,513 INFO L93 Difference]: Finished difference Result 4373 states and 4473 transitions. [2018-10-12 20:49:02,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-12 20:49:02,513 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 2616 [2018-10-12 20:49:02,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:49:02,516 INFO L225 Difference]: With dead ends: 4373 [2018-10-12 20:49:02,517 INFO L226 Difference]: Without dead ends: 4373 [2018-10-12 20:49:02,519 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6816 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=12003, Invalid=25827, Unknown=0, NotChecked=0, Total=37830 [2018-10-12 20:49:02,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4373 states. [2018-10-12 20:49:02,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4373 to 4288. [2018-10-12 20:49:02,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4288 states. [2018-10-12 20:49:02,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4288 states to 4288 states and 4386 transitions. [2018-10-12 20:49:02,535 INFO L78 Accepts]: Start accepts. Automaton has 4288 states and 4386 transitions. Word has length 2616 [2018-10-12 20:49:02,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:49:02,537 INFO L481 AbstractCegarLoop]: Abstraction has 4288 states and 4386 transitions. [2018-10-12 20:49:02,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-12 20:49:02,537 INFO L276 IsEmpty]: Start isEmpty. Operand 4288 states and 4386 transitions. [2018-10-12 20:49:02,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2671 [2018-10-12 20:49:02,570 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:49:02,570 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:49:02,570 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:49:02,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:49:02,571 INFO L82 PathProgramCache]: Analyzing trace with hash 951495236, now seen corresponding path program 49 times [2018-10-12 20:49:02,572 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:49:02,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:49:11,462 INFO L134 CoverageAnalysis]: Checked inductivity of 63553 backedges. 0 proven. 63553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:49:11,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:49:11,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-12 20:49:11,463 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-12 20:49:11,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-12 20:49:11,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2600, Invalid=7500, Unknown=0, NotChecked=0, Total=10100 [2018-10-12 20:49:11,464 INFO L87 Difference]: Start difference. First operand 4288 states and 4386 transitions. Second operand 101 states. [2018-10-12 20:49:18,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:49:18,783 INFO L93 Difference]: Finished difference Result 4460 states and 4562 transitions. [2018-10-12 20:49:18,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-12 20:49:18,784 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 2670 [2018-10-12 20:49:18,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:49:18,787 INFO L225 Difference]: With dead ends: 4460 [2018-10-12 20:49:18,787 INFO L226 Difference]: Without dead ends: 4460 [2018-10-12 20:49:18,788 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7105 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=12498, Invalid=26904, Unknown=0, NotChecked=0, Total=39402 [2018-10-12 20:49:18,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4460 states. [2018-10-12 20:49:18,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4460 to 4375. [2018-10-12 20:49:18,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4375 states. [2018-10-12 20:49:18,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4375 states to 4375 states and 4475 transitions. [2018-10-12 20:49:18,817 INFO L78 Accepts]: Start accepts. Automaton has 4375 states and 4475 transitions. Word has length 2670 [2018-10-12 20:49:18,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:49:18,819 INFO L481 AbstractCegarLoop]: Abstraction has 4375 states and 4475 transitions. [2018-10-12 20:49:18,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-12 20:49:18,820 INFO L276 IsEmpty]: Start isEmpty. Operand 4375 states and 4475 transitions. [2018-10-12 20:49:18,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2725 [2018-10-12 20:49:18,868 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:49:18,869 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:49:18,869 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:49:18,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:49:18,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1595655486, now seen corresponding path program 50 times [2018-10-12 20:49:18,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:49:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:49:26,395 INFO L134 CoverageAnalysis]: Checked inductivity of 66200 backedges. 0 proven. 66200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:49:26,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:49:26,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-12 20:49:26,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-12 20:49:26,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-12 20:49:26,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2703, Invalid=7803, Unknown=0, NotChecked=0, Total=10506 [2018-10-12 20:49:26,398 INFO L87 Difference]: Start difference. First operand 4375 states and 4475 transitions. Second operand 103 states. [2018-10-12 20:49:34,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:49:34,225 INFO L93 Difference]: Finished difference Result 4547 states and 4651 transitions. [2018-10-12 20:49:34,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-10-12 20:49:34,225 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 2724 [2018-10-12 20:49:34,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:49:34,229 INFO L225 Difference]: With dead ends: 4547 [2018-10-12 20:49:34,229 INFO L226 Difference]: Without dead ends: 4547 [2018-10-12 20:49:34,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7400 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=13003, Invalid=28003, Unknown=0, NotChecked=0, Total=41006 [2018-10-12 20:49:34,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4547 states. [2018-10-12 20:49:34,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4547 to 4462. [2018-10-12 20:49:34,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4462 states. [2018-10-12 20:49:34,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4462 states to 4462 states and 4564 transitions. [2018-10-12 20:49:34,253 INFO L78 Accepts]: Start accepts. Automaton has 4462 states and 4564 transitions. Word has length 2724 [2018-10-12 20:49:34,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:49:34,254 INFO L481 AbstractCegarLoop]: Abstraction has 4462 states and 4564 transitions. [2018-10-12 20:49:34,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-12 20:49:34,254 INFO L276 IsEmpty]: Start isEmpty. Operand 4462 states and 4564 transitions. [2018-10-12 20:49:34,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2779 [2018-10-12 20:49:34,293 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:49:34,293 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:49:34,294 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:49:34,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:49:34,294 INFO L82 PathProgramCache]: Analyzing trace with hash -859324224, now seen corresponding path program 51 times [2018-10-12 20:49:34,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:49:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:49:42,505 INFO L134 CoverageAnalysis]: Checked inductivity of 68901 backedges. 0 proven. 68901 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:49:42,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:49:42,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-12 20:49:42,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-12 20:49:42,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-12 20:49:42,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2808, Invalid=8112, Unknown=0, NotChecked=0, Total=10920 [2018-10-12 20:49:42,507 INFO L87 Difference]: Start difference. First operand 4462 states and 4564 transitions. Second operand 105 states. [2018-10-12 20:49:50,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:49:50,907 INFO L93 Difference]: Finished difference Result 4634 states and 4740 transitions. [2018-10-12 20:49:50,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-10-12 20:49:50,908 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 2778 [2018-10-12 20:49:50,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:49:50,912 INFO L225 Difference]: With dead ends: 4634 [2018-10-12 20:49:50,912 INFO L226 Difference]: Without dead ends: 4634 [2018-10-12 20:49:50,915 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7701 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=13518, Invalid=29124, Unknown=0, NotChecked=0, Total=42642 [2018-10-12 20:49:50,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4634 states. [2018-10-12 20:49:50,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4634 to 4549. [2018-10-12 20:49:50,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4549 states. [2018-10-12 20:49:50,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4549 states to 4549 states and 4653 transitions. [2018-10-12 20:49:50,938 INFO L78 Accepts]: Start accepts. Automaton has 4549 states and 4653 transitions. Word has length 2778 [2018-10-12 20:49:50,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:49:50,940 INFO L481 AbstractCegarLoop]: Abstraction has 4549 states and 4653 transitions. [2018-10-12 20:49:50,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-12 20:49:50,940 INFO L276 IsEmpty]: Start isEmpty. Operand 4549 states and 4653 transitions. [2018-10-12 20:49:50,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2833 [2018-10-12 20:49:50,990 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:49:50,990 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:49:50,991 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:49:50,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:49:50,991 INFO L82 PathProgramCache]: Analyzing trace with hash 576855102, now seen corresponding path program 52 times [2018-10-12 20:49:50,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:49:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:50:00,117 INFO L134 CoverageAnalysis]: Checked inductivity of 71656 backedges. 0 proven. 71656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:50:00,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:50:00,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-12 20:50:00,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-12 20:50:00,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-12 20:50:00,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2018-10-12 20:50:00,119 INFO L87 Difference]: Start difference. First operand 4549 states and 4653 transitions. Second operand 107 states. [2018-10-12 20:50:08,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:50:08,445 INFO L93 Difference]: Finished difference Result 4721 states and 4829 transitions. [2018-10-12 20:50:08,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-10-12 20:50:08,445 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 2832 [2018-10-12 20:50:08,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:50:08,449 INFO L225 Difference]: With dead ends: 4721 [2018-10-12 20:50:08,449 INFO L226 Difference]: Without dead ends: 4721 [2018-10-12 20:50:08,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8008 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=14043, Invalid=30267, Unknown=0, NotChecked=0, Total=44310 [2018-10-12 20:50:08,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4721 states. [2018-10-12 20:50:08,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4721 to 4636. [2018-10-12 20:50:08,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4636 states. [2018-10-12 20:50:08,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4636 states to 4636 states and 4742 transitions. [2018-10-12 20:50:08,471 INFO L78 Accepts]: Start accepts. Automaton has 4636 states and 4742 transitions. Word has length 2832 [2018-10-12 20:50:08,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:50:08,472 INFO L481 AbstractCegarLoop]: Abstraction has 4636 states and 4742 transitions. [2018-10-12 20:50:08,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-12 20:50:08,472 INFO L276 IsEmpty]: Start isEmpty. Operand 4636 states and 4742 transitions. [2018-10-12 20:50:08,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2887 [2018-10-12 20:50:08,519 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:50:08,520 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:50:08,520 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:50:08,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:50:08,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1380724028, now seen corresponding path program 53 times [2018-10-12 20:50:08,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:50:08,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:50:17,041 INFO L134 CoverageAnalysis]: Checked inductivity of 74465 backedges. 0 proven. 74465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:50:17,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:50:17,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-12 20:50:17,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-12 20:50:17,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-12 20:50:17,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3024, Invalid=8748, Unknown=0, NotChecked=0, Total=11772 [2018-10-12 20:50:17,043 INFO L87 Difference]: Start difference. First operand 4636 states and 4742 transitions. Second operand 109 states. [2018-10-12 20:50:26,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:50:26,100 INFO L93 Difference]: Finished difference Result 4808 states and 4918 transitions. [2018-10-12 20:50:26,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-10-12 20:50:26,101 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 2886 [2018-10-12 20:50:26,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:50:26,106 INFO L225 Difference]: With dead ends: 4808 [2018-10-12 20:50:26,106 INFO L226 Difference]: Without dead ends: 4808 [2018-10-12 20:50:26,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8321 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=14578, Invalid=31432, Unknown=0, NotChecked=0, Total=46010 [2018-10-12 20:50:26,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4808 states. [2018-10-12 20:50:26,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4808 to 4723. [2018-10-12 20:50:26,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4723 states. [2018-10-12 20:50:26,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4723 states to 4723 states and 4831 transitions. [2018-10-12 20:50:26,133 INFO L78 Accepts]: Start accepts. Automaton has 4723 states and 4831 transitions. Word has length 2886 [2018-10-12 20:50:26,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:50:26,134 INFO L481 AbstractCegarLoop]: Abstraction has 4723 states and 4831 transitions. [2018-10-12 20:50:26,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-12 20:50:26,134 INFO L276 IsEmpty]: Start isEmpty. Operand 4723 states and 4831 transitions. [2018-10-12 20:50:26,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2941 [2018-10-12 20:50:26,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:50:26,176 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:50:26,176 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:50:26,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:50:26,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1974916026, now seen corresponding path program 54 times [2018-10-12 20:50:26,177 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:50:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:50:35,353 INFO L134 CoverageAnalysis]: Checked inductivity of 77328 backedges. 0 proven. 77328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:50:35,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:50:35,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-12 20:50:35,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-12 20:50:35,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-12 20:50:35,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2018-10-12 20:50:35,357 INFO L87 Difference]: Start difference. First operand 4723 states and 4831 transitions. Second operand 111 states. [2018-10-12 20:50:44,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:50:44,665 INFO L93 Difference]: Finished difference Result 4895 states and 5007 transitions. [2018-10-12 20:50:44,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-10-12 20:50:44,666 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 2940 [2018-10-12 20:50:44,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:50:44,670 INFO L225 Difference]: With dead ends: 4895 [2018-10-12 20:50:44,671 INFO L226 Difference]: Without dead ends: 4895 [2018-10-12 20:50:44,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8640 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=15123, Invalid=32619, Unknown=0, NotChecked=0, Total=47742 [2018-10-12 20:50:44,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4895 states. [2018-10-12 20:50:44,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4895 to 4810. [2018-10-12 20:50:44,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4810 states. [2018-10-12 20:50:44,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 4920 transitions. [2018-10-12 20:50:44,698 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 4920 transitions. Word has length 2940 [2018-10-12 20:50:44,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:50:44,699 INFO L481 AbstractCegarLoop]: Abstraction has 4810 states and 4920 transitions. [2018-10-12 20:50:44,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-12 20:50:44,699 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 4920 transitions. [2018-10-12 20:50:44,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2995 [2018-10-12 20:50:44,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:50:44,743 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:50:44,743 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:50:44,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:50:44,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1402277960, now seen corresponding path program 55 times [2018-10-12 20:50:44,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:50:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:50:53,907 INFO L134 CoverageAnalysis]: Checked inductivity of 80245 backedges. 0 proven. 80245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:50:53,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:50:53,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-10-12 20:50:53,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-12 20:50:53,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-12 20:50:53,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3248, Invalid=9408, Unknown=0, NotChecked=0, Total=12656 [2018-10-12 20:50:53,910 INFO L87 Difference]: Start difference. First operand 4810 states and 4920 transitions. Second operand 113 states. [2018-10-12 20:51:03,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:51:03,142 INFO L93 Difference]: Finished difference Result 4982 states and 5096 transitions. [2018-10-12 20:51:03,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-10-12 20:51:03,143 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 2994 [2018-10-12 20:51:03,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:51:03,147 INFO L225 Difference]: With dead ends: 4982 [2018-10-12 20:51:03,147 INFO L226 Difference]: Without dead ends: 4982 [2018-10-12 20:51:03,149 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8965 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=15678, Invalid=33828, Unknown=0, NotChecked=0, Total=49506 [2018-10-12 20:51:03,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4982 states. [2018-10-12 20:51:03,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4982 to 4897. [2018-10-12 20:51:03,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4897 states. [2018-10-12 20:51:03,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4897 states to 4897 states and 5009 transitions. [2018-10-12 20:51:03,169 INFO L78 Accepts]: Start accepts. Automaton has 4897 states and 5009 transitions. Word has length 2994 [2018-10-12 20:51:03,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:51:03,171 INFO L481 AbstractCegarLoop]: Abstraction has 4897 states and 5009 transitions. [2018-10-12 20:51:03,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-12 20:51:03,171 INFO L276 IsEmpty]: Start isEmpty. Operand 4897 states and 5009 transitions. [2018-10-12 20:51:03,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3049 [2018-10-12 20:51:03,224 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:51:03,224 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:51:03,224 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:51:03,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:51:03,225 INFO L82 PathProgramCache]: Analyzing trace with hash 986276150, now seen corresponding path program 56 times [2018-10-12 20:51:03,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:51:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:51:13,067 INFO L134 CoverageAnalysis]: Checked inductivity of 83216 backedges. 0 proven. 83216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:51:13,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:51:13,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-10-12 20:51:13,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-12 20:51:13,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-12 20:51:13,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3363, Invalid=9747, Unknown=0, NotChecked=0, Total=13110 [2018-10-12 20:51:13,070 INFO L87 Difference]: Start difference. First operand 4897 states and 5009 transitions. Second operand 115 states. [2018-10-12 20:51:23,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:51:23,501 INFO L93 Difference]: Finished difference Result 5069 states and 5185 transitions. [2018-10-12 20:51:23,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-10-12 20:51:23,502 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 3048 [2018-10-12 20:51:23,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:51:23,508 INFO L225 Difference]: With dead ends: 5069 [2018-10-12 20:51:23,508 INFO L226 Difference]: Without dead ends: 5069 [2018-10-12 20:51:23,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9296 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=16243, Invalid=35059, Unknown=0, NotChecked=0, Total=51302 [2018-10-12 20:51:23,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5069 states. [2018-10-12 20:51:23,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5069 to 4984. [2018-10-12 20:51:23,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4984 states. [2018-10-12 20:51:23,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4984 states to 4984 states and 5098 transitions. [2018-10-12 20:51:23,534 INFO L78 Accepts]: Start accepts. Automaton has 4984 states and 5098 transitions. Word has length 3048 [2018-10-12 20:51:23,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:51:23,535 INFO L481 AbstractCegarLoop]: Abstraction has 4984 states and 5098 transitions. [2018-10-12 20:51:23,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-12 20:51:23,535 INFO L276 IsEmpty]: Start isEmpty. Operand 4984 states and 5098 transitions. [2018-10-12 20:51:23,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3103 [2018-10-12 20:51:23,575 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:51:23,575 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:51:23,576 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:51:23,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:51:23,576 INFO L82 PathProgramCache]: Analyzing trace with hash 667617332, now seen corresponding path program 57 times [2018-10-12 20:51:23,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:51:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:51:33,509 INFO L134 CoverageAnalysis]: Checked inductivity of 86241 backedges. 0 proven. 86241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:51:33,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:51:33,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-10-12 20:51:33,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-12 20:51:33,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-12 20:51:33,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3480, Invalid=10092, Unknown=0, NotChecked=0, Total=13572 [2018-10-12 20:51:33,512 INFO L87 Difference]: Start difference. First operand 4984 states and 5098 transitions. Second operand 117 states. [2018-10-12 20:51:43,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:51:43,697 INFO L93 Difference]: Finished difference Result 5156 states and 5274 transitions. [2018-10-12 20:51:43,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-10-12 20:51:43,697 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 3102 [2018-10-12 20:51:43,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:51:43,702 INFO L225 Difference]: With dead ends: 5156 [2018-10-12 20:51:43,702 INFO L226 Difference]: Without dead ends: 5156 [2018-10-12 20:51:43,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9633 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=16818, Invalid=36312, Unknown=0, NotChecked=0, Total=53130 [2018-10-12 20:51:43,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5156 states. [2018-10-12 20:51:43,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5156 to 5071. [2018-10-12 20:51:43,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5071 states. [2018-10-12 20:51:43,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5071 states to 5071 states and 5187 transitions. [2018-10-12 20:51:43,728 INFO L78 Accepts]: Start accepts. Automaton has 5071 states and 5187 transitions. Word has length 3102 [2018-10-12 20:51:43,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:51:43,729 INFO L481 AbstractCegarLoop]: Abstraction has 5071 states and 5187 transitions. [2018-10-12 20:51:43,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-10-12 20:51:43,730 INFO L276 IsEmpty]: Start isEmpty. Operand 5071 states and 5187 transitions. [2018-10-12 20:51:43,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3157 [2018-10-12 20:51:43,781 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:51:43,781 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:51:43,781 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:51:43,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:51:43,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1526777010, now seen corresponding path program 58 times [2018-10-12 20:51:43,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:51:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:51:54,235 INFO L134 CoverageAnalysis]: Checked inductivity of 89320 backedges. 0 proven. 89320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:51:54,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:51:54,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-10-12 20:51:54,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-12 20:51:54,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-12 20:51:54,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-10-12 20:51:54,238 INFO L87 Difference]: Start difference. First operand 5071 states and 5187 transitions. Second operand 119 states. [2018-10-12 20:52:05,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:52:05,146 INFO L93 Difference]: Finished difference Result 5243 states and 5363 transitions. [2018-10-12 20:52:05,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-10-12 20:52:05,146 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 3156 [2018-10-12 20:52:05,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:52:05,151 INFO L225 Difference]: With dead ends: 5243 [2018-10-12 20:52:05,151 INFO L226 Difference]: Without dead ends: 5243 [2018-10-12 20:52:05,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9976 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=17403, Invalid=37587, Unknown=0, NotChecked=0, Total=54990 [2018-10-12 20:52:05,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5243 states. [2018-10-12 20:52:05,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5243 to 5158. [2018-10-12 20:52:05,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5158 states. [2018-10-12 20:52:05,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5158 states to 5158 states and 5276 transitions. [2018-10-12 20:52:05,178 INFO L78 Accepts]: Start accepts. Automaton has 5158 states and 5276 transitions. Word has length 3156 [2018-10-12 20:52:05,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:52:05,180 INFO L481 AbstractCegarLoop]: Abstraction has 5158 states and 5276 transitions. [2018-10-12 20:52:05,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-12 20:52:05,180 INFO L276 IsEmpty]: Start isEmpty. Operand 5158 states and 5276 transitions. [2018-10-12 20:52:05,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3211 [2018-10-12 20:52:05,229 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:52:05,229 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:52:05,229 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:52:05,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:52:05,230 INFO L82 PathProgramCache]: Analyzing trace with hash 982742704, now seen corresponding path program 59 times [2018-10-12 20:52:05,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:52:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:52:15,936 INFO L134 CoverageAnalysis]: Checked inductivity of 92453 backedges. 0 proven. 92453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:52:15,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:52:15,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-10-12 20:52:15,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-10-12 20:52:15,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-10-12 20:52:15,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3720, Invalid=10800, Unknown=0, NotChecked=0, Total=14520 [2018-10-12 20:52:15,938 INFO L87 Difference]: Start difference. First operand 5158 states and 5276 transitions. Second operand 121 states. [2018-10-12 20:52:27,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:52:27,354 INFO L93 Difference]: Finished difference Result 5330 states and 5452 transitions. [2018-10-12 20:52:27,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-10-12 20:52:27,355 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 3210 [2018-10-12 20:52:27,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:52:27,360 INFO L225 Difference]: With dead ends: 5330 [2018-10-12 20:52:27,360 INFO L226 Difference]: Without dead ends: 5330 [2018-10-12 20:52:27,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10325 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=17998, Invalid=38884, Unknown=0, NotChecked=0, Total=56882 [2018-10-12 20:52:27,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5330 states. [2018-10-12 20:52:27,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5330 to 5245. [2018-10-12 20:52:27,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5245 states. [2018-10-12 20:52:27,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5245 states to 5245 states and 5365 transitions. [2018-10-12 20:52:27,391 INFO L78 Accepts]: Start accepts. Automaton has 5245 states and 5365 transitions. Word has length 3210 [2018-10-12 20:52:27,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:52:27,392 INFO L481 AbstractCegarLoop]: Abstraction has 5245 states and 5365 transitions. [2018-10-12 20:52:27,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-10-12 20:52:27,392 INFO L276 IsEmpty]: Start isEmpty. Operand 5245 states and 5365 transitions. [2018-10-12 20:52:27,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3265 [2018-10-12 20:52:27,443 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:52:27,443 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:52:27,443 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:52:27,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:52:27,444 INFO L82 PathProgramCache]: Analyzing trace with hash -918290898, now seen corresponding path program 60 times [2018-10-12 20:52:27,445 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:52:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:52:38,119 INFO L134 CoverageAnalysis]: Checked inductivity of 95640 backedges. 0 proven. 95640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:52:38,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:52:38,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-12 20:52:38,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-12 20:52:38,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-12 20:52:38,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3843, Invalid=11163, Unknown=0, NotChecked=0, Total=15006 [2018-10-12 20:52:38,122 INFO L87 Difference]: Start difference. First operand 5245 states and 5365 transitions. Second operand 123 states. [2018-10-12 20:52:49,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:52:49,381 INFO L93 Difference]: Finished difference Result 5417 states and 5541 transitions. [2018-10-12 20:52:49,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-10-12 20:52:49,381 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 3264 [2018-10-12 20:52:49,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:52:49,385 INFO L225 Difference]: With dead ends: 5417 [2018-10-12 20:52:49,385 INFO L226 Difference]: Without dead ends: 5417 [2018-10-12 20:52:49,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10680 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=18603, Invalid=40203, Unknown=0, NotChecked=0, Total=58806 [2018-10-12 20:52:49,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5417 states. [2018-10-12 20:52:49,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5417 to 5332. [2018-10-12 20:52:49,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5332 states. [2018-10-12 20:52:49,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5332 states to 5332 states and 5454 transitions. [2018-10-12 20:52:49,411 INFO L78 Accepts]: Start accepts. Automaton has 5332 states and 5454 transitions. Word has length 3264 [2018-10-12 20:52:49,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:52:49,413 INFO L481 AbstractCegarLoop]: Abstraction has 5332 states and 5454 transitions. [2018-10-12 20:52:49,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-12 20:52:49,413 INFO L276 IsEmpty]: Start isEmpty. Operand 5332 states and 5454 transitions. [2018-10-12 20:52:49,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3319 [2018-10-12 20:52:49,467 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:52:49,468 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:52:49,468 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:52:49,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:52:49,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1147878188, now seen corresponding path program 61 times [2018-10-12 20:52:49,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:52:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:53:00,812 INFO L134 CoverageAnalysis]: Checked inductivity of 98881 backedges. 0 proven. 98881 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:53:00,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:53:00,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-10-12 20:53:00,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-10-12 20:53:00,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-10-12 20:53:00,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3968, Invalid=11532, Unknown=0, NotChecked=0, Total=15500 [2018-10-12 20:53:00,815 INFO L87 Difference]: Start difference. First operand 5332 states and 5454 transitions. Second operand 125 states.