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/20181015-LoopsPathprograms/simple_true-unreach-call3_true-termination.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 12:43:31,161 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 12:43:31,163 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 12:43:31,178 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 12:43:31,179 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 12:43:31,180 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 12:43:31,181 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 12:43:31,183 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 12:43:31,185 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 12:43:31,186 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 12:43:31,186 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 12:43:31,187 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 12:43:31,188 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 12:43:31,189 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 12:43:31,190 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 12:43:31,191 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 12:43:31,191 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 12:43:31,195 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 12:43:31,197 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 12:43:31,202 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 12:43:31,203 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 12:43:31,204 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 12:43:31,209 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 12:43:31,209 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 12:43:31,209 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 12:43:31,211 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 12:43:31,212 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 12:43:31,212 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 12:43:31,213 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 12:43:31,214 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 12:43:31,215 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 12:43:31,217 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 12:43:31,217 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 12:43:31,217 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 12:43:31,220 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 12:43:31,221 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 12:43:31,221 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-15 12:43:31,232 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 12:43:31,235 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 12:43:31,236 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 12:43:31,236 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 12:43:31,236 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 12:43:31,236 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 12:43:31,237 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 12:43:31,237 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 12:43:31,237 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 12:43:31,238 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 12:43:31,238 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 12:43:31,238 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 12:43:31,238 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 12:43:31,239 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 12:43:31,239 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 12:43:31,286 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 12:43:31,304 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 12:43:31,310 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 12:43:31,311 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 12:43:31,312 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 12:43:31,312 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/simple_true-unreach-call3_true-termination.i_3.bpl [2018-10-15 12:43:31,313 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/simple_true-unreach-call3_true-termination.i_3.bpl' [2018-10-15 12:43:31,368 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 12:43:31,369 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 12:43:31,370 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 12:43:31,370 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 12:43:31,370 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 12:43:31,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "simple_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:43:31" (1/1) ... [2018-10-15 12:43:31,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "simple_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:43:31" (1/1) ... [2018-10-15 12:43:31,410 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "simple_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:43:31" (1/1) ... [2018-10-15 12:43:31,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "simple_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:43:31" (1/1) ... [2018-10-15 12:43:31,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "simple_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:43:31" (1/1) ... [2018-10-15 12:43:31,415 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "simple_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:43:31" (1/1) ... [2018-10-15 12:43:31,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "simple_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:43:31" (1/1) ... [2018-10-15 12:43:31,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 12:43:31,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 12:43:31,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 12:43:31,420 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 12:43:31,421 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "simple_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:43:31" (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-15 12:43:31,495 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 12:43:31,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 12:43:31,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 12:43:31,745 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 12:43:31,746 INFO L202 PluginConnector]: Adding new model simple_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:43:31 BoogieIcfgContainer [2018-10-15 12:43:31,746 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 12:43:31,747 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 12:43:31,747 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 12:43:31,751 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 12:43:31,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:43:31" (1/2) ... [2018-10-15 12:43:31,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1484549 and model type simple_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:43:31, skipping insertion in model container [2018-10-15 12:43:31,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:43:31" (2/2) ... [2018-10-15 12:43:31,759 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_true-unreach-call3_true-termination.i_3.bpl [2018-10-15 12:43:31,769 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 12:43:31,781 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 12:43:31,799 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 12:43:31,834 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 12:43:31,835 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 12:43:31,835 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 12:43:31,835 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 12:43:31,835 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 12:43:31,836 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 12:43:31,836 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 12:43:31,836 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 12:43:31,836 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 12:43:31,857 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2018-10-15 12:43:31,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-15 12:43:31,871 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:31,872 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:31,873 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:31,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:31,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1240084209, now seen corresponding path program 1 times [2018-10-15 12:43:31,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:32,289 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-15 12:43:32,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:43:32,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-15 12:43:32,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 12:43:32,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 12:43:32,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 12:43:32,313 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 5 states. [2018-10-15 12:43:32,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:32,511 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-15 12:43:32,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 12:43:32,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-10-15 12:43:32,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:32,525 INFO L225 Difference]: With dead ends: 21 [2018-10-15 12:43:32,525 INFO L226 Difference]: Without dead ends: 16 [2018-10-15 12:43:32,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:43:32,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-15 12:43:32,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-10-15 12:43:32,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-15 12:43:32,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-15 12:43:32,567 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-10-15 12:43:32,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:32,568 INFO L481 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-15 12:43:32,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 12:43:32,568 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-15 12:43:32,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-15 12:43:32,569 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:32,569 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:32,570 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:32,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:32,570 INFO L82 PathProgramCache]: Analyzing trace with hash -6703058, now seen corresponding path program 1 times [2018-10-15 12:43:32,572 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:32,883 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-15 12:43:32,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:32,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-15 12:43:32,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-15 12:43:32,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-15 12:43:32,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-15 12:43:32,886 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 6 states. [2018-10-15 12:43:33,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:33,121 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-15 12:43:33,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 12:43:33,122 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-10-15 12:43:33,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:33,123 INFO L225 Difference]: With dead ends: 23 [2018-10-15 12:43:33,123 INFO L226 Difference]: Without dead ends: 18 [2018-10-15 12:43:33,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-15 12:43:33,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-15 12:43:33,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-10-15 12:43:33,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-15 12:43:33,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-15 12:43:33,128 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-10-15 12:43:33,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:33,128 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-15 12:43:33,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-15 12:43:33,129 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-15 12:43:33,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-15 12:43:33,130 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:33,130 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:33,130 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:33,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:33,131 INFO L82 PathProgramCache]: Analyzing trace with hash -138390643, now seen corresponding path program 2 times [2018-10-15 12:43:33,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:33,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:33,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:33,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 12:43:33,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 12:43:33,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 12:43:33,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:43:33,590 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 7 states. [2018-10-15 12:43:33,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:33,765 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-15 12:43:33,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 12:43:33,766 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-10-15 12:43:33,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:33,767 INFO L225 Difference]: With dead ends: 25 [2018-10-15 12:43:33,767 INFO L226 Difference]: Without dead ends: 20 [2018-10-15 12:43:33,770 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-15 12:43:33,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-15 12:43:33,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-10-15 12:43:33,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-15 12:43:33,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-15 12:43:33,776 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-10-15 12:43:33,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:33,777 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-15 12:43:33,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 12:43:33,778 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-15 12:43:33,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-15 12:43:33,779 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:33,779 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:33,779 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:33,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:33,780 INFO L82 PathProgramCache]: Analyzing trace with hash -2136108244, now seen corresponding path program 3 times [2018-10-15 12:43:33,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:33,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:34,272 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:34,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:34,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 12:43:34,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 12:43:34,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 12:43:34,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-15 12:43:34,275 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 8 states. [2018-10-15 12:43:34,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:34,488 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-15 12:43:34,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-15 12:43:34,488 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-10-15 12:43:34,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:34,490 INFO L225 Difference]: With dead ends: 27 [2018-10-15 12:43:34,490 INFO L226 Difference]: Without dead ends: 22 [2018-10-15 12:43:34,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-10-15 12:43:34,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-15 12:43:34,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-10-15 12:43:34,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-15 12:43:34,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-15 12:43:34,495 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-10-15 12:43:34,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:34,496 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-15 12:43:34,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 12:43:34,496 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-15 12:43:34,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-15 12:43:34,497 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:34,497 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:34,498 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:34,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:34,498 INFO L82 PathProgramCache]: Analyzing trace with hash -2092341493, now seen corresponding path program 4 times [2018-10-15 12:43:34,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:34,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:34,698 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:34,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:34,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 12:43:34,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 12:43:34,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 12:43:34,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 12:43:34,701 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 9 states. [2018-10-15 12:43:34,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:34,884 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-15 12:43:34,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 12:43:34,884 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-10-15 12:43:34,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:34,886 INFO L225 Difference]: With dead ends: 29 [2018-10-15 12:43:34,886 INFO L226 Difference]: Without dead ends: 24 [2018-10-15 12:43:34,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:43:34,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-15 12:43:34,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-10-15 12:43:34,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-15 12:43:34,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-15 12:43:34,891 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-10-15 12:43:34,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:34,891 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-15 12:43:34,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 12:43:34,892 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-15 12:43:34,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-15 12:43:34,892 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:34,893 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:34,893 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:34,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:34,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1312800554, now seen corresponding path program 5 times [2018-10-15 12:43:34,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:35,277 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:35,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:35,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 12:43:35,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 12:43:35,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 12:43:35,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-15 12:43:35,280 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 10 states. [2018-10-15 12:43:35,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:35,527 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-15 12:43:35,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 12:43:35,528 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-10-15 12:43:35,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:35,529 INFO L225 Difference]: With dead ends: 31 [2018-10-15 12:43:35,529 INFO L226 Difference]: Without dead ends: 26 [2018-10-15 12:43:35,530 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-10-15 12:43:35,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-15 12:43:35,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-10-15 12:43:35,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-15 12:43:35,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-15 12:43:35,533 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-10-15 12:43:35,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:35,534 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-15 12:43:35,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 12:43:35,534 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-15 12:43:35,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-15 12:43:35,535 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:35,535 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:35,535 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:35,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:35,536 INFO L82 PathProgramCache]: Analyzing trace with hash 889228169, now seen corresponding path program 6 times [2018-10-15 12:43:35,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:35,838 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:35,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:35,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 12:43:35,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 12:43:35,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 12:43:35,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:43:35,840 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 11 states. [2018-10-15 12:43:36,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:36,055 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-10-15 12:43:36,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-15 12:43:36,056 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-10-15 12:43:36,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:36,058 INFO L225 Difference]: With dead ends: 33 [2018-10-15 12:43:36,058 INFO L226 Difference]: Without dead ends: 28 [2018-10-15 12:43:36,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-10-15 12:43:36,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-15 12:43:36,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-10-15 12:43:36,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-15 12:43:36,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-15 12:43:36,062 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-10-15 12:43:36,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:36,062 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-15 12:43:36,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 12:43:36,063 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-15 12:43:36,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-15 12:43:36,064 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:36,064 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:36,064 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:36,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:36,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1858059304, now seen corresponding path program 7 times [2018-10-15 12:43:36,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:36,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:36,563 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:36,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:36,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 12:43:36,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 12:43:36,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 12:43:36,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-10-15 12:43:36,565 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 12 states. [2018-10-15 12:43:36,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:36,795 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-15 12:43:36,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 12:43:36,795 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-10-15 12:43:36,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:36,797 INFO L225 Difference]: With dead ends: 35 [2018-10-15 12:43:36,797 INFO L226 Difference]: Without dead ends: 30 [2018-10-15 12:43:36,798 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-10-15 12:43:36,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-15 12:43:36,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-10-15 12:43:36,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-15 12:43:36,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-15 12:43:36,802 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-10-15 12:43:36,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:36,802 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-15 12:43:36,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 12:43:36,803 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-15 12:43:36,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-15 12:43:36,803 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:36,803 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:36,804 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:36,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:36,804 INFO L82 PathProgramCache]: Analyzing trace with hash 896876807, now seen corresponding path program 8 times [2018-10-15 12:43:36,805 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:37,153 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:37,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:37,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 12:43:37,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 12:43:37,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 12:43:37,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 12:43:37,155 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 13 states. [2018-10-15 12:43:37,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:37,715 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-10-15 12:43:37,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 12:43:37,715 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-10-15 12:43:37,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:37,717 INFO L225 Difference]: With dead ends: 37 [2018-10-15 12:43:37,717 INFO L226 Difference]: Without dead ends: 32 [2018-10-15 12:43:37,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:43:37,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-15 12:43:37,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-10-15 12:43:37,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-15 12:43:37,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-15 12:43:37,722 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-10-15 12:43:37,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:37,722 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-15 12:43:37,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 12:43:37,722 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-15 12:43:37,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-15 12:43:37,723 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:37,723 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:37,724 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:37,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:37,724 INFO L82 PathProgramCache]: Analyzing trace with hash 618465830, now seen corresponding path program 9 times [2018-10-15 12:43:37,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:38,096 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:38,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:38,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-15 12:43:38,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-15 12:43:38,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-15 12:43:38,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-15 12:43:38,098 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 14 states. [2018-10-15 12:43:38,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:38,470 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-15 12:43:38,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-15 12:43:38,471 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2018-10-15 12:43:38,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:38,472 INFO L225 Difference]: With dead ends: 39 [2018-10-15 12:43:38,473 INFO L226 Difference]: Without dead ends: 34 [2018-10-15 12:43:38,473 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-10-15 12:43:38,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-15 12:43:38,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-10-15 12:43:38,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-15 12:43:38,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-15 12:43:38,477 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-10-15 12:43:38,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:38,478 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-15 12:43:38,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-15 12:43:38,478 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-15 12:43:38,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-15 12:43:38,479 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:38,479 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:38,479 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:38,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:38,480 INFO L82 PathProgramCache]: Analyzing trace with hash -646510715, now seen corresponding path program 10 times [2018-10-15 12:43:38,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:39,027 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:39,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:39,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 12:43:39,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 12:43:39,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 12:43:39,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:43:39,029 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 15 states. [2018-10-15 12:43:39,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:39,400 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-15 12:43:39,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 12:43:39,400 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2018-10-15 12:43:39,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:39,401 INFO L225 Difference]: With dead ends: 41 [2018-10-15 12:43:39,401 INFO L226 Difference]: Without dead ends: 36 [2018-10-15 12:43:39,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:43:39,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-15 12:43:39,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-10-15 12:43:39,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-15 12:43:39,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-15 12:43:39,406 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-10-15 12:43:39,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:39,407 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-15 12:43:39,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 12:43:39,407 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-15 12:43:39,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-15 12:43:39,408 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:39,408 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:39,408 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:39,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:39,409 INFO L82 PathProgramCache]: Analyzing trace with hash -813225692, now seen corresponding path program 11 times [2018-10-15 12:43:39,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:39,708 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:39,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:39,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-15 12:43:39,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-15 12:43:39,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-15 12:43:39,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-10-15 12:43:39,710 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 16 states. [2018-10-15 12:43:40,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:40,219 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-15 12:43:40,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-15 12:43:40,222 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2018-10-15 12:43:40,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:40,222 INFO L225 Difference]: With dead ends: 43 [2018-10-15 12:43:40,222 INFO L226 Difference]: Without dead ends: 38 [2018-10-15 12:43:40,223 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-10-15 12:43:40,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-15 12:43:40,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-10-15 12:43:40,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-15 12:43:40,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-15 12:43:40,226 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-10-15 12:43:40,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:40,226 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-15 12:43:40,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-15 12:43:40,227 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-15 12:43:40,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-15 12:43:40,227 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:40,228 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:40,228 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:40,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:40,228 INFO L82 PathProgramCache]: Analyzing trace with hash -2112528637, now seen corresponding path program 12 times [2018-10-15 12:43:40,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:40,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:40,927 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:40,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:40,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 12:43:40,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 12:43:40,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 12:43:40,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:43:40,929 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 17 states. [2018-10-15 12:43:41,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:41,370 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-15 12:43:41,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-15 12:43:41,371 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-10-15 12:43:41,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:41,372 INFO L225 Difference]: With dead ends: 45 [2018-10-15 12:43:41,372 INFO L226 Difference]: Without dead ends: 40 [2018-10-15 12:43:41,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:43:41,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-15 12:43:41,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-10-15 12:43:41,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-15 12:43:41,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-15 12:43:41,377 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-10-15 12:43:41,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:41,377 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-15 12:43:41,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 12:43:41,377 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-15 12:43:41,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-15 12:43:41,378 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:41,378 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:41,379 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:41,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:41,379 INFO L82 PathProgramCache]: Analyzing trace with hash -907175646, now seen corresponding path program 13 times [2018-10-15 12:43:41,380 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:41,794 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:41,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:41,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-15 12:43:41,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-15 12:43:41,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-15 12:43:41,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-10-15 12:43:41,795 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 18 states. [2018-10-15 12:43:42,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:42,250 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-15 12:43:42,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 12:43:42,253 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2018-10-15 12:43:42,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:42,253 INFO L225 Difference]: With dead ends: 47 [2018-10-15 12:43:42,254 INFO L226 Difference]: Without dead ends: 42 [2018-10-15 12:43:42,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2018-10-15 12:43:42,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-15 12:43:42,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-10-15 12:43:42,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-15 12:43:42,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-15 12:43:42,258 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-10-15 12:43:42,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:42,258 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-15 12:43:42,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-15 12:43:42,258 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-15 12:43:42,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-15 12:43:42,259 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:42,259 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:42,260 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:42,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:42,260 INFO L82 PathProgramCache]: Analyzing trace with hash 2090846081, now seen corresponding path program 14 times [2018-10-15 12:43:42,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:42,727 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:42,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:42,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 12:43:42,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 12:43:42,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 12:43:42,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:43:42,729 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 19 states. [2018-10-15 12:43:44,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:44,088 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-10-15 12:43:44,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-15 12:43:44,089 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2018-10-15 12:43:44,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:44,089 INFO L225 Difference]: With dead ends: 49 [2018-10-15 12:43:44,090 INFO L226 Difference]: Without dead ends: 44 [2018-10-15 12:43:44,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:43:44,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-15 12:43:44,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-10-15 12:43:44,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-15 12:43:44,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-15 12:43:44,095 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-10-15 12:43:44,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:44,095 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-15 12:43:44,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 12:43:44,095 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-15 12:43:44,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-15 12:43:44,096 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:44,096 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:44,096 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:44,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:44,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1266670112, now seen corresponding path program 15 times [2018-10-15 12:43:44,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:44,472 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:44,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:44,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-15 12:43:44,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-15 12:43:44,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-15 12:43:44,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-10-15 12:43:44,474 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 20 states. [2018-10-15 12:43:45,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:45,162 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-10-15 12:43:45,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-15 12:43:45,163 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2018-10-15 12:43:45,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:45,163 INFO L225 Difference]: With dead ends: 51 [2018-10-15 12:43:45,164 INFO L226 Difference]: Without dead ends: 46 [2018-10-15 12:43:45,164 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2018-10-15 12:43:45,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-15 12:43:45,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-10-15 12:43:45,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-15 12:43:45,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-15 12:43:45,168 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-10-15 12:43:45,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:45,168 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-15 12:43:45,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-15 12:43:45,168 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-15 12:43:45,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-15 12:43:45,169 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:45,169 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:45,169 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:45,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:45,170 INFO L82 PathProgramCache]: Analyzing trace with hash -492453633, now seen corresponding path program 16 times [2018-10-15 12:43:45,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:45,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:45,675 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:45,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:45,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 12:43:45,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 12:43:45,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 12:43:45,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:43:45,677 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 21 states. [2018-10-15 12:43:46,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:46,513 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-10-15 12:43:46,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 12:43:46,513 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2018-10-15 12:43:46,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:46,514 INFO L225 Difference]: With dead ends: 53 [2018-10-15 12:43:46,514 INFO L226 Difference]: Without dead ends: 48 [2018-10-15 12:43:46,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:43:46,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-15 12:43:46,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-10-15 12:43:46,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-15 12:43:46,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-15 12:43:46,520 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-10-15 12:43:46,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:46,520 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-15 12:43:46,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 12:43:46,521 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-15 12:43:46,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-15 12:43:46,521 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:46,522 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:46,522 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:46,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:46,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1206742046, now seen corresponding path program 17 times [2018-10-15 12:43:46,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:46,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:47,931 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:47,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:47,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-15 12:43:47,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-15 12:43:47,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-15 12:43:47,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-10-15 12:43:47,933 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 22 states. [2018-10-15 12:43:48,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:48,790 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-10-15 12:43:48,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-15 12:43:48,791 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2018-10-15 12:43:48,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:48,792 INFO L225 Difference]: With dead ends: 55 [2018-10-15 12:43:48,792 INFO L226 Difference]: Without dead ends: 50 [2018-10-15 12:43:48,792 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2018-10-15 12:43:48,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-15 12:43:48,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-10-15 12:43:48,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-15 12:43:48,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-10-15 12:43:48,796 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-10-15 12:43:48,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:48,796 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-10-15 12:43:48,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-15 12:43:48,796 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-10-15 12:43:48,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-15 12:43:48,797 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:48,797 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:48,797 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:48,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:48,798 INFO L82 PathProgramCache]: Analyzing trace with hash 2046217085, now seen corresponding path program 18 times [2018-10-15 12:43:48,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:49,599 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:49,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:49,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 12:43:49,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 12:43:49,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 12:43:49,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:43:49,601 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 23 states. [2018-10-15 12:43:50,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:50,382 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-10-15 12:43:50,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-15 12:43:50,382 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2018-10-15 12:43:50,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:50,383 INFO L225 Difference]: With dead ends: 57 [2018-10-15 12:43:50,383 INFO L226 Difference]: Without dead ends: 52 [2018-10-15 12:43:50,383 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:43:50,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-15 12:43:50,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-10-15 12:43:50,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-15 12:43:50,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-15 12:43:50,386 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-10-15 12:43:50,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:50,387 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-15 12:43:50,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 12:43:50,387 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-15 12:43:50,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-15 12:43:50,388 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:50,388 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:50,388 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:50,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:50,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1327877916, now seen corresponding path program 19 times [2018-10-15 12:43:50,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:51,236 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:51,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:51,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-15 12:43:51,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-15 12:43:51,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-15 12:43:51,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-10-15 12:43:51,238 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 24 states. [2018-10-15 12:43:52,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:52,043 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-10-15 12:43:52,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 12:43:52,044 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2018-10-15 12:43:52,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:52,044 INFO L225 Difference]: With dead ends: 59 [2018-10-15 12:43:52,045 INFO L226 Difference]: Without dead ends: 54 [2018-10-15 12:43:52,045 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=55, Invalid=595, Unknown=0, NotChecked=0, Total=650 [2018-10-15 12:43:52,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-15 12:43:52,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-10-15 12:43:52,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-15 12:43:52,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-10-15 12:43:52,049 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-10-15 12:43:52,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:52,049 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-10-15 12:43:52,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-15 12:43:52,050 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-10-15 12:43:52,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-15 12:43:52,050 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:52,051 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:52,051 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:52,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:52,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1801296133, now seen corresponding path program 20 times [2018-10-15 12:43:52,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:52,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:53,049 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:53,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:53,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 12:43:53,050 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 12:43:53,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 12:43:53,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:43:53,051 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 25 states. [2018-10-15 12:43:53,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:53,957 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-10-15 12:43:53,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-15 12:43:53,957 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 52 [2018-10-15 12:43:53,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:53,958 INFO L225 Difference]: With dead ends: 61 [2018-10-15 12:43:53,958 INFO L226 Difference]: Without dead ends: 56 [2018-10-15 12:43:53,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=57, Invalid=645, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:43:53,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-15 12:43:53,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-10-15 12:43:53,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-15 12:43:53,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-10-15 12:43:53,962 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-10-15 12:43:53,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:53,962 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-10-15 12:43:53,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 12:43:53,962 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-10-15 12:43:53,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-15 12:43:53,963 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:53,963 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:53,964 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:53,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:53,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1834517274, now seen corresponding path program 21 times [2018-10-15 12:43:53,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:55,342 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:55,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:55,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-15 12:43:55,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-15 12:43:55,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-15 12:43:55,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-10-15 12:43:55,343 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 26 states. [2018-10-15 12:43:56,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:56,395 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-10-15 12:43:56,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-15 12:43:56,398 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 54 [2018-10-15 12:43:56,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:56,399 INFO L225 Difference]: With dead ends: 63 [2018-10-15 12:43:56,399 INFO L226 Difference]: Without dead ends: 58 [2018-10-15 12:43:56,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=59, Invalid=697, Unknown=0, NotChecked=0, Total=756 [2018-10-15 12:43:56,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-15 12:43:56,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-10-15 12:43:56,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-15 12:43:56,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-10-15 12:43:56,402 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-10-15 12:43:56,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:56,403 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-10-15 12:43:56,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-15 12:43:56,403 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-10-15 12:43:56,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-15 12:43:56,404 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:56,404 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:56,404 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:56,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:56,404 INFO L82 PathProgramCache]: Analyzing trace with hash -252177543, now seen corresponding path program 22 times [2018-10-15 12:43:56,405 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:56,916 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:56,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:56,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 12:43:56,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 12:43:56,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 12:43:56,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:43:56,918 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 27 states. [2018-10-15 12:43:57,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:57,925 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-10-15 12:43:57,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 12:43:57,926 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 56 [2018-10-15 12:43:57,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:57,926 INFO L225 Difference]: With dead ends: 65 [2018-10-15 12:43:57,926 INFO L226 Difference]: Without dead ends: 60 [2018-10-15 12:43:57,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=751, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:43:57,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-15 12:43:57,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2018-10-15 12:43:57,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-15 12:43:57,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-10-15 12:43:57,930 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-10-15 12:43:57,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:57,930 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-10-15 12:43:57,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 12:43:57,930 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-10-15 12:43:57,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-15 12:43:57,931 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:57,931 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:57,931 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:57,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:57,932 INFO L82 PathProgramCache]: Analyzing trace with hash 183830552, now seen corresponding path program 23 times [2018-10-15 12:43:57,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:57,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:58,606 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:58,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:58,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-15 12:43:58,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-15 12:43:58,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-15 12:43:58,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-10-15 12:43:58,608 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 28 states. [2018-10-15 12:43:59,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:59,673 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-10-15 12:43:59,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-15 12:43:59,674 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 58 [2018-10-15 12:43:59,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:59,675 INFO L225 Difference]: With dead ends: 67 [2018-10-15 12:43:59,675 INFO L226 Difference]: Without dead ends: 62 [2018-10-15 12:43:59,676 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=807, Unknown=0, NotChecked=0, Total=870 [2018-10-15 12:43:59,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-15 12:43:59,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-10-15 12:43:59,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-15 12:43:59,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-15 12:43:59,680 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-10-15 12:43:59,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:59,680 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-15 12:43:59,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-15 12:43:59,680 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-15 12:43:59,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-15 12:43:59,681 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:59,681 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:59,681 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:59,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:59,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1719185161, now seen corresponding path program 24 times [2018-10-15 12:43:59,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:00,745 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:00,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:00,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 12:44:00,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 12:44:00,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 12:44:00,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:44:00,747 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 29 states. [2018-10-15 12:44:01,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:01,883 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-10-15 12:44:01,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-15 12:44:01,884 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 60 [2018-10-15 12:44:01,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:01,885 INFO L225 Difference]: With dead ends: 69 [2018-10-15 12:44:01,885 INFO L226 Difference]: Without dead ends: 64 [2018-10-15 12:44:01,886 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=65, Invalid=865, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:44:01,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-15 12:44:01,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-10-15 12:44:01,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-15 12:44:01,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-10-15 12:44:01,889 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2018-10-15 12:44:01,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:01,890 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-10-15 12:44:01,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 12:44:01,890 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-10-15 12:44:01,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-15 12:44:01,890 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:01,891 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:01,891 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:01,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:01,891 INFO L82 PathProgramCache]: Analyzing trace with hash -861217258, now seen corresponding path program 25 times [2018-10-15 12:44:01,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:02,816 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:02,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:02,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-15 12:44:02,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-15 12:44:02,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-15 12:44:02,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-10-15 12:44:02,818 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 30 states. [2018-10-15 12:44:04,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:04,007 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-10-15 12:44:04,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 12:44:04,007 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 62 [2018-10-15 12:44:04,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:04,008 INFO L225 Difference]: With dead ends: 71 [2018-10-15 12:44:04,008 INFO L226 Difference]: Without dead ends: 66 [2018-10-15 12:44:04,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=67, Invalid=925, Unknown=0, NotChecked=0, Total=992 [2018-10-15 12:44:04,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-15 12:44:04,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-10-15 12:44:04,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-15 12:44:04,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-10-15 12:44:04,011 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2018-10-15 12:44:04,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:04,011 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-10-15 12:44:04,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-15 12:44:04,012 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-10-15 12:44:04,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-15 12:44:04,012 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:04,012 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:04,013 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:04,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:04,013 INFO L82 PathProgramCache]: Analyzing trace with hash -987783307, now seen corresponding path program 26 times [2018-10-15 12:44:04,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:04,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:04,687 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:04,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:04,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 12:44:04,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 12:44:04,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 12:44:04,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:44:04,689 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 31 states. [2018-10-15 12:44:06,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:06,114 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-10-15 12:44:06,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-15 12:44:06,117 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 64 [2018-10-15 12:44:06,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:06,118 INFO L225 Difference]: With dead ends: 73 [2018-10-15 12:44:06,118 INFO L226 Difference]: Without dead ends: 68 [2018-10-15 12:44:06,118 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=987, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:44:06,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-15 12:44:06,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-10-15 12:44:06,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-15 12:44:06,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-10-15 12:44:06,120 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2018-10-15 12:44:06,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:06,120 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-10-15 12:44:06,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 12:44:06,120 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-10-15 12:44:06,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-15 12:44:06,121 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:06,121 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:06,121 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:06,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:06,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1936295188, now seen corresponding path program 27 times [2018-10-15 12:44:06,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:07,340 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:07,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:07,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-15 12:44:07,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-15 12:44:07,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-15 12:44:07,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-10-15 12:44:07,341 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 32 states. [2018-10-15 12:44:08,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:08,746 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-10-15 12:44:08,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-15 12:44:08,747 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 66 [2018-10-15 12:44:08,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:08,748 INFO L225 Difference]: With dead ends: 75 [2018-10-15 12:44:08,748 INFO L226 Difference]: Without dead ends: 70 [2018-10-15 12:44:08,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=71, Invalid=1051, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 12:44:08,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-15 12:44:08,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-10-15 12:44:08,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-15 12:44:08,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-10-15 12:44:08,751 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2018-10-15 12:44:08,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:08,751 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-10-15 12:44:08,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-15 12:44:08,752 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-10-15 12:44:08,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-15 12:44:08,752 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:08,752 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:08,753 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:08,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:08,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1227849997, now seen corresponding path program 28 times [2018-10-15 12:44:08,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:09,767 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:09,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:09,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:44:09,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:44:09,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:44:09,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:44:09,769 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 33 states. [2018-10-15 12:44:11,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:11,401 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-10-15 12:44:11,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 12:44:11,401 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 68 [2018-10-15 12:44:11,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:11,402 INFO L225 Difference]: With dead ends: 77 [2018-10-15 12:44:11,402 INFO L226 Difference]: Without dead ends: 72 [2018-10-15 12:44:11,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=73, Invalid=1117, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:44:11,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-10-15 12:44:11,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-10-15 12:44:11,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-15 12:44:11,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-10-15 12:44:11,406 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2018-10-15 12:44:11,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:11,406 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-10-15 12:44:11,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:44:11,406 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-10-15 12:44:11,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-15 12:44:11,407 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:11,407 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:11,407 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:11,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:11,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1134527214, now seen corresponding path program 29 times [2018-10-15 12:44:11,408 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:12,267 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:12,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:12,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-15 12:44:12,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-15 12:44:12,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-15 12:44:12,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 12:44:12,269 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 34 states. [2018-10-15 12:44:13,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:13,840 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-10-15 12:44:13,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-15 12:44:13,841 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 70 [2018-10-15 12:44:13,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:13,842 INFO L225 Difference]: With dead ends: 79 [2018-10-15 12:44:13,842 INFO L226 Difference]: Without dead ends: 74 [2018-10-15 12:44:13,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=75, Invalid=1185, Unknown=0, NotChecked=0, Total=1260 [2018-10-15 12:44:13,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-15 12:44:13,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-10-15 12:44:13,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-15 12:44:13,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-10-15 12:44:13,845 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2018-10-15 12:44:13,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:13,845 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-10-15 12:44:13,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-15 12:44:13,845 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-10-15 12:44:13,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-15 12:44:13,845 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:13,846 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:13,846 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:13,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:13,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1645645967, now seen corresponding path program 30 times [2018-10-15 12:44:13,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:16,256 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:16,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:16,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:44:16,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:44:16,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:44:16,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:44:16,258 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 35 states. [2018-10-15 12:44:17,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:17,974 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-10-15 12:44:17,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-15 12:44:17,975 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 72 [2018-10-15 12:44:17,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:17,976 INFO L225 Difference]: With dead ends: 81 [2018-10-15 12:44:17,976 INFO L226 Difference]: Without dead ends: 76 [2018-10-15 12:44:17,977 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=77, Invalid=1255, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:44:17,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-15 12:44:17,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-10-15 12:44:17,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-15 12:44:17,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-10-15 12:44:17,980 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2018-10-15 12:44:17,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:17,980 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-10-15 12:44:17,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:44:17,980 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-10-15 12:44:17,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-15 12:44:17,981 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:17,981 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:17,981 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:17,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:17,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1090471440, now seen corresponding path program 31 times [2018-10-15 12:44:17,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:17,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:18,943 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:18,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:18,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-15 12:44:18,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-15 12:44:18,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-15 12:44:18,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-10-15 12:44:18,945 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 36 states. [2018-10-15 12:44:20,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:20,737 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-10-15 12:44:20,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 12:44:20,737 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 74 [2018-10-15 12:44:20,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:20,738 INFO L225 Difference]: With dead ends: 83 [2018-10-15 12:44:20,738 INFO L226 Difference]: Without dead ends: 78 [2018-10-15 12:44:20,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=79, Invalid=1327, Unknown=0, NotChecked=0, Total=1406 [2018-10-15 12:44:20,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-15 12:44:20,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-10-15 12:44:20,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-15 12:44:20,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-10-15 12:44:20,741 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2018-10-15 12:44:20,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:20,741 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-10-15 12:44:20,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-15 12:44:20,742 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-10-15 12:44:20,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-15 12:44:20,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:20,742 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:20,742 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:20,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:20,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1979314415, now seen corresponding path program 32 times [2018-10-15 12:44:20,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:22,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:22,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:22,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:44:22,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:44:22,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:44:22,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:44:22,303 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 37 states. [2018-10-15 12:44:24,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:24,282 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-10-15 12:44:24,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-15 12:44:24,283 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 76 [2018-10-15 12:44:24,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:24,284 INFO L225 Difference]: With dead ends: 85 [2018-10-15 12:44:24,284 INFO L226 Difference]: Without dead ends: 80 [2018-10-15 12:44:24,286 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=81, Invalid=1401, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:44:24,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-15 12:44:24,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2018-10-15 12:44:24,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-15 12:44:24,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-10-15 12:44:24,288 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2018-10-15 12:44:24,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:24,289 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-10-15 12:44:24,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:44:24,289 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-10-15 12:44:24,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-15 12:44:24,289 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:24,290 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:24,290 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:24,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:24,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1458921486, now seen corresponding path program 33 times [2018-10-15 12:44:24,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:25,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:25,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:25,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-15 12:44:25,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-15 12:44:25,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-15 12:44:25,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-10-15 12:44:25,266 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 38 states. [2018-10-15 12:44:27,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:27,398 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-10-15 12:44:27,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-15 12:44:27,398 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 78 [2018-10-15 12:44:27,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:27,399 INFO L225 Difference]: With dead ends: 87 [2018-10-15 12:44:27,400 INFO L226 Difference]: Without dead ends: 82 [2018-10-15 12:44:27,401 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=83, Invalid=1477, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 12:44:27,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-15 12:44:27,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-10-15 12:44:27,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-15 12:44:27,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-10-15 12:44:27,404 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2018-10-15 12:44:27,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:27,404 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-10-15 12:44:27,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-15 12:44:27,405 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-10-15 12:44:27,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-15 12:44:27,405 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:27,405 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:27,406 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:27,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:27,406 INFO L82 PathProgramCache]: Analyzing trace with hash -422476947, now seen corresponding path program 34 times [2018-10-15 12:44:27,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:28,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:28,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:28,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:44:28,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:44:28,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:44:28,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:44:28,347 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 39 states. [2018-10-15 12:44:30,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:30,511 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-10-15 12:44:30,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 12:44:30,511 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 80 [2018-10-15 12:44:30,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:30,512 INFO L225 Difference]: With dead ends: 89 [2018-10-15 12:44:30,512 INFO L226 Difference]: Without dead ends: 84 [2018-10-15 12:44:30,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=85, Invalid=1555, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:44:30,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-10-15 12:44:30,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-10-15 12:44:30,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-15 12:44:30,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-10-15 12:44:30,516 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2018-10-15 12:44:30,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:30,516 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-10-15 12:44:30,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:44:30,516 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-10-15 12:44:30,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-15 12:44:30,517 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:30,517 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:30,517 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:30,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:30,517 INFO L82 PathProgramCache]: Analyzing trace with hash -265139444, now seen corresponding path program 35 times [2018-10-15 12:44:30,518 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:32,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:32,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:32,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-15 12:44:32,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-15 12:44:32,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-15 12:44:32,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 12:44:32,007 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 40 states. [2018-10-15 12:44:34,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:34,304 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-10-15 12:44:34,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-15 12:44:34,304 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 82 [2018-10-15 12:44:34,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:34,306 INFO L225 Difference]: With dead ends: 91 [2018-10-15 12:44:34,306 INFO L226 Difference]: Without dead ends: 86 [2018-10-15 12:44:34,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=87, Invalid=1635, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 12:44:34,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-10-15 12:44:34,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-10-15 12:44:34,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-15 12:44:34,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-10-15 12:44:34,309 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2018-10-15 12:44:34,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:34,309 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-10-15 12:44:34,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-15 12:44:34,310 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-10-15 12:44:34,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-15 12:44:34,310 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:34,310 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:34,311 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:34,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:34,311 INFO L82 PathProgramCache]: Analyzing trace with hash 612345579, now seen corresponding path program 36 times [2018-10-15 12:44:34,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:35,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:35,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:35,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:44:35,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:44:35,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:44:35,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:44:35,968 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 41 states. [2018-10-15 12:44:38,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:38,500 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-10-15 12:44:38,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-15 12:44:38,501 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 84 [2018-10-15 12:44:38,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:38,502 INFO L225 Difference]: With dead ends: 93 [2018-10-15 12:44:38,502 INFO L226 Difference]: Without dead ends: 88 [2018-10-15 12:44:38,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=89, Invalid=1717, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:44:38,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-10-15 12:44:38,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-10-15 12:44:38,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-15 12:44:38,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-10-15 12:44:38,506 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2018-10-15 12:44:38,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:38,507 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-10-15 12:44:38,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:44:38,507 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-10-15 12:44:38,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-15 12:44:38,507 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:38,508 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:38,508 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:38,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:38,508 INFO L82 PathProgramCache]: Analyzing trace with hash 2061862666, now seen corresponding path program 37 times [2018-10-15 12:44:38,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:39,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:39,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:39,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-15 12:44:39,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-15 12:44:39,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-15 12:44:39,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 12:44:39,776 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 42 states. [2018-10-15 12:44:42,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:42,434 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-10-15 12:44:42,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 12:44:42,435 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 86 [2018-10-15 12:44:42,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:42,436 INFO L225 Difference]: With dead ends: 95 [2018-10-15 12:44:42,436 INFO L226 Difference]: Without dead ends: 90 [2018-10-15 12:44:42,437 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=91, Invalid=1801, Unknown=0, NotChecked=0, Total=1892 [2018-10-15 12:44:42,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-15 12:44:42,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-10-15 12:44:42,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-15 12:44:42,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-10-15 12:44:42,440 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2018-10-15 12:44:42,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:42,440 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-10-15 12:44:42,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-15 12:44:42,441 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-10-15 12:44:42,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-15 12:44:42,441 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:42,441 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:42,442 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:42,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:42,442 INFO L82 PathProgramCache]: Analyzing trace with hash -816587927, now seen corresponding path program 38 times [2018-10-15 12:44:42,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:42,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:43,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:43,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:43,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:44:43,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:44:43,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:44:43,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:44:43,635 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 43 states. [2018-10-15 12:44:46,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:46,210 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-10-15 12:44:46,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-15 12:44:46,211 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 88 [2018-10-15 12:44:46,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:46,212 INFO L225 Difference]: With dead ends: 97 [2018-10-15 12:44:46,212 INFO L226 Difference]: Without dead ends: 92 [2018-10-15 12:44:46,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=93, Invalid=1887, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:44:46,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-10-15 12:44:46,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2018-10-15 12:44:46,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-15 12:44:46,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-10-15 12:44:46,216 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2018-10-15 12:44:46,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:46,217 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-10-15 12:44:46,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:44:46,217 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-10-15 12:44:46,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-15 12:44:46,217 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:46,217 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:46,218 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:46,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:46,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1048669176, now seen corresponding path program 39 times [2018-10-15 12:44:46,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:47,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:47,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:47,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-15 12:44:47,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-15 12:44:47,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-15 12:44:47,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-10-15 12:44:47,704 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 44 states. [2018-10-15 12:44:50,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:50,427 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-10-15 12:44:50,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-15 12:44:50,428 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 90 [2018-10-15 12:44:50,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:50,429 INFO L225 Difference]: With dead ends: 99 [2018-10-15 12:44:50,429 INFO L226 Difference]: Without dead ends: 94 [2018-10-15 12:44:50,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=95, Invalid=1975, Unknown=0, NotChecked=0, Total=2070 [2018-10-15 12:44:50,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-15 12:44:50,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-10-15 12:44:50,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-15 12:44:50,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-10-15 12:44:50,432 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2018-10-15 12:44:50,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:50,433 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-10-15 12:44:50,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-15 12:44:50,433 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-10-15 12:44:50,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-15 12:44:50,433 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:50,433 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:50,433 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:50,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:50,434 INFO L82 PathProgramCache]: Analyzing trace with hash -740450073, now seen corresponding path program 40 times [2018-10-15 12:44:50,434 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:51,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:51,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:51,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:44:51,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:44:51,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:44:51,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:44:51,870 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 45 states. [2018-10-15 12:44:54,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:54,711 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-10-15 12:44:54,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 12:44:54,711 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 92 [2018-10-15 12:44:54,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:54,712 INFO L225 Difference]: With dead ends: 101 [2018-10-15 12:44:54,713 INFO L226 Difference]: Without dead ends: 96 [2018-10-15 12:44:54,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=97, Invalid=2065, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:44:54,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-10-15 12:44:54,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-10-15 12:44:54,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-15 12:44:54,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-10-15 12:44:54,716 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2018-10-15 12:44:54,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:54,717 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-10-15 12:44:54,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:44:54,717 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-10-15 12:44:54,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-15 12:44:54,717 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:54,718 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:54,718 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:54,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:54,718 INFO L82 PathProgramCache]: Analyzing trace with hash -894635514, now seen corresponding path program 41 times [2018-10-15 12:44:54,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:56,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:56,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:56,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-15 12:44:56,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-15 12:44:56,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-15 12:44:56,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-10-15 12:44:56,473 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 46 states. [2018-10-15 12:44:59,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:59,558 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-10-15 12:44:59,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-15 12:44:59,558 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 94 [2018-10-15 12:44:59,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:59,559 INFO L225 Difference]: With dead ends: 103 [2018-10-15 12:44:59,559 INFO L226 Difference]: Without dead ends: 98 [2018-10-15 12:44:59,560 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=99, Invalid=2157, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 12:44:59,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-15 12:44:59,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-10-15 12:44:59,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-15 12:44:59,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-10-15 12:44:59,563 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2018-10-15 12:44:59,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:59,563 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-10-15 12:44:59,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-15 12:44:59,563 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-10-15 12:44:59,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-15 12:44:59,564 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:59,564 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:59,564 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:59,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:59,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1257011045, now seen corresponding path program 42 times [2018-10-15 12:44:59,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:00,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:00,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:00,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:45:00,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:45:00,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:45:00,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:45:00,804 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 47 states. [2018-10-15 12:45:04,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:04,011 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-10-15 12:45:04,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-15 12:45:04,011 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 96 [2018-10-15 12:45:04,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:04,012 INFO L225 Difference]: With dead ends: 105 [2018-10-15 12:45:04,012 INFO L226 Difference]: Without dead ends: 100 [2018-10-15 12:45:04,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=101, Invalid=2251, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:45:04,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-10-15 12:45:04,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2018-10-15 12:45:04,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-15 12:45:04,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-10-15 12:45:04,016 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2018-10-15 12:45:04,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:04,016 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-10-15 12:45:04,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:45:04,017 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-10-15 12:45:04,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-15 12:45:04,017 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:04,017 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:04,017 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:04,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:04,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1184882428, now seen corresponding path program 43 times [2018-10-15 12:45:04,018 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:05,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:05,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:05,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-15 12:45:05,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-15 12:45:05,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-15 12:45:05,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 12:45:05,549 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 48 states. [2018-10-15 12:45:08,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:08,948 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-10-15 12:45:08,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 12:45:08,948 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 98 [2018-10-15 12:45:08,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:08,949 INFO L225 Difference]: With dead ends: 107 [2018-10-15 12:45:08,950 INFO L226 Difference]: Without dead ends: 102 [2018-10-15 12:45:08,950 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=103, Invalid=2347, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 12:45:08,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-15 12:45:08,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-10-15 12:45:08,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-15 12:45:08,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-10-15 12:45:08,954 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2018-10-15 12:45:08,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:08,954 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-10-15 12:45:08,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-15 12:45:08,954 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-10-15 12:45:08,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-15 12:45:08,955 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:08,955 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:08,955 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:08,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:08,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1502600931, now seen corresponding path program 44 times [2018-10-15 12:45:08,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:10,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:10,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:10,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:45:10,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:45:10,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:45:10,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:45:10,714 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 49 states. [2018-10-15 12:45:14,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:14,217 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-10-15 12:45:14,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-15 12:45:14,217 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 100 [2018-10-15 12:45:14,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:14,219 INFO L225 Difference]: With dead ends: 109 [2018-10-15 12:45:14,219 INFO L226 Difference]: Without dead ends: 104 [2018-10-15 12:45:14,219 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=105, Invalid=2445, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:45:14,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-15 12:45:14,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2018-10-15 12:45:14,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-15 12:45:14,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-10-15 12:45:14,222 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2018-10-15 12:45:14,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:14,223 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-10-15 12:45:14,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:45:14,223 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-10-15 12:45:14,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-15 12:45:14,223 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:14,224 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:14,224 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:14,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:14,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1396203262, now seen corresponding path program 45 times [2018-10-15 12:45:14,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:15,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:15,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:15,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-15 12:45:15,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-15 12:45:15,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-15 12:45:15,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 12:45:15,686 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 50 states. [2018-10-15 12:45:19,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:19,337 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-10-15 12:45:19,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-15 12:45:19,338 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 102 [2018-10-15 12:45:19,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:19,339 INFO L225 Difference]: With dead ends: 111 [2018-10-15 12:45:19,339 INFO L226 Difference]: Without dead ends: 106 [2018-10-15 12:45:19,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=107, Invalid=2545, Unknown=0, NotChecked=0, Total=2652 [2018-10-15 12:45:19,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-15 12:45:19,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-10-15 12:45:19,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-15 12:45:19,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-10-15 12:45:19,343 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2018-10-15 12:45:19,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:19,343 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-10-15 12:45:19,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-15 12:45:19,344 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-10-15 12:45:19,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-15 12:45:19,344 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:19,344 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:19,344 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:19,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:19,345 INFO L82 PathProgramCache]: Analyzing trace with hash 286742369, now seen corresponding path program 46 times [2018-10-15 12:45:19,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:19,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:20,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:20,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:20,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:45:20,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:45:20,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:45:20,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:45:20,905 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 51 states. [2018-10-15 12:45:24,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:24,679 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-10-15 12:45:24,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 12:45:24,679 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 104 [2018-10-15 12:45:24,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:24,680 INFO L225 Difference]: With dead ends: 113 [2018-10-15 12:45:24,680 INFO L226 Difference]: Without dead ends: 108 [2018-10-15 12:45:24,681 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=109, Invalid=2647, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:45:24,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-15 12:45:24,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-10-15 12:45:24,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-15 12:45:24,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-10-15 12:45:24,684 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2018-10-15 12:45:24,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:24,685 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-10-15 12:45:24,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:45:24,685 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-10-15 12:45:24,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-15 12:45:24,685 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:24,685 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:24,686 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:24,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:24,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1605176832, now seen corresponding path program 47 times [2018-10-15 12:45:24,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:26,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:26,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:26,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-15 12:45:26,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-15 12:45:26,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-15 12:45:26,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-10-15 12:45:26,155 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 52 states. [2018-10-15 12:45:30,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:30,011 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-10-15 12:45:30,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-15 12:45:30,012 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 106 [2018-10-15 12:45:30,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:30,013 INFO L225 Difference]: With dead ends: 115 [2018-10-15 12:45:30,013 INFO L226 Difference]: Without dead ends: 110 [2018-10-15 12:45:30,014 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=111, Invalid=2751, Unknown=0, NotChecked=0, Total=2862 [2018-10-15 12:45:30,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-15 12:45:30,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2018-10-15 12:45:30,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-15 12:45:30,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-10-15 12:45:30,017 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2018-10-15 12:45:30,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:30,017 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-10-15 12:45:30,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-15 12:45:30,017 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-10-15 12:45:30,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-15 12:45:30,017 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:30,017 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:30,018 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:30,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:30,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1326604511, now seen corresponding path program 48 times [2018-10-15 12:45:30,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:31,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:31,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:31,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 12:45:31,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:45:31,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:45:31,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:45:31,673 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 53 states. [2018-10-15 12:45:36,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:36,593 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-10-15 12:45:36,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-15 12:45:36,593 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 108 [2018-10-15 12:45:36,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:36,595 INFO L225 Difference]: With dead ends: 117 [2018-10-15 12:45:36,595 INFO L226 Difference]: Without dead ends: 112 [2018-10-15 12:45:36,596 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=113, Invalid=2857, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:45:36,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-10-15 12:45:36,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2018-10-15 12:45:36,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-15 12:45:36,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-10-15 12:45:36,598 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2018-10-15 12:45:36,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:36,599 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-10-15 12:45:36,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:45:36,599 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-10-15 12:45:36,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-15 12:45:36,599 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:36,600 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:36,600 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:36,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:36,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1269928958, now seen corresponding path program 49 times [2018-10-15 12:45:36,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:39,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:39,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:39,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-15 12:45:39,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-15 12:45:39,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-15 12:45:39,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-10-15 12:45:39,191 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 54 states. [2018-10-15 12:45:43,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:43,280 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-10-15 12:45:43,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 12:45:43,281 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 110 [2018-10-15 12:45:43,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:43,282 INFO L225 Difference]: With dead ends: 119 [2018-10-15 12:45:43,282 INFO L226 Difference]: Without dead ends: 114 [2018-10-15 12:45:43,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=115, Invalid=2965, Unknown=0, NotChecked=0, Total=3080 [2018-10-15 12:45:43,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-15 12:45:43,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-10-15 12:45:43,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-15 12:45:43,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-10-15 12:45:43,287 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2018-10-15 12:45:43,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:43,287 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-10-15 12:45:43,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-15 12:45:43,287 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-10-15 12:45:43,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-15 12:45:43,288 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:43,288 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:43,288 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:43,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:43,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1655669923, now seen corresponding path program 50 times [2018-10-15 12:45:43,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:43,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:45,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:45,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:45,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 12:45:45,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 12:45:45,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 12:45:45,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:45:45,017 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 55 states. [2018-10-15 12:45:49,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:49,298 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-10-15 12:45:49,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-15 12:45:49,298 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 112 [2018-10-15 12:45:49,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:49,299 INFO L225 Difference]: With dead ends: 121 [2018-10-15 12:45:49,300 INFO L226 Difference]: Without dead ends: 116 [2018-10-15 12:45:49,300 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=117, Invalid=3075, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 12:45:49,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-10-15 12:45:49,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2018-10-15 12:45:49,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-15 12:45:49,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-10-15 12:45:49,302 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2018-10-15 12:45:49,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:49,303 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-10-15 12:45:49,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 12:45:49,303 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-10-15 12:45:49,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-15 12:45:49,303 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:49,304 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:49,304 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:49,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:49,304 INFO L82 PathProgramCache]: Analyzing trace with hash 47384316, now seen corresponding path program 51 times [2018-10-15 12:45:49,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:50,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:50,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:50,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-15 12:45:50,982 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-15 12:45:50,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-15 12:45:50,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-10-15 12:45:50,982 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 56 states. [2018-10-15 12:45:55,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:55,427 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-10-15 12:45:55,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-15 12:45:55,428 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 114 [2018-10-15 12:45:55,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:55,429 INFO L225 Difference]: With dead ends: 123 [2018-10-15 12:45:55,429 INFO L226 Difference]: Without dead ends: 118 [2018-10-15 12:45:55,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=119, Invalid=3187, Unknown=0, NotChecked=0, Total=3306 [2018-10-15 12:45:55,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-10-15 12:45:55,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-10-15 12:45:55,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-15 12:45:55,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-10-15 12:45:55,433 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2018-10-15 12:45:55,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:55,434 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-10-15 12:45:55,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-15 12:45:55,434 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-10-15 12:45:55,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-15 12:45:55,435 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:55,435 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:55,435 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:55,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:55,435 INFO L82 PathProgramCache]: Analyzing trace with hash 299968219, now seen corresponding path program 52 times [2018-10-15 12:45:55,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:55,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:57,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:57,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:57,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 12:45:57,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 12:45:57,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 12:45:57,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 12:45:57,530 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 57 states. [2018-10-15 12:46:02,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:02,178 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-10-15 12:46:02,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 12:46:02,178 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 116 [2018-10-15 12:46:02,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:02,179 INFO L225 Difference]: With dead ends: 125 [2018-10-15 12:46:02,180 INFO L226 Difference]: Without dead ends: 120 [2018-10-15 12:46:02,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=121, Invalid=3301, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:46:02,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-15 12:46:02,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2018-10-15 12:46:02,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-15 12:46:02,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-10-15 12:46:02,183 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2018-10-15 12:46:02,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:02,184 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-10-15 12:46:02,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 12:46:02,184 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-10-15 12:46:02,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-15 12:46:02,185 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:02,185 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:02,185 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:02,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:02,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1780036870, now seen corresponding path program 53 times [2018-10-15 12:46:02,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:04,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:04,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:04,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-15 12:46:04,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-15 12:46:04,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-15 12:46:04,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-10-15 12:46:04,353 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 58 states. [2018-10-15 12:46:09,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:09,064 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-10-15 12:46:09,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-15 12:46:09,064 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 118 [2018-10-15 12:46:09,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:09,065 INFO L225 Difference]: With dead ends: 127 [2018-10-15 12:46:09,065 INFO L226 Difference]: Without dead ends: 122 [2018-10-15 12:46:09,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=123, Invalid=3417, Unknown=0, NotChecked=0, Total=3540 [2018-10-15 12:46:09,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-10-15 12:46:09,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-10-15 12:46:09,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-15 12:46:09,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-10-15 12:46:09,069 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2018-10-15 12:46:09,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:09,069 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-10-15 12:46:09,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-15 12:46:09,069 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-10-15 12:46:09,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-15 12:46:09,070 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:09,070 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:09,070 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:09,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:09,071 INFO L82 PathProgramCache]: Analyzing trace with hash 789832537, now seen corresponding path program 54 times [2018-10-15 12:46:09,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:11,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:11,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:11,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 12:46:11,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 12:46:11,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 12:46:11,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:46:11,918 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 59 states. [2018-10-15 12:46:16,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:16,951 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-10-15 12:46:16,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-15 12:46:16,952 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 120 [2018-10-15 12:46:16,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:16,953 INFO L225 Difference]: With dead ends: 129 [2018-10-15 12:46:16,953 INFO L226 Difference]: Without dead ends: 124 [2018-10-15 12:46:16,953 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=125, Invalid=3535, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 12:46:16,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-10-15 12:46:16,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2018-10-15 12:46:16,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-15 12:46:16,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-10-15 12:46:16,956 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2018-10-15 12:46:16,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:16,956 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-10-15 12:46:16,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 12:46:16,956 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-10-15 12:46:16,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-15 12:46:16,957 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:16,957 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:16,957 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:16,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:16,958 INFO L82 PathProgramCache]: Analyzing trace with hash 828137464, now seen corresponding path program 55 times [2018-10-15 12:46:16,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:16,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:19,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:19,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:19,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-15 12:46:19,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-15 12:46:19,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-15 12:46:19,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-10-15 12:46:19,807 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 60 states. [2018-10-15 12:46:24,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:24,855 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-10-15 12:46:24,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 12:46:24,856 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 122 [2018-10-15 12:46:24,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:24,857 INFO L225 Difference]: With dead ends: 131 [2018-10-15 12:46:24,857 INFO L226 Difference]: Without dead ends: 126 [2018-10-15 12:46:24,857 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=127, Invalid=3655, Unknown=0, NotChecked=0, Total=3782 [2018-10-15 12:46:24,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-15 12:46:24,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-10-15 12:46:24,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-15 12:46:24,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-10-15 12:46:24,860 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2018-10-15 12:46:24,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:24,861 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-10-15 12:46:24,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-15 12:46:24,861 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-10-15 12:46:24,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-15 12:46:24,861 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:24,862 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:24,862 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:24,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:24,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1015533353, now seen corresponding path program 56 times [2018-10-15 12:46:24,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:26,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:26,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:26,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 12:46:26,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 12:46:26,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 12:46:26,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 12:46:26,865 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 61 states. [2018-10-15 12:46:32,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:32,102 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-10-15 12:46:32,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-15 12:46:32,103 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 124 [2018-10-15 12:46:32,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:32,104 INFO L225 Difference]: With dead ends: 133 [2018-10-15 12:46:32,104 INFO L226 Difference]: Without dead ends: 128 [2018-10-15 12:46:32,104 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=129, Invalid=3777, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:46:32,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-15 12:46:32,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2018-10-15 12:46:32,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-15 12:46:32,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-10-15 12:46:32,107 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2018-10-15 12:46:32,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:32,107 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-10-15 12:46:32,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 12:46:32,107 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-10-15 12:46:32,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-15 12:46:32,108 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:32,108 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:32,108 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:32,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:32,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1038304758, now seen corresponding path program 57 times [2018-10-15 12:46:32,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:34,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:34,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:34,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-15 12:46:34,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-15 12:46:34,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-15 12:46:34,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-10-15 12:46:34,253 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 62 states. [2018-10-15 12:46:39,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:39,740 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-10-15 12:46:39,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-15 12:46:39,741 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 126 [2018-10-15 12:46:39,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:39,742 INFO L225 Difference]: With dead ends: 135 [2018-10-15 12:46:39,742 INFO L226 Difference]: Without dead ends: 130 [2018-10-15 12:46:39,742 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=131, Invalid=3901, Unknown=0, NotChecked=0, Total=4032 [2018-10-15 12:46:39,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-15 12:46:39,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-10-15 12:46:39,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-15 12:46:39,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-10-15 12:46:39,745 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2018-10-15 12:46:39,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:39,745 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-10-15 12:46:39,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-15 12:46:39,745 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-10-15 12:46:39,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-15 12:46:39,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:39,745 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:39,746 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:39,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:39,746 INFO L82 PathProgramCache]: Analyzing trace with hash -908226731, now seen corresponding path program 58 times [2018-10-15 12:46:39,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:41,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:41,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:41,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 12:46:41,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 12:46:41,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 12:46:41,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:46:41,866 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 63 states. [2018-10-15 12:46:47,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:47,396 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-10-15 12:46:47,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 12:46:47,396 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 128 [2018-10-15 12:46:47,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:47,397 INFO L225 Difference]: With dead ends: 137 [2018-10-15 12:46:47,397 INFO L226 Difference]: Without dead ends: 132 [2018-10-15 12:46:47,398 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=133, Invalid=4027, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 12:46:47,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-10-15 12:46:47,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2018-10-15 12:46:47,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-15 12:46:47,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-10-15 12:46:47,401 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2018-10-15 12:46:47,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:47,401 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-10-15 12:46:47,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 12:46:47,401 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-10-15 12:46:47,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-15 12:46:47,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:47,402 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:47,402 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:47,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:47,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1080753396, now seen corresponding path program 59 times [2018-10-15 12:46:47,403 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:47,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:50,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:50,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:50,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-15 12:46:50,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-15 12:46:50,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-15 12:46:50,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-10-15 12:46:50,652 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 64 states. [2018-10-15 12:46:56,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:56,338 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-10-15 12:46:56,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-15 12:46:56,338 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 130 [2018-10-15 12:46:56,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:56,339 INFO L225 Difference]: With dead ends: 139 [2018-10-15 12:46:56,340 INFO L226 Difference]: Without dead ends: 134 [2018-10-15 12:46:56,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=135, Invalid=4155, Unknown=0, NotChecked=0, Total=4290 [2018-10-15 12:46:56,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-15 12:46:56,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-10-15 12:46:56,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-15 12:46:56,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-10-15 12:46:56,342 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2018-10-15 12:46:56,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:56,343 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-10-15 12:46:56,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-15 12:46:56,343 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-10-15 12:46:56,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-15 12:46:56,343 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:56,344 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:56,344 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:56,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:56,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1230208723, now seen corresponding path program 60 times [2018-10-15 12:46:56,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:58,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:58,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:58,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 12:46:58,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 12:46:58,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 12:46:58,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 12:46:58,475 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 65 states. [2018-10-15 12:47:04,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:04,373 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-10-15 12:47:04,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-15 12:47:04,374 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 132 [2018-10-15 12:47:04,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:04,375 INFO L225 Difference]: With dead ends: 141 [2018-10-15 12:47:04,375 INFO L226 Difference]: Without dead ends: 136 [2018-10-15 12:47:04,375 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=137, Invalid=4285, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:47:04,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-10-15 12:47:04,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2018-10-15 12:47:04,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-15 12:47:04,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-10-15 12:47:04,378 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2018-10-15 12:47:04,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:04,378 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-10-15 12:47:04,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 12:47:04,379 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-10-15 12:47:04,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-15 12:47:04,379 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:04,379 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:04,380 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:04,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:04,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1172110094, now seen corresponding path program 61 times [2018-10-15 12:47:04,380 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:06,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:06,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:06,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-15 12:47:06,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-15 12:47:06,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-15 12:47:06,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-10-15 12:47:06,866 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 66 states. [2018-10-15 12:47:12,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:12,961 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-10-15 12:47:12,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 12:47:12,962 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 134 [2018-10-15 12:47:12,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:12,963 INFO L225 Difference]: With dead ends: 143 [2018-10-15 12:47:12,963 INFO L226 Difference]: Without dead ends: 138 [2018-10-15 12:47:12,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=139, Invalid=4417, Unknown=0, NotChecked=0, Total=4556 [2018-10-15 12:47:12,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-15 12:47:12,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-10-15 12:47:12,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-15 12:47:12,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-10-15 12:47:12,966 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2018-10-15 12:47:12,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:12,967 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-10-15 12:47:12,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-15 12:47:12,967 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-10-15 12:47:12,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-15 12:47:12,967 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:12,967 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:12,968 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:12,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:12,968 INFO L82 PathProgramCache]: Analyzing trace with hash 891912017, now seen corresponding path program 62 times [2018-10-15 12:47:12,968 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:13,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:15,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:15,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:15,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 12:47:15,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 12:47:15,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 12:47:15,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:47:15,655 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 67 states. [2018-10-15 12:47:21,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:21,978 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-10-15 12:47:21,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-15 12:47:21,979 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 136 [2018-10-15 12:47:21,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:21,980 INFO L225 Difference]: With dead ends: 145 [2018-10-15 12:47:21,980 INFO L226 Difference]: Without dead ends: 140 [2018-10-15 12:47:21,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=141, Invalid=4551, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 12:47:21,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-10-15 12:47:21,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2018-10-15 12:47:21,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-15 12:47:21,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-10-15 12:47:21,983 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2018-10-15 12:47:21,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:21,983 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-10-15 12:47:21,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 12:47:21,983 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-10-15 12:47:21,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-15 12:47:21,984 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:21,984 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:21,984 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:21,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:21,984 INFO L82 PathProgramCache]: Analyzing trace with hash 142269936, now seen corresponding path program 63 times [2018-10-15 12:47:21,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:24,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:24,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:24,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-15 12:47:24,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-15 12:47:24,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-15 12:47:24,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-10-15 12:47:24,566 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 68 states. [2018-10-15 12:47:31,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:31,104 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-10-15 12:47:31,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-15 12:47:31,105 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 138 [2018-10-15 12:47:31,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:31,106 INFO L225 Difference]: With dead ends: 147 [2018-10-15 12:47:31,106 INFO L226 Difference]: Without dead ends: 142 [2018-10-15 12:47:31,107 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=143, Invalid=4687, Unknown=0, NotChecked=0, Total=4830 [2018-10-15 12:47:31,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-15 12:47:31,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2018-10-15 12:47:31,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-15 12:47:31,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-10-15 12:47:31,109 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2018-10-15 12:47:31,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:31,110 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-10-15 12:47:31,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-15 12:47:31,110 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-10-15 12:47:31,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-15 12:47:31,111 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:31,111 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:31,111 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:31,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:31,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1290735823, now seen corresponding path program 64 times [2018-10-15 12:47:31,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:33,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:33,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:33,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 12:47:33,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 12:47:33,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 12:47:33,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 12:47:33,573 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 69 states. [2018-10-15 12:47:40,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:40,210 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-10-15 12:47:40,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 12:47:40,210 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 140 [2018-10-15 12:47:40,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:40,212 INFO L225 Difference]: With dead ends: 149 [2018-10-15 12:47:40,212 INFO L226 Difference]: Without dead ends: 144 [2018-10-15 12:47:40,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=145, Invalid=4825, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:47:40,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-10-15 12:47:40,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2018-10-15 12:47:40,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-15 12:47:40,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-10-15 12:47:40,215 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2018-10-15 12:47:40,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:40,215 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-10-15 12:47:40,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 12:47:40,215 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-10-15 12:47:40,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-15 12:47:40,216 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:40,216 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:40,216 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:40,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:40,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1159858158, now seen corresponding path program 65 times [2018-10-15 12:47:40,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:42,952 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-15 12:47:42,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:42,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-10-15 12:47:42,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-15 12:47:42,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-15 12:47:42,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-10-15 12:47:42,953 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 70 states. [2018-10-15 12:47:49,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:49,780 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-10-15 12:47:49,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-15 12:47:49,781 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 142 [2018-10-15 12:47:49,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:49,782 INFO L225 Difference]: With dead ends: 151 [2018-10-15 12:47:49,782 INFO L226 Difference]: Without dead ends: 146 [2018-10-15 12:47:49,782 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=147, Invalid=4965, Unknown=0, NotChecked=0, Total=5112 [2018-10-15 12:47:49,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-15 12:47:49,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-10-15 12:47:49,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-15 12:47:49,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-10-15 12:47:49,785 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2018-10-15 12:47:49,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:49,785 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-10-15 12:47:49,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-15 12:47:49,786 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-10-15 12:47:49,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-15 12:47:49,786 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:49,786 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:49,786 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:49,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:49,787 INFO L82 PathProgramCache]: Analyzing trace with hash -59526323, now seen corresponding path program 66 times [2018-10-15 12:47:49,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:52,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:52,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:52,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 12:47:52,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 12:47:52,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 12:47:52,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:47:52,517 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 71 states. [2018-10-15 12:47:59,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:59,679 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-10-15 12:47:59,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-15 12:47:59,680 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 144 [2018-10-15 12:47:59,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:59,681 INFO L225 Difference]: With dead ends: 153 [2018-10-15 12:47:59,681 INFO L226 Difference]: Without dead ends: 148 [2018-10-15 12:47:59,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=149, Invalid=5107, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 12:47:59,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-15 12:47:59,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2018-10-15 12:47:59,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-15 12:47:59,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-10-15 12:47:59,685 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2018-10-15 12:47:59,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:59,686 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-10-15 12:47:59,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 12:47:59,686 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-10-15 12:47:59,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-15 12:47:59,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:59,687 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:59,687 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:59,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:59,687 INFO L82 PathProgramCache]: Analyzing trace with hash 638059244, now seen corresponding path program 67 times [2018-10-15 12:47:59,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:02,713 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:02,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:02,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-15 12:48:02,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-15 12:48:02,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-15 12:48:02,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-10-15 12:48:02,715 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 72 states. [2018-10-15 12:48:09,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:09,992 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-10-15 12:48:09,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 12:48:09,993 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 146 [2018-10-15 12:48:09,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:09,994 INFO L225 Difference]: With dead ends: 155 [2018-10-15 12:48:09,994 INFO L226 Difference]: Without dead ends: 150 [2018-10-15 12:48:09,995 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=151, Invalid=5251, Unknown=0, NotChecked=0, Total=5402 [2018-10-15 12:48:09,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-15 12:48:09,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-10-15 12:48:09,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-15 12:48:09,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-10-15 12:48:09,998 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 146 [2018-10-15 12:48:09,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:09,998 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-10-15 12:48:09,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-15 12:48:09,998 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-10-15 12:48:09,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-15 12:48:09,999 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:09,999 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:09,999 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:10,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:10,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1002890955, now seen corresponding path program 68 times [2018-10-15 12:48:10,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:10,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:12,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:12,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:12,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 12:48:12,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 12:48:12,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 12:48:12,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 12:48:12,915 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 73 states. [2018-10-15 12:48:20,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:20,453 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-10-15 12:48:20,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-15 12:48:20,454 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 148 [2018-10-15 12:48:20,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:20,455 INFO L225 Difference]: With dead ends: 157 [2018-10-15 12:48:20,455 INFO L226 Difference]: Without dead ends: 152 [2018-10-15 12:48:20,456 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=153, Invalid=5397, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:48:20,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-10-15 12:48:20,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2018-10-15 12:48:20,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-15 12:48:20,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-10-15 12:48:20,458 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 148 [2018-10-15 12:48:20,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:20,459 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-10-15 12:48:20,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 12:48:20,459 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-10-15 12:48:20,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-15 12:48:20,460 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:20,460 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:20,460 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:20,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:20,460 INFO L82 PathProgramCache]: Analyzing trace with hash -581153046, now seen corresponding path program 69 times [2018-10-15 12:48:20,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:23,486 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:23,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:23,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-10-15 12:48:23,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-15 12:48:23,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-15 12:48:23,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-10-15 12:48:23,487 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 74 states. [2018-10-15 12:48:31,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:31,126 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-10-15 12:48:31,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-15 12:48:31,127 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 150 [2018-10-15 12:48:31,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:31,128 INFO L225 Difference]: With dead ends: 159 [2018-10-15 12:48:31,128 INFO L226 Difference]: Without dead ends: 154 [2018-10-15 12:48:31,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=155, Invalid=5545, Unknown=0, NotChecked=0, Total=5700 [2018-10-15 12:48:31,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-15 12:48:31,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-10-15 12:48:31,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-10-15 12:48:31,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-10-15 12:48:31,131 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 150 [2018-10-15 12:48:31,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:31,131 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-10-15 12:48:31,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-15 12:48:31,131 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-10-15 12:48:31,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-15 12:48:31,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:31,132 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:31,132 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:31,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:31,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1865952073, now seen corresponding path program 70 times [2018-10-15 12:48:31,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:34,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:34,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:34,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 12:48:34,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 12:48:34,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 12:48:34,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:48:34,347 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 75 states. [2018-10-15 12:48:42,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:42,329 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-10-15 12:48:42,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 12:48:42,329 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 152 [2018-10-15 12:48:42,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:42,330 INFO L225 Difference]: With dead ends: 161 [2018-10-15 12:48:42,330 INFO L226 Difference]: Without dead ends: 156 [2018-10-15 12:48:42,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=157, Invalid=5695, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 12:48:42,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-10-15 12:48:42,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2018-10-15 12:48:42,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-15 12:48:42,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-10-15 12:48:42,333 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 152 [2018-10-15 12:48:42,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:42,333 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-10-15 12:48:42,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 12:48:42,333 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-10-15 12:48:42,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-15 12:48:42,334 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:42,334 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:42,334 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:42,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:42,334 INFO L82 PathProgramCache]: Analyzing trace with hash -108106776, now seen corresponding path program 71 times [2018-10-15 12:48:42,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:42,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:45,482 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:45,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:45,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-10-15 12:48:45,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-15 12:48:45,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-15 12:48:45,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-10-15 12:48:45,483 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 76 states. [2018-10-15 12:48:53,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:53,692 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-10-15 12:48:53,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-15 12:48:53,693 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 154 [2018-10-15 12:48:53,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:53,694 INFO L225 Difference]: With dead ends: 163 [2018-10-15 12:48:53,694 INFO L226 Difference]: Without dead ends: 158 [2018-10-15 12:48:53,694 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=159, Invalid=5847, Unknown=0, NotChecked=0, Total=6006 [2018-10-15 12:48:53,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-15 12:48:53,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2018-10-15 12:48:53,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-15 12:48:53,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-10-15 12:48:53,697 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 154 [2018-10-15 12:48:53,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:53,697 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-10-15 12:48:53,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-15 12:48:53,698 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-10-15 12:48:53,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-15 12:48:53,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:53,698 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:53,698 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:53,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:53,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1196884167, now seen corresponding path program 72 times [2018-10-15 12:48:53,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:56,632 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:56,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:56,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 12:48:56,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 12:48:56,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 12:48:56,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 12:48:56,633 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 77 states. [2018-10-15 12:49:05,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:05,070 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-10-15 12:49:05,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-15 12:49:05,070 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 156 [2018-10-15 12:49:05,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:05,071 INFO L225 Difference]: With dead ends: 165 [2018-10-15 12:49:05,071 INFO L226 Difference]: Without dead ends: 160 [2018-10-15 12:49:05,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=161, Invalid=6001, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:49:05,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-15 12:49:05,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2018-10-15 12:49:05,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-10-15 12:49:05,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-10-15 12:49:05,074 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 156 [2018-10-15 12:49:05,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:05,075 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-10-15 12:49:05,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 12:49:05,075 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-10-15 12:49:05,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-15 12:49:05,076 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:05,076 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:05,076 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:05,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:05,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1162729958, now seen corresponding path program 73 times [2018-10-15 12:49:05,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:08,214 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:08,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:08,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-15 12:49:08,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-15 12:49:08,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-15 12:49:08,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-10-15 12:49:08,216 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 78 states. [2018-10-15 12:49:16,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:16,762 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-10-15 12:49:16,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 12:49:16,763 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 158 [2018-10-15 12:49:16,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:16,764 INFO L225 Difference]: With dead ends: 167 [2018-10-15 12:49:16,764 INFO L226 Difference]: Without dead ends: 162 [2018-10-15 12:49:16,764 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=163, Invalid=6157, Unknown=0, NotChecked=0, Total=6320 [2018-10-15 12:49:16,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-15 12:49:16,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-10-15 12:49:16,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-15 12:49:16,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-10-15 12:49:16,768 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 158 [2018-10-15 12:49:16,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:16,768 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-10-15 12:49:16,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-15 12:49:16,768 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-10-15 12:49:16,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-15 12:49:16,769 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:16,769 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:16,770 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:16,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:16,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1594693819, now seen corresponding path program 74 times [2018-10-15 12:49:16,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:16,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:20,085 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:20,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:20,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 12:49:20,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 12:49:20,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 12:49:20,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:49:20,087 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 79 states. [2018-10-15 12:49:28,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:28,933 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-10-15 12:49:28,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-15 12:49:28,933 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 160 [2018-10-15 12:49:28,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:28,934 INFO L225 Difference]: With dead ends: 169 [2018-10-15 12:49:28,935 INFO L226 Difference]: Without dead ends: 164 [2018-10-15 12:49:28,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=165, Invalid=6315, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 12:49:28,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-10-15 12:49:28,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2018-10-15 12:49:28,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-15 12:49:28,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-10-15 12:49:28,938 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 160 [2018-10-15 12:49:28,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:28,938 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-10-15 12:49:28,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 12:49:28,939 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-10-15 12:49:28,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-15 12:49:28,939 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:28,939 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:28,940 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:28,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:28,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1484121884, now seen corresponding path program 75 times [2018-10-15 12:49:28,941 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:29,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:32,060 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:32,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:32,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-10-15 12:49:32,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-15 12:49:32,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-15 12:49:32,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-10-15 12:49:32,061 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 80 states. [2018-10-15 12:49:41,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:41,126 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-10-15 12:49:41,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-15 12:49:41,126 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 162 [2018-10-15 12:49:41,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:41,127 INFO L225 Difference]: With dead ends: 171 [2018-10-15 12:49:41,127 INFO L226 Difference]: Without dead ends: 166 [2018-10-15 12:49:41,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=167, Invalid=6475, Unknown=0, NotChecked=0, Total=6642 [2018-10-15 12:49:41,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-15 12:49:41,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2018-10-15 12:49:41,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-15 12:49:41,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-10-15 12:49:41,130 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 162 [2018-10-15 12:49:41,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:41,130 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-10-15 12:49:41,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-15 12:49:41,130 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-10-15 12:49:41,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-15 12:49:41,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:41,131 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:41,131 INFO L424 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:41,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:41,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1696292547, now seen corresponding path program 76 times [2018-10-15 12:49:41,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:41,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:44,617 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:44,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:44,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 12:49:44,618 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 12:49:44,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 12:49:44,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 12:49:44,619 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 81 states. [2018-10-15 12:49:53,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:53,976 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-10-15 12:49:53,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 12:49:53,977 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 164 [2018-10-15 12:49:53,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:53,977 INFO L225 Difference]: With dead ends: 173 [2018-10-15 12:49:53,977 INFO L226 Difference]: Without dead ends: 168 [2018-10-15 12:49:53,978 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=169, Invalid=6637, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:49:53,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-10-15 12:49:53,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2018-10-15 12:49:53,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-15 12:49:53,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-10-15 12:49:53,979 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 164 [2018-10-15 12:49:53,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:53,980 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-10-15 12:49:53,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 12:49:53,980 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-10-15 12:49:53,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-15 12:49:53,980 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:53,980 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:53,981 INFO L424 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:53,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:53,981 INFO L82 PathProgramCache]: Analyzing trace with hash 57845986, now seen corresponding path program 77 times [2018-10-15 12:49:53,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:57,274 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:57,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:57,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-10-15 12:49:57,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-15 12:49:57,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-15 12:49:57,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-10-15 12:49:57,275 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 82 states. [2018-10-15 12:50:06,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:06,817 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-10-15 12:50:06,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-15 12:50:06,817 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 166 [2018-10-15 12:50:06,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:06,819 INFO L225 Difference]: With dead ends: 175 [2018-10-15 12:50:06,819 INFO L226 Difference]: Without dead ends: 170 [2018-10-15 12:50:06,819 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=171, Invalid=6801, Unknown=0, NotChecked=0, Total=6972 [2018-10-15 12:50:06,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-15 12:50:06,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2018-10-15 12:50:06,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-10-15 12:50:06,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-10-15 12:50:06,822 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 166 [2018-10-15 12:50:06,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:06,822 INFO L481 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-10-15 12:50:06,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-15 12:50:06,822 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-10-15 12:50:06,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-15 12:50:06,823 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:06,823 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:50:06,823 INFO L424 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:06,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:06,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1763698497, now seen corresponding path program 78 times [2018-10-15 12:50:06,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:10,445 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:50:10,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:10,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 12:50:10,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 12:50:10,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 12:50:10,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:50:10,446 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 83 states. [2018-10-15 12:50:20,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:20,175 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-10-15 12:50:20,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-15 12:50:20,176 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 168 [2018-10-15 12:50:20,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:20,177 INFO L225 Difference]: With dead ends: 177 [2018-10-15 12:50:20,177 INFO L226 Difference]: Without dead ends: 172 [2018-10-15 12:50:20,177 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=173, Invalid=6967, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 12:50:20,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-10-15 12:50:20,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2018-10-15 12:50:20,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-15 12:50:20,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-10-15 12:50:20,180 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 168 [2018-10-15 12:50:20,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:20,180 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-10-15 12:50:20,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 12:50:20,181 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-10-15 12:50:20,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-15 12:50:20,181 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:20,181 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:50:20,181 INFO L424 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:20,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:20,182 INFO L82 PathProgramCache]: Analyzing trace with hash 410454496, now seen corresponding path program 79 times [2018-10-15 12:50:20,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:23,670 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:50:23,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:23,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-10-15 12:50:23,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-15 12:50:23,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-15 12:50:23,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-10-15 12:50:23,672 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 84 states. [2018-10-15 12:50:33,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:33,695 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-10-15 12:50:33,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 12:50:33,695 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 170 [2018-10-15 12:50:33,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:33,697 INFO L225 Difference]: With dead ends: 179 [2018-10-15 12:50:33,697 INFO L226 Difference]: Without dead ends: 174 [2018-10-15 12:50:33,697 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=175, Invalid=7135, Unknown=0, NotChecked=0, Total=7310 [2018-10-15 12:50:33,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-15 12:50:33,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-10-15 12:50:33,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-15 12:50:33,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-10-15 12:50:33,699 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 170 [2018-10-15 12:50:33,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:33,700 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-10-15 12:50:33,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-15 12:50:33,700 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-10-15 12:50:33,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-15 12:50:33,700 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:33,700 INFO L375 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:50:33,701 INFO L424 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:33,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:33,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1318060223, now seen corresponding path program 80 times [2018-10-15 12:50:33,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:37,434 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:50:37,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:37,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 12:50:37,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 12:50:37,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 12:50:37,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 12:50:37,436 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 85 states. [2018-10-15 12:50:47,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:47,653 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-10-15 12:50:47,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-15 12:50:47,653 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 172 [2018-10-15 12:50:47,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:47,655 INFO L225 Difference]: With dead ends: 181 [2018-10-15 12:50:47,655 INFO L226 Difference]: Without dead ends: 176 [2018-10-15 12:50:47,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=177, Invalid=7305, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:50:47,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-10-15 12:50:47,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2018-10-15 12:50:47,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-15 12:50:47,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-10-15 12:50:47,658 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 172 [2018-10-15 12:50:47,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:47,659 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-10-15 12:50:47,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 12:50:47,659 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-10-15 12:50:47,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-15 12:50:47,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:47,660 INFO L375 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:50:47,660 INFO L424 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:47,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:47,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1648802782, now seen corresponding path program 81 times [2018-10-15 12:50:47,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:51,515 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:50:51,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:51,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-10-15 12:50:51,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-15 12:50:51,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-15 12:50:51,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-10-15 12:50:51,516 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 86 states. [2018-10-15 12:51:01,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:51:01,999 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-10-15 12:51:02,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-15 12:51:02,000 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 174 [2018-10-15 12:51:02,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:51:02,001 INFO L225 Difference]: With dead ends: 183 [2018-10-15 12:51:02,001 INFO L226 Difference]: Without dead ends: 178 [2018-10-15 12:51:02,002 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=179, Invalid=7477, Unknown=0, NotChecked=0, Total=7656 [2018-10-15 12:51:02,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-10-15 12:51:02,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-10-15 12:51:02,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-15 12:51:02,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-10-15 12:51:02,005 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 174 [2018-10-15 12:51:02,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:51:02,005 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-10-15 12:51:02,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-15 12:51:02,005 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-10-15 12:51:02,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-15 12:51:02,006 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:51:02,006 INFO L375 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:51:02,006 INFO L424 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:51:02,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:51:02,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1664822077, now seen corresponding path program 82 times [2018-10-15 12:51:02,007 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:51:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:51:06,075 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:51:06,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:51:06,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 12:51:06,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 12:51:06,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 12:51:06,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:51:06,076 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 87 states. [2018-10-15 12:51:16,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:51:16,844 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-10-15 12:51:16,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 12:51:16,844 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 176 [2018-10-15 12:51:16,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:51:16,846 INFO L225 Difference]: With dead ends: 185 [2018-10-15 12:51:16,846 INFO L226 Difference]: Without dead ends: 180 [2018-10-15 12:51:16,846 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=181, Invalid=7651, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 12:51:16,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-10-15 12:51:16,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2018-10-15 12:51:16,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-15 12:51:16,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-10-15 12:51:16,849 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 176 [2018-10-15 12:51:16,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:51:16,849 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-10-15 12:51:16,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 12:51:16,849 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-10-15 12:51:16,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-15 12:51:16,850 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:51:16,850 INFO L375 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:51:16,851 INFO L424 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:51:16,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:51:16,851 INFO L82 PathProgramCache]: Analyzing trace with hash -120504612, now seen corresponding path program 83 times [2018-10-15 12:51:16,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:51:16,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:51:20,676 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:51:20,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:51:20,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-10-15 12:51:20,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-15 12:51:20,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-15 12:51:20,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-10-15 12:51:20,678 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 88 states. [2018-10-15 12:51:31,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:51:31,793 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-10-15 12:51:31,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-15 12:51:31,794 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 178 [2018-10-15 12:51:31,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:51:31,795 INFO L225 Difference]: With dead ends: 187 [2018-10-15 12:51:31,795 INFO L226 Difference]: Without dead ends: 182 [2018-10-15 12:51:31,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=183, Invalid=7827, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 12:51:31,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-15 12:51:31,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2018-10-15 12:51:31,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-15 12:51:31,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-10-15 12:51:31,798 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 178 [2018-10-15 12:51:31,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:51:31,799 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-10-15 12:51:31,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-15 12:51:31,799 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-10-15 12:51:31,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-15 12:51:31,799 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:51:31,799 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:51:31,800 INFO L424 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:51:31,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:51:31,800 INFO L82 PathProgramCache]: Analyzing trace with hash -2127501637, now seen corresponding path program 84 times [2018-10-15 12:51:31,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:51:31,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:51:35,680 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:51:35,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:51:35,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 12:51:35,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 12:51:35,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 12:51:35,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 12:51:35,681 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 89 states. [2018-10-15 12:51:46,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:51:46,911 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-10-15 12:51:46,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-15 12:51:46,912 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 180 [2018-10-15 12:51:46,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:51:46,913 INFO L225 Difference]: With dead ends: 189 [2018-10-15 12:51:46,913 INFO L226 Difference]: Without dead ends: 184 [2018-10-15 12:51:46,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=185, Invalid=8005, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:51:46,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-15 12:51:46,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2018-10-15 12:51:46,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-15 12:51:46,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-10-15 12:51:46,917 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 180 [2018-10-15 12:51:46,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:51:46,917 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-10-15 12:51:46,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 12:51:46,917 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-10-15 12:51:46,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-15 12:51:46,918 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:51:46,918 INFO L375 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:51:46,919 INFO L424 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:51:46,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:51:46,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1883640538, now seen corresponding path program 85 times [2018-10-15 12:51:46,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:51:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:51:50,860 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:51:50,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:51:50,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-10-15 12:51:50,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-15 12:51:50,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-15 12:51:50,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 12:51:50,862 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 90 states. [2018-10-15 12:52:02,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:52:02,133 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-10-15 12:52:02,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 12:52:02,134 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 182 [2018-10-15 12:52:02,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:52:02,135 INFO L225 Difference]: With dead ends: 191 [2018-10-15 12:52:02,135 INFO L226 Difference]: Without dead ends: 186 [2018-10-15 12:52:02,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=187, Invalid=8185, Unknown=0, NotChecked=0, Total=8372 [2018-10-15 12:52:02,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-10-15 12:52:02,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-10-15 12:52:02,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-15 12:52:02,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-10-15 12:52:02,139 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 182 [2018-10-15 12:52:02,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:52:02,139 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-10-15 12:52:02,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-15 12:52:02,139 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-10-15 12:52:02,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-15 12:52:02,140 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:52:02,140 INFO L375 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:52:02,140 INFO L424 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:52:02,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:52:02,140 INFO L82 PathProgramCache]: Analyzing trace with hash -289361095, now seen corresponding path program 86 times [2018-10-15 12:52:02,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:52:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat