java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/hhk2008.c.i_3.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:49:04,174 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:49:04,176 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:49:04,187 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:49:04,188 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:49:04,189 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:49:04,190 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:49:04,192 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:49:04,194 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:49:04,195 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:49:04,196 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:49:04,197 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:49:04,197 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:49:04,198 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:49:04,199 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:49:04,200 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:49:04,205 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:49:04,206 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:49:04,211 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:49:04,216 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:49:04,218 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:49:04,223 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:49:04,225 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:49:04,228 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:49:04,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:49:04,233 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:49:04,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:49:04,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:49:04,234 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:49:04,237 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:49:04,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:49:04,239 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:49:04,240 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:49:04,241 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:49:04,243 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:49:04,243 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:49:04,244 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:49:04,244 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:49:04,245 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:49:04,247 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:49:04,247 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:49:04,301 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:49:04,316 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:49:04,320 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:49:04,321 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:49:04,322 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:49:04,323 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/hhk2008.c.i_3.bplTransformedIcfg_BEv2_3.bpl [2019-08-05 10:49:04,323 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/hhk2008.c.i_3.bplTransformedIcfg_BEv2_3.bpl' [2019-08-05 10:49:04,358 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:49:04,359 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:49:04,360 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:49:04,360 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:49:04,360 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:49:04,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "hhk2008.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:04" (1/1) ... [2019-08-05 10:49:04,385 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "hhk2008.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:04" (1/1) ... [2019-08-05 10:49:04,394 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:49:04,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:49:04,395 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:49:04,395 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:49:04,406 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "hhk2008.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:04" (1/1) ... [2019-08-05 10:49:04,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "hhk2008.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:04" (1/1) ... [2019-08-05 10:49:04,407 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "hhk2008.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:04" (1/1) ... [2019-08-05 10:49:04,407 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "hhk2008.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:04" (1/1) ... [2019-08-05 10:49:04,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "hhk2008.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:04" (1/1) ... [2019-08-05 10:49:04,415 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "hhk2008.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:04" (1/1) ... [2019-08-05 10:49:04,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "hhk2008.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:04" (1/1) ... [2019-08-05 10:49:04,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:49:04,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:49:04,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:49:04,421 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:49:04,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "hhk2008.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:49:04,488 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:49:04,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:49:04,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:49:04,733 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:49:04,733 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:49:04,734 INFO L202 PluginConnector]: Adding new model hhk2008.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:49:04 BoogieIcfgContainer [2019-08-05 10:49:04,734 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:49:04,736 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:49:04,736 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:49:04,739 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:49:04,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "hhk2008.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:04" (1/2) ... [2019-08-05 10:49:04,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67e7a209 and model type hhk2008.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:49:04, skipping insertion in model container [2019-08-05 10:49:04,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "hhk2008.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:49:04" (2/2) ... [2019-08-05 10:49:04,743 INFO L109 eAbstractionObserver]: Analyzing ICFG hhk2008.c.i_3.bplTransformedIcfg_BEv2_3.bpl [2019-08-05 10:49:04,753 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:49:04,761 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:49:04,778 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:49:04,807 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:49:04,807 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:49:04,808 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:49:04,808 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:49:04,808 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:49:04,808 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:49:04,808 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:49:04,809 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:49:04,809 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:49:04,823 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:49:04,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:49:04,831 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:04,832 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:49:04,834 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:04,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:04,841 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 10:49:04,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:04,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:04,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:49:04,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:05,063 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 10:49:05,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:05,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:49:05,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:49:05,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:49:05,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:49:05,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:49:05,156 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:49:05,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:05,201 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:49:05,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:49:05,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:49:05,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:05,213 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:49:05,213 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:49:05,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:49:05,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:49:05,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:49:05,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:49:05,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:49:05,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:49:05,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:05,250 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:49:05,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:49:05,251 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:49:05,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:49:05,251 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:05,252 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:49:05,252 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:05,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:05,253 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-05 10:49:05,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:05,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:49:05,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:05,542 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:49:05,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:05,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:05,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:49:05,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:49:05,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:49:05,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:49:05,551 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:49:05,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:05,660 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:49:05,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:49:05,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:49:05,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:05,661 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:49:05,661 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:49:05,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:49:05,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:49:05,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:49:05,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:49:05,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:49:05,665 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:49:05,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:05,665 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:49:05,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:49:05,666 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:49:05,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:49:05,666 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:05,666 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:49:05,667 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:05,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:05,667 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-05 10:49:05,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:05,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:49:05,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:05,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:05,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:05,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:49:05,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:49:05,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:49:05,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:49:05,829 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:49:05,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:05,889 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:49:05,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:49:05,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:49:05,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:05,892 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:49:05,892 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:49:05,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:49:05,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:49:05,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:49:05,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:49:05,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:49:05,898 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:49:05,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:05,898 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:49:05,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:49:05,899 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:49:05,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:49:05,899 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:05,899 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:49:05,900 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:05,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:05,901 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-05 10:49:05,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:05,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:49:05,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:06,113 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:06,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:06,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:49:06,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:49:06,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:49:06,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:49:06,115 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:49:06,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:06,299 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:49:06,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:49:06,300 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:49:06,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:06,301 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:49:06,301 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:49:06,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:49:06,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:49:06,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:49:06,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:49:06,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:49:06,304 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:49:06,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:06,304 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:49:06,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:49:06,304 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:49:06,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:49:06,305 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:06,305 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:49:06,305 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:06,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:06,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-05 10:49:06,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:06,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:49:06,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:06,529 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:06,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:06,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:49:06,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:49:06,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:49:06,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:49:06,531 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:49:06,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:06,708 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:49:06,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:49:06,708 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:49:06,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:06,709 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:49:06,709 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:49:06,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:49:06,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:49:06,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:49:06,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:49:06,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:49:06,712 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:49:06,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:06,713 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:49:06,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:49:06,713 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:49:06,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:49:06,714 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:06,714 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:49:06,714 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:06,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:06,715 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-05 10:49:06,716 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:06,737 WARN L254 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:49:06,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:06,878 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:06,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:06,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:49:06,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:49:06,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:49:06,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:49:06,880 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:49:06,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:06,984 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:49:06,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:49:06,988 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:49:06,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:06,989 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:49:06,989 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:49:06,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:49:06,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:49:06,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:49:06,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:49:06,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:49:06,992 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:49:06,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:06,993 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:49:06,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:49:06,993 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:49:06,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:49:06,993 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:06,994 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:49:06,994 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:06,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:06,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-05 10:49:06,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:07,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:07,023 WARN L254 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:49:07,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:07,457 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:07,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:07,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:49:07,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:49:07,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:49:07,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:49:07,459 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:49:07,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:07,578 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:49:07,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:49:07,579 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:49:07,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:07,580 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:49:07,580 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:49:07,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:49:07,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:49:07,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:49:07,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:49:07,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:49:07,583 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:49:07,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:07,583 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:49:07,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:49:07,584 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:49:07,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:49:07,584 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:07,584 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:49:07,585 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:07,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:07,585 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-05 10:49:07,586 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:07,605 WARN L254 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:49:07,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:07,789 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:07,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:07,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:49:07,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:49:07,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:49:07,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:49:07,791 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:49:07,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:07,894 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:49:07,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:49:07,895 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:49:07,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:07,896 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:49:07,896 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:49:07,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:49:07,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:49:07,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:49:07,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:49:07,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:49:07,901 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:49:07,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:07,901 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:49:07,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:49:07,901 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:49:07,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:49:07,902 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:07,902 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:49:07,903 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:07,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:07,903 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-05 10:49:07,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:07,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:07,924 WARN L254 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:49:07,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:08,112 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:08,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:08,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:49:08,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:49:08,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:49:08,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:49:08,114 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:49:08,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:08,284 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:49:08,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:49:08,285 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:49:08,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:08,286 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:49:08,286 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:49:08,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:49:08,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:49:08,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:49:08,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:49:08,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:49:08,290 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:49:08,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:08,290 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:49:08,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:49:08,291 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:49:08,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:49:08,291 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:08,291 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:49:08,292 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:08,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:08,292 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-05 10:49:08,293 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:08,312 WARN L254 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:49:08,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:08,523 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:08,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:08,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:49:08,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:49:08,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:49:08,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:49:08,525 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:49:08,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:08,642 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:49:08,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:49:08,643 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:49:08,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:08,644 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:49:08,644 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:49:08,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:49:08,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:49:08,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:49:08,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:49:08,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:49:08,648 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:49:08,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:08,648 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:49:08,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:49:08,648 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:49:08,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:49:08,649 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:08,649 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:49:08,649 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:08,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:08,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-08-05 10:49:08,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:08,671 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:49:08,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:08,993 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:08,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:08,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:49:08,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:49:08,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:49:08,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:49:08,995 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:49:09,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:09,116 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:49:09,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:49:09,121 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:49:09,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:09,122 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:49:09,122 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:49:09,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:49:09,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:49:09,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:49:09,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:49:09,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:49:09,126 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:49:09,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:09,126 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:49:09,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:49:09,126 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:49:09,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:49:09,126 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:09,127 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:49:09,127 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:09,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:09,127 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-08-05 10:49:09,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:09,146 WARN L254 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:49:09,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:09,388 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:09,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:09,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:49:09,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:49:09,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:49:09,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:49:09,390 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:49:09,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:09,575 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:49:09,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:49:09,576 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:49:09,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:09,576 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:49:09,576 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:49:09,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:49:09,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:49:09,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:49:09,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:49:09,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:49:09,579 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:49:09,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:09,580 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:49:09,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:49:09,580 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:49:09,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:49:09,581 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:09,581 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:49:09,581 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:09,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:09,582 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-08-05 10:49:09,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:09,600 WARN L254 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:49:09,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:09,952 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:09,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:09,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:49:09,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:49:09,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:49:09,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:49:09,954 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:49:10,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:10,145 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:49:10,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:49:10,151 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:49:10,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:10,152 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:49:10,152 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:49:10,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:49:10,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:49:10,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:49:10,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:49:10,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:49:10,155 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:49:10,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:10,156 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:49:10,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:49:10,156 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:49:10,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:49:10,157 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:10,157 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:49:10,157 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:10,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:10,158 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-08-05 10:49:10,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:10,176 WARN L254 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:49:10,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:10,475 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:10,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:10,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:49:10,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:49:10,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:49:10,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:49:10,476 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:49:10,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:10,763 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:49:10,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:49:10,763 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:49:10,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:10,764 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:49:10,764 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:49:10,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:49:10,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:49:10,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:49:10,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:49:10,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:49:10,768 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:49:10,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:10,768 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:49:10,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:49:10,769 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:49:10,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:49:10,769 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:10,769 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:49:10,770 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:10,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:10,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-08-05 10:49:10,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:10,787 WARN L254 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:49:10,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:11,454 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:11,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:11,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:49:11,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:49:11,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:49:11,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:49:11,456 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:49:11,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:11,950 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:49:11,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:49:11,951 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:49:11,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:11,952 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:49:11,952 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:49:11,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:49:11,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:49:11,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:49:11,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:49:11,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:49:11,957 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:49:11,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:11,957 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:49:11,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:49:11,957 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:49:11,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:49:11,957 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:11,958 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:49:11,958 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:11,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:11,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-08-05 10:49:11,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:11,986 WARN L254 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:49:11,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:12,545 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:12,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:12,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:49:12,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:49:12,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:49:12,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:49:12,547 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:49:12,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:12,778 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:49:12,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:49:12,779 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:49:12,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:12,780 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:49:12,780 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:49:12,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:49:12,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:49:12,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:49:12,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:49:12,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:49:12,785 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:49:12,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:12,786 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:49:12,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:49:12,786 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:49:12,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:49:12,787 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:12,787 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:49:12,787 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:12,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:12,788 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-08-05 10:49:12,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:12,801 WARN L254 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:49:12,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:13,150 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:13,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:13,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:49:13,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:49:13,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:49:13,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:49:13,152 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:49:13,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:13,414 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:49:13,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:49:13,415 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:49:13,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:13,416 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:49:13,416 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:49:13,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:49:13,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:49:13,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:49:13,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:49:13,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:49:13,419 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:49:13,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:13,420 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:49:13,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:49:13,420 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:49:13,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:49:13,421 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:13,421 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:49:13,421 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:13,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:13,421 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-08-05 10:49:13,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:13,435 WARN L254 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:49:13,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:13,772 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:13,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:13,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:49:13,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:49:13,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:49:13,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:49:13,773 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:49:14,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:14,090 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:49:14,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:49:14,091 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:49:14,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:14,092 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:49:14,092 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:49:14,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:49:14,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:49:14,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:49:14,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:49:14,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:49:14,096 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:49:14,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:14,097 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:49:14,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:49:14,097 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:49:14,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:49:14,097 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:14,098 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:49:14,098 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:14,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:14,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-08-05 10:49:14,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:14,112 WARN L254 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:49:14,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:14,621 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:14,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:14,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:49:14,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:49:14,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:49:14,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:49:14,623 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:49:14,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:14,994 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:49:14,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:49:14,995 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:49:14,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:14,996 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:49:14,996 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:49:14,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:49:14,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:49:15,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:49:15,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:49:15,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:49:15,011 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:49:15,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:15,011 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:49:15,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:49:15,012 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:49:15,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:49:15,012 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:15,013 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:49:15,013 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:15,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:15,013 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-08-05 10:49:15,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:15,027 WARN L254 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:49:15,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:15,393 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:15,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:15,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:49:15,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:49:15,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:49:15,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:49:15,395 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:49:15,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:15,770 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:49:15,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:49:15,771 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:49:15,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:15,772 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:49:15,772 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:49:15,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:49:15,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:49:15,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:49:15,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:49:15,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:49:15,776 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:49:15,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:15,777 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:49:15,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:49:15,777 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:49:15,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:49:15,777 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:15,778 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:49:15,778 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:15,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:15,778 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-08-05 10:49:15,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:15,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:15,793 WARN L254 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:49:15,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:16,181 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:16,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:16,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:49:16,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:49:16,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:49:16,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:49:16,183 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:49:16,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:16,893 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:49:16,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:49:16,894 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:49:16,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:16,895 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:49:16,895 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:49:16,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:49:16,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:49:16,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:49:16,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:49:16,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:49:16,899 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:49:16,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:16,899 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:49:16,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:49:16,899 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:49:16,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:49:16,900 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:16,900 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:49:16,900 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:16,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:16,901 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-08-05 10:49:16,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:16,917 WARN L254 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:49:16,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:17,475 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:17,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:17,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:49:17,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:49:17,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:49:17,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:49:17,477 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:49:17,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:17,901 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:49:17,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:49:17,904 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:49:17,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:17,905 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:49:17,905 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:49:17,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:49:17,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:49:17,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:49:17,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:49:17,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:49:17,910 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:49:17,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:17,911 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:49:17,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:49:17,911 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:49:17,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:49:17,911 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:17,912 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:49:17,912 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:17,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:17,912 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-08-05 10:49:17,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:17,927 WARN L254 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:49:17,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:18,475 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:18,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:18,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:49:18,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:49:18,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:49:18,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:49:18,476 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:49:19,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:19,389 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:49:19,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:49:19,390 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:49:19,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:19,391 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:49:19,391 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:49:19,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:49:19,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:49:19,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:49:19,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:49:19,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:49:19,395 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:49:19,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:19,395 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:49:19,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:49:19,395 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:49:19,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:49:19,396 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:19,396 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:49:19,396 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:19,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:19,397 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-08-05 10:49:19,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:19,413 WARN L254 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:49:19,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:19,862 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:19,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:19,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:49:19,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:49:19,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:49:19,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:49:19,863 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:49:20,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:20,524 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:49:20,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:49:20,525 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:49:20,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:20,526 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:49:20,526 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:49:20,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:49:20,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:49:20,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:49:20,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:49:20,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:49:20,530 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:49:20,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:20,531 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:49:20,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:49:20,531 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:49:20,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:49:20,532 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:20,532 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:49:20,532 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:20,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:20,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-08-05 10:49:20,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:20,548 WARN L254 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:49:20,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:21,112 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:21,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:21,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:49:21,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:49:21,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:49:21,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:49:21,113 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:49:21,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:21,749 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:49:21,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:49:21,750 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:49:21,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:21,750 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:49:21,750 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:49:21,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:49:21,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:49:21,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:49:21,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:49:21,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:49:21,755 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:49:21,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:21,755 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:49:21,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:49:21,756 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:49:21,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:49:21,756 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:21,756 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:49:21,757 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:21,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:21,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-08-05 10:49:21,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:21,773 WARN L254 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 10:49:21,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:22,574 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:22,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:22,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:49:22,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:49:22,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:49:22,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:49:22,575 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:49:23,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:23,228 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:49:23,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:49:23,229 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:49:23,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:23,230 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:49:23,230 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:49:23,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:49:23,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:49:23,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:49:23,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:49:23,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:49:23,234 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:49:23,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:23,234 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:49:23,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:49:23,235 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:49:23,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:49:23,235 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:23,235 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:49:23,236 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:23,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:23,236 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-08-05 10:49:23,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:23,255 WARN L254 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:49:23,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:25,064 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:25,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:25,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:49:25,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:49:25,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:49:25,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:49:25,065 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:49:25,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:25,691 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:49:25,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:49:25,692 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:49:25,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:25,693 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:49:25,693 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:49:25,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:49:25,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:49:25,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:49:25,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:49:25,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:49:25,697 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:49:25,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:25,697 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:49:25,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:49:25,697 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:49:25,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:49:25,698 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:25,698 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:49:25,698 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:25,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:25,698 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-08-05 10:49:25,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:25,716 WARN L254 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 10:49:25,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:27,043 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:27,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:27,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:49:27,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:49:27,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:49:27,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:49:27,045 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:49:27,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:27,720 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:49:27,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:49:27,720 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:49:27,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:27,721 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:49:27,721 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:49:27,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:49:27,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:49:27,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:49:27,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:49:27,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:49:27,726 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:49:27,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:27,726 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:49:27,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:49:27,726 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:49:27,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:49:27,727 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:27,727 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:49:27,727 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:27,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:27,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-08-05 10:49:27,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:27,744 WARN L254 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 10:49:27,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:28,326 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:28,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:28,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:49:28,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:49:28,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:49:28,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:49:28,327 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:49:29,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:29,037 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:49:29,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:49:29,038 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:49:29,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:29,038 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:49:29,038 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:49:29,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:49:29,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:49:29,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:49:29,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:49:29,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:49:29,043 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:49:29,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:29,044 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:49:29,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:49:29,044 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:49:29,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:49:29,044 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:29,044 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:49:29,045 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:29,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:29,045 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-08-05 10:49:29,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:29,067 WARN L254 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 122 conjunts are in the unsatisfiable core [2019-08-05 10:49:29,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:29,740 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:29,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:29,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:49:29,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:49:29,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:49:29,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:49:29,742 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:49:30,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:30,491 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:49:30,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:49:30,492 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:49:30,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:30,492 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:49:30,493 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:49:30,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:49:30,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:49:30,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:49:30,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:49:30,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:49:30,498 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:49:30,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:30,499 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:49:30,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:49:30,499 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:49:30,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:49:30,499 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:30,500 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:49:30,500 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:30,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:30,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-08-05 10:49:30,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:30,515 WARN L254 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 126 conjunts are in the unsatisfiable core [2019-08-05 10:49:30,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:31,181 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:31,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:31,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:49:31,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:49:31,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:49:31,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:49:31,183 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:49:32,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:32,116 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:49:32,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:49:32,117 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:49:32,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:32,118 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:49:32,118 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:49:32,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:49:32,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:49:32,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:49:32,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:49:32,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:49:32,121 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:49:32,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:32,122 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:49:32,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:49:32,122 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:49:32,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:49:32,122 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:32,122 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:49:32,123 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:32,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:32,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-08-05 10:49:32,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:32,140 WARN L254 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 130 conjunts are in the unsatisfiable core [2019-08-05 10:49:32,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:33,173 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:33,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:33,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:49:33,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:49:33,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:49:33,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:49:33,174 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:49:34,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:34,051 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:49:34,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:49:34,051 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:49:34,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:34,052 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:49:34,052 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:49:34,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:49:34,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:49:34,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:49:34,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:49:34,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:49:34,057 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:49:34,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:34,057 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:49:34,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:49:34,057 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:49:34,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:49:34,057 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:34,058 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:49:34,058 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:34,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:34,058 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-08-05 10:49:34,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:34,076 WARN L254 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 134 conjunts are in the unsatisfiable core [2019-08-05 10:49:34,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:34,787 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:34,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:34,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:49:34,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:49:34,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:49:34,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:49:34,789 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:49:35,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:35,681 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:49:35,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:49:35,681 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:49:35,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:35,682 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:49:35,682 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:49:35,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:49:35,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:49:35,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:49:35,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:49:35,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:49:35,686 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:49:35,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:35,686 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:49:35,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:49:35,687 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:49:35,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:49:35,687 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:35,687 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:49:35,688 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:35,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:35,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-08-05 10:49:35,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:35,706 WARN L254 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 138 conjunts are in the unsatisfiable core [2019-08-05 10:49:35,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:36,680 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:36,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:36,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:49:36,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:49:36,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:49:36,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:49:36,682 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:49:37,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:37,740 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:49:37,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:49:37,741 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:49:37,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:37,742 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:49:37,742 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:49:37,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:49:37,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:49:37,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:49:37,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:49:37,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:49:37,745 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:49:37,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:37,745 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:49:37,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:49:37,746 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:49:37,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:49:37,746 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:37,746 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:49:37,746 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:37,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:37,746 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-08-05 10:49:37,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:37,767 WARN L254 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 142 conjunts are in the unsatisfiable core [2019-08-05 10:49:37,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:38,705 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:38,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:38,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:49:38,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:49:38,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:49:38,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:49:38,707 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:49:39,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:39,722 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:49:39,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:49:39,723 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:49:39,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:39,723 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:49:39,723 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:49:39,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:49:39,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:49:39,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:49:39,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:49:39,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:49:39,727 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:49:39,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:39,727 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:49:39,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:49:39,728 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:49:39,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:49:39,728 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:39,728 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:49:39,729 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:39,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:39,729 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-08-05 10:49:39,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:39,749 WARN L254 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 146 conjunts are in the unsatisfiable core [2019-08-05 10:49:39,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:41,199 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:41,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:41,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:49:41,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:49:41,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:49:41,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:49:41,201 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:49:42,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:42,368 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:49:42,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:49:42,368 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:49:42,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:42,369 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:49:42,369 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:49:42,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:49:42,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:49:42,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:49:42,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:49:42,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:49:42,372 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:49:42,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:42,373 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:49:42,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:49:42,373 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:49:42,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:49:42,373 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:42,373 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:49:42,374 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:42,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:42,374 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-08-05 10:49:42,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:42,390 WARN L254 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 150 conjunts are in the unsatisfiable core [2019-08-05 10:49:42,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:43,255 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:43,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:43,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:49:43,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:49:43,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:49:43,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:49:43,257 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:49:44,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:44,386 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:49:44,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:49:44,388 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:49:44,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:44,389 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:49:44,389 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:49:44,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:49:44,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:49:44,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:49:44,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:49:44,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:49:44,392 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:49:44,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:44,393 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:49:44,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:49:44,393 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:49:44,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:49:44,394 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:44,394 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:49:44,394 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:44,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:44,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-08-05 10:49:44,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:44,416 WARN L254 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 154 conjunts are in the unsatisfiable core [2019-08-05 10:49:44,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:45,385 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:45,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:45,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:49:45,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:49:45,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:49:45,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:49:45,387 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:49:46,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:46,549 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:49:46,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:49:46,550 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:49:46,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:46,551 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:49:46,551 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:49:46,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:49:46,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:49:46,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:49:46,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:49:46,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:49:46,554 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:49:46,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:46,555 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:49:46,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:49:46,555 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:49:46,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:49:46,555 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:46,556 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:49:46,556 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:46,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:46,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-08-05 10:49:46,557 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:46,574 WARN L254 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 158 conjunts are in the unsatisfiable core [2019-08-05 10:49:46,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:47,829 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:47,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:47,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:49:47,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:49:47,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:49:47,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:49:47,831 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:49:49,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:49,065 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:49:49,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:49:49,065 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:49:49,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:49,066 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:49:49,066 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:49:49,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:49:49,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:49:49,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:49:49,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:49:49,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:49:49,070 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:49:49,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:49,070 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:49:49,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:49:49,071 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:49:49,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:49:49,071 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:49,071 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:49:49,071 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:49,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:49,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-08-05 10:49:49,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:49,094 WARN L254 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 162 conjunts are in the unsatisfiable core [2019-08-05 10:49:49,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:50,232 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:50,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:50,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:49:50,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:49:50,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:49:50,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:49:50,234 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:49:51,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:51,529 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:49:51,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:49:51,530 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:49:51,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:51,530 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:49:51,530 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:49:51,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:49:51,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:49:51,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:49:51,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:49:51,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:49:51,534 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:49:51,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:51,534 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:49:51,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:49:51,534 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:49:51,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:49:51,535 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:51,535 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:49:51,535 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:51,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:51,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-08-05 10:49:51,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:51,557 WARN L254 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 166 conjunts are in the unsatisfiable core [2019-08-05 10:49:51,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:52,731 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:52,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:52,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:49:52,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:49:52,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:49:52,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:49:52,733 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:49:54,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:54,084 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:49:54,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:49:54,084 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:49:54,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:54,085 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:49:54,085 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:49:54,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:49:54,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:49:54,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:49:54,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:49:54,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:49:54,089 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:49:54,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:54,089 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:49:54,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:49:54,090 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:49:54,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:49:54,090 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:54,090 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:49:54,091 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:54,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:54,091 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-08-05 10:49:54,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:54,123 WARN L254 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 170 conjunts are in the unsatisfiable core [2019-08-05 10:49:54,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:55,222 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:55,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:55,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:49:55,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:49:55,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:49:55,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:49:55,223 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:49:56,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:56,655 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:49:56,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:49:56,655 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:49:56,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:56,656 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:49:56,656 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:49:56,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:49:56,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:49:56,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:49:56,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:49:56,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:49:56,659 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:49:56,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:56,659 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:49:56,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:49:56,660 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:49:56,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:49:56,660 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:56,660 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:49:56,660 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:56,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:56,661 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-08-05 10:49:56,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:56,685 WARN L254 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 174 conjunts are in the unsatisfiable core [2019-08-05 10:49:56,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:57,858 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:57,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:57,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:49:57,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:49:57,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:49:57,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:49:57,860 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:49:59,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:59,325 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:49:59,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:49:59,325 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:49:59,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:59,326 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:49:59,326 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:49:59,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:49:59,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:49:59,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:49:59,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:49:59,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:49:59,330 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:49:59,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:59,330 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:49:59,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:49:59,331 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:49:59,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:49:59,331 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:59,331 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:49:59,332 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:59,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:59,332 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-08-05 10:49:59,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:59,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:59,355 WARN L254 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 178 conjunts are in the unsatisfiable core [2019-08-05 10:49:59,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:00,513 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:00,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:00,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:50:00,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:50:00,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:50:00,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:50:00,515 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:50:02,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:02,257 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:50:02,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:50:02,257 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:50:02,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:02,258 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:50:02,258 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:50:02,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:50:02,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:50:02,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:50:02,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:50:02,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:50:02,260 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:50:02,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:02,260 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:50:02,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:50:02,261 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:50:02,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:50:02,261 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:02,261 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:50:02,261 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:02,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:02,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-08-05 10:50:02,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:02,286 WARN L254 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 182 conjunts are in the unsatisfiable core [2019-08-05 10:50:02,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:03,589 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:03,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:03,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:50:03,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:50:03,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:50:03,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:50:03,591 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:50:05,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:05,208 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:50:05,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:50:05,209 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:50:05,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:05,210 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:50:05,210 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:50:05,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:50:05,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:50:05,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:50:05,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:50:05,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:50:05,212 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:50:05,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:05,212 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:50:05,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:50:05,213 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:50:05,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:50:05,213 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:05,214 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:50:05,214 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:05,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:05,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-08-05 10:50:05,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:05,240 WARN L254 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 186 conjunts are in the unsatisfiable core [2019-08-05 10:50:05,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:06,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:06,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:06,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:50:06,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:50:06,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:50:06,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:50:06,555 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:50:08,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:08,354 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:50:08,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:50:08,354 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:50:08,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:08,355 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:50:08,355 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:50:08,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:50:08,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:50:08,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:50:08,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:50:08,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:50:08,358 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:50:08,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:08,358 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:50:08,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:50:08,359 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:50:08,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:50:08,359 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:08,359 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:50:08,360 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:08,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:08,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-08-05 10:50:08,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:08,385 WARN L254 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 190 conjunts are in the unsatisfiable core [2019-08-05 10:50:08,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:09,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:09,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:09,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:50:09,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:50:09,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:50:09,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:50:09,829 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:50:11,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:11,570 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:50:11,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:50:11,570 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:50:11,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:11,571 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:50:11,571 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:50:11,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:50:11,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:50:11,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:50:11,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:50:11,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:50:11,574 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:50:11,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:11,575 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:50:11,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:50:11,575 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:50:11,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:50:11,575 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:11,575 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:50:11,576 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:11,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:11,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-08-05 10:50:11,577 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:11,600 WARN L254 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 194 conjunts are in the unsatisfiable core [2019-08-05 10:50:11,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:13,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:13,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:13,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:50:13,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:50:13,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:50:13,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:50:13,158 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:50:14,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:14,966 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:50:14,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:50:14,967 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:50:14,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:14,968 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:50:14,968 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:50:14,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:50:14,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:50:14,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:50:14,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:50:14,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:50:14,971 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:50:14,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:14,972 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:50:14,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:50:14,972 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:50:14,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:50:14,972 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:14,973 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:50:14,973 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:14,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:14,973 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-08-05 10:50:14,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:15,001 WARN L254 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 198 conjunts are in the unsatisfiable core [2019-08-05 10:50:15,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:16,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:16,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:16,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:50:16,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:50:16,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:50:16,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:50:16,429 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:50:18,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:18,483 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:50:18,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:50:18,483 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:50:18,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:18,484 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:50:18,484 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:50:18,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:50:18,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:50:18,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:50:18,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:50:18,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:50:18,487 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:50:18,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:18,488 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:50:18,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:50:18,488 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:50:18,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:50:18,488 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:18,489 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:50:18,489 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:18,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:18,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-08-05 10:50:18,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:18,513 WARN L254 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 202 conjunts are in the unsatisfiable core [2019-08-05 10:50:18,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:20,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:20,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:20,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:50:20,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:50:20,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:50:20,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:50:20,042 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:50:22,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:22,008 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:50:22,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:50:22,008 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:50:22,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:22,009 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:50:22,009 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:50:22,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:50:22,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:50:22,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:50:22,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:50:22,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:50:22,012 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:50:22,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:22,013 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:50:22,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:50:22,013 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:50:22,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:50:22,013 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:22,014 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:50:22,014 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:22,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:22,014 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-08-05 10:50:22,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:22,044 WARN L254 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 206 conjunts are in the unsatisfiable core [2019-08-05 10:50:22,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:23,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:23,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:23,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:50:23,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:50:23,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:50:23,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:50:23,978 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 10:50:26,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:26,008 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:50:26,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:50:26,008 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:50:26,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:26,009 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:50:26,010 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:50:26,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:50:26,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:50:26,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:50:26,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:50:26,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:50:26,012 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:50:26,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:26,012 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:50:26,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:50:26,013 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:50:26,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:50:26,013 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:26,013 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:50:26,014 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:26,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:26,014 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-08-05 10:50:26,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:26,045 WARN L254 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 210 conjunts are in the unsatisfiable core [2019-08-05 10:50:26,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:27,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:27,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:27,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:50:27,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:50:27,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:50:27,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:50:27,792 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 10:50:30,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:30,055 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:50:30,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:50:30,056 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:50:30,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:30,057 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:50:30,057 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:50:30,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:50:30,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:50:30,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:50:30,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:50:30,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:50:30,060 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:50:30,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:30,060 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:50:30,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:50:30,060 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:50:30,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:50:30,060 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:30,061 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:50:30,061 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:30,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:30,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-08-05 10:50:30,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:30,092 WARN L254 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 214 conjunts are in the unsatisfiable core [2019-08-05 10:50:30,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:31,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:31,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:31,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:50:31,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:50:31,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:50:31,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:50:31,733 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 10:50:34,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:34,138 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:50:34,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:50:34,139 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:50:34,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:34,139 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:50:34,139 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:50:34,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:50:34,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:50:34,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:50:34,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:50:34,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:50:34,143 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:50:34,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:34,143 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:50:34,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:50:34,144 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:50:34,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:50:34,144 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:34,144 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:50:34,145 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:34,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:34,145 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-08-05 10:50:34,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:34,185 WARN L254 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 218 conjunts are in the unsatisfiable core [2019-08-05 10:50:34,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:35,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:35,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:35,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:50:35,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:50:35,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:50:35,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:50:35,921 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 10:50:38,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:38,314 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:50:38,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:50:38,314 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:50:38,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:38,314 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:50:38,315 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:50:38,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:50:38,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:50:38,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:50:38,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:50:38,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:50:38,317 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:50:38,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:38,317 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:50:38,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:50:38,317 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:50:38,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:50:38,317 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:38,318 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:50:38,318 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:38,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:38,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-08-05 10:50:38,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:38,349 WARN L254 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 222 conjunts are in the unsatisfiable core [2019-08-05 10:50:38,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:40,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:40,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:40,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:50:40,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:50:40,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:50:40,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:50:40,079 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 10:50:42,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:42,463 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:50:42,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:50:42,464 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:50:42,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:42,465 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:50:42,465 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:50:42,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:50:42,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:50:42,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:50:42,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:50:42,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:50:42,467 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:50:42,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:42,467 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:50:42,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:50:42,467 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:50:42,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:50:42,468 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:42,468 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:50:42,468 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:42,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:42,468 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-08-05 10:50:42,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:42,503 WARN L254 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 226 conjunts are in the unsatisfiable core [2019-08-05 10:50:42,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:44,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:44,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:44,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:50:44,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:50:44,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:50:44,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:50:44,695 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 10:50:47,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:47,110 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:50:47,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:50:47,117 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:50:47,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:47,117 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:50:47,117 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:50:47,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:50:47,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:50:47,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:50:47,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:50:47,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:50:47,119 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:50:47,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:47,120 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:50:47,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:50:47,120 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:50:47,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:50:47,120 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:47,120 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:50:47,121 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:47,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:47,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-08-05 10:50:47,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:47,150 WARN L254 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 230 conjunts are in the unsatisfiable core [2019-08-05 10:50:47,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:49,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:49,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:49,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:50:49,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:50:49,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:50:49,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:50:49,402 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:50:51,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:51,952 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:50:51,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:50:51,953 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:50:51,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:51,954 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:50:51,954 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:50:51,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:50:51,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:50:51,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:50:51,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:50:51,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:50:51,957 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:50:51,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:51,958 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:50:51,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:50:51,958 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:50:51,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:50:51,958 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:51,958 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:50:51,959 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:51,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:51,959 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-08-05 10:50:51,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:51,987 WARN L254 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 234 conjunts are in the unsatisfiable core [2019-08-05 10:50:51,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:54,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:54,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:54,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:50:54,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:50:54,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:50:54,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:50:54,116 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:50:56,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:56,747 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:50:56,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:50:56,748 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:50:56,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:56,749 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:50:56,749 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:50:56,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:50:56,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:50:56,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:50:56,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:50:56,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:50:56,751 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:50:56,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:56,752 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:50:56,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:50:56,752 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:50:56,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:50:56,752 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:56,752 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:50:56,753 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:56,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:56,753 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-08-05 10:50:56,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:56,793 WARN L254 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 238 conjunts are in the unsatisfiable core [2019-08-05 10:50:56,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:59,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:59,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:59,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:50:59,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:50:59,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:50:59,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:50:59,190 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 10:51:01,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:01,855 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:51:01,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:51:01,855 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:51:01,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:01,856 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:51:01,856 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:51:01,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:51:01,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:51:01,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:51:01,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:51:01,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:51:01,860 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:51:01,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:01,860 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:51:01,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:51:01,860 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:51:01,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:51:01,861 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:01,861 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:51:01,861 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:01,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:01,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-08-05 10:51:01,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:01,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:01,886 WARN L254 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 242 conjunts are in the unsatisfiable core [2019-08-05 10:51:01,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:04,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:04,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:04,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:51:04,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:51:04,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:51:04,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:51:04,075 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 10:51:06,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:06,864 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:51:06,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:51:06,864 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:51:06,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:06,865 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:51:06,865 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:51:06,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:51:06,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:51:06,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:51:06,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:51:06,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:51:06,868 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:51:06,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:06,868 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:51:06,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:51:06,868 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:51:06,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:51:06,869 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:06,869 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:51:06,869 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:06,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:06,869 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-08-05 10:51:06,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:06,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:06,899 WARN L254 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 246 conjunts are in the unsatisfiable core [2019-08-05 10:51:06,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:09,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:09,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:09,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:51:09,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:51:09,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:51:09,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:51:09,229 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 10:51:12,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:12,147 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:51:12,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:51:12,147 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:51:12,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:12,148 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:51:12,148 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:51:12,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:51:12,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:51:12,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:51:12,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:51:12,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:51:12,151 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:51:12,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:12,151 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:51:12,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:51:12,151 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:51:12,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:51:12,152 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:12,152 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:51:12,152 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:12,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:12,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-08-05 10:51:12,153 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:12,191 WARN L254 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 250 conjunts are in the unsatisfiable core [2019-08-05 10:51:12,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:14,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:14,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:14,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:51:14,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:51:14,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:51:14,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:51:14,549 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 10:51:17,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:17,522 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:51:17,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:51:17,523 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:51:17,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:17,524 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:51:17,524 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:51:17,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:51:17,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:51:17,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:51:17,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:51:17,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:51:17,526 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:51:17,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:17,526 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:51:17,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:51:17,527 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:51:17,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:51:17,527 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:17,528 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:51:17,528 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:17,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:17,528 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-08-05 10:51:17,529 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:17,569 WARN L254 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 254 conjunts are in the unsatisfiable core [2019-08-05 10:51:17,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:19,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:19,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:19,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:51:19,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:51:19,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:51:19,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:51:19,876 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 10:51:22,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:22,907 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:51:22,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:51:22,907 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 10:51:22,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:22,908 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:51:22,908 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:51:22,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:51:22,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:51:22,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:51:22,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:51:22,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:51:22,911 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:51:22,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:22,912 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:51:22,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:51:22,912 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:51:22,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:51:22,912 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:22,913 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:51:22,913 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:22,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:22,913 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-08-05 10:51:22,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:22,953 WARN L254 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 258 conjunts are in the unsatisfiable core [2019-08-05 10:51:22,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:25,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:25,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:25,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:51:25,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:51:25,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:51:25,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:51:25,516 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 10:51:28,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:28,669 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:51:28,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:51:28,670 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:51:28,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:28,671 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:51:28,671 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:51:28,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:51:28,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:51:28,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:51:28,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:51:28,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:51:28,674 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:51:28,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:28,674 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:51:28,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:51:28,674 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:51:28,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:51:28,675 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:28,675 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:51:28,676 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:28,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:28,677 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-08-05 10:51:28,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:28,721 WARN L254 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 262 conjunts are in the unsatisfiable core [2019-08-05 10:51:28,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:31,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:31,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:31,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:51:31,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:51:31,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:51:31,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:51:31,282 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:51:34,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:34,674 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:51:34,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:51:34,674 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:51:34,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:34,675 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:51:34,675 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:51:34,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:51:34,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:51:34,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:51:34,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:51:34,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:51:34,678 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:51:34,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:34,679 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:51:34,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:51:34,679 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:51:34,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:51:34,679 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:34,680 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:51:34,680 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:34,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:34,680 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-08-05 10:51:34,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:34,731 WARN L254 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 266 conjunts are in the unsatisfiable core [2019-08-05 10:51:34,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:37,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:37,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:37,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:51:37,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:51:37,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:51:37,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:51:37,147 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:51:40,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:40,646 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:51:40,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:51:40,647 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:51:40,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:40,647 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:51:40,648 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:51:40,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:51:40,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:51:40,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:51:40,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:51:40,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:51:40,650 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:51:40,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:40,650 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:51:40,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:51:40,651 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:51:40,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:51:40,651 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:40,651 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:51:40,652 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:40,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:40,652 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-08-05 10:51:40,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:40,682 WARN L254 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 270 conjunts are in the unsatisfiable core [2019-08-05 10:51:40,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:43,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:43,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:43,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:51:43,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:51:43,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:51:43,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:51:43,200 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 10:51:46,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:46,768 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:51:46,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:51:46,768 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 10:51:46,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:46,769 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:51:46,769 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:51:46,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:51:46,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:51:46,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:51:46,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:51:46,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:51:46,772 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:51:46,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:46,773 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:51:46,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:51:46,773 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:51:46,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:51:46,774 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:46,774 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:51:46,774 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:46,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:46,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-08-05 10:51:46,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:46,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:46,816 WARN L254 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 274 conjunts are in the unsatisfiable core [2019-08-05 10:51:46,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:49,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:49,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:49,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:51:49,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:51:49,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:51:49,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:51:49,384 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 10:51:53,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:53,069 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:51:53,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:51:53,069 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:51:53,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:53,070 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:51:53,070 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:51:53,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:51:53,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:51:53,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:51:53,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:51:53,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:51:53,073 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:51:53,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:53,073 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:51:53,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:51:53,073 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:51:53,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:51:53,073 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:53,073 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:51:53,074 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:53,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:53,074 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-08-05 10:51:53,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:53,117 WARN L254 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 278 conjunts are in the unsatisfiable core [2019-08-05 10:51:53,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:56,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:56,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:56,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:51:56,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:51:56,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:51:56,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:51:56,034 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 10:51:59,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:59,651 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:51:59,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:51:59,652 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 10:51:59,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:59,653 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:51:59,653 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:51:59,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:51:59,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:51:59,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:51:59,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:51:59,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:51:59,656 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:51:59,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:59,656 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:51:59,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:51:59,656 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:51:59,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:51:59,657 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:59,657 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:51:59,657 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:59,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:59,658 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-08-05 10:51:59,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:59,706 WARN L254 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 282 conjunts are in the unsatisfiable core [2019-08-05 10:51:59,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:02,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:02,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:02,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:52:02,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:52:02,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:52:02,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:52:02,730 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 10:52:06,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:06,661 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:52:06,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:52:06,662 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:52:06,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:06,663 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:52:06,663 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:52:06,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:52:06,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:52:06,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:52:06,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:52:06,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:52:06,666 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:52:06,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:06,666 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:52:06,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:52:06,667 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:52:06,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:52:06,667 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:06,667 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:52:06,668 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:06,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:06,668 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-08-05 10:52:06,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:06,728 WARN L254 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 286 conjunts are in the unsatisfiable core [2019-08-05 10:52:06,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:09,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:09,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:09,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:52:09,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:52:09,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:52:09,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:52:09,657 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 10:52:13,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:13,712 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:52:13,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:52:13,712 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 10:52:13,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:13,713 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:52:13,714 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:52:13,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:52:13,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:52:13,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:52:13,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:52:13,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:52:13,717 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:52:13,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:13,718 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:52:13,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:52:13,718 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:52:13,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:52:13,718 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:13,719 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:52:13,719 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:13,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:13,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-08-05 10:52:13,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:13,773 WARN L254 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 290 conjunts are in the unsatisfiable core [2019-08-05 10:52:13,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:17,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:17,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:17,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:52:17,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:52:17,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:52:17,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:52:17,075 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 10:52:21,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:21,260 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:52:21,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:52:21,260 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:52:21,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:21,261 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:52:21,262 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:52:21,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:52:21,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:52:21,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:52:21,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:52:21,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:52:21,265 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:52:21,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:21,265 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:52:21,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:52:21,265 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:52:21,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:52:21,266 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:21,266 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:52:21,266 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:21,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:21,267 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-08-05 10:52:21,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:21,321 WARN L254 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 294 conjunts are in the unsatisfiable core [2019-08-05 10:52:21,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:24,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:24,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:24,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:52:24,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:52:24,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:52:24,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:52:24,321 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:52:28,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:28,653 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:52:28,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:52:28,654 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:52:28,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:28,655 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:52:28,655 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:52:28,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:52:28,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:52:28,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:52:28,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:52:28,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:52:28,658 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:52:28,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:28,658 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:52:28,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:52:28,658 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:52:28,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:52:28,659 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:28,659 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:52:28,659 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:28,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:28,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-08-05 10:52:28,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:28,696 WARN L254 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 298 conjunts are in the unsatisfiable core [2019-08-05 10:52:28,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:31,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:31,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:31,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:52:31,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:52:31,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:52:31,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:52:31,836 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 10:52:36,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:36,258 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:52:36,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:52:36,260 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:52:36,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:36,261 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:52:36,261 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:52:36,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:52:36,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:52:36,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:52:36,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:52:36,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:52:36,263 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:52:36,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:36,263 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:52:36,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:52:36,263 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:52:36,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:52:36,264 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:36,264 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:52:36,264 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:36,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:36,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-08-05 10:52:36,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:36,316 WARN L254 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 302 conjunts are in the unsatisfiable core [2019-08-05 10:52:36,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:39,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:39,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:39,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:52:39,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:52:39,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:52:39,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:52:39,973 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 10:52:44,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:44,415 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:52:44,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:52:44,415 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 10:52:44,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:44,416 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:52:44,416 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:52:44,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:52:44,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:52:44,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:52:44,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:52:44,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:52:44,418 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:52:44,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:44,419 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:52:44,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:52:44,419 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:52:44,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:52:44,420 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:44,420 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:52:44,420 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:44,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:44,420 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-08-05 10:52:44,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:44,459 WARN L254 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 306 conjunts are in the unsatisfiable core [2019-08-05 10:52:44,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:47,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:47,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:47,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:52:47,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:52:47,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:52:47,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:52:47,974 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 10:52:52,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:52,453 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:52:52,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:52:52,453 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:52:52,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:52,454 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:52:52,454 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:52:52,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:52:52,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:52:52,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:52:52,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:52:52,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:52:52,457 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:52:52,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:52,458 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:52:52,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:52:52,458 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:52:52,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:52:52,458 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:52,458 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:52:52,459 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:52,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:52,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-08-05 10:52:52,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:52,523 WARN L254 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 310 conjunts are in the unsatisfiable core [2019-08-05 10:52:52,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:56,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:56,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:56,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:52:56,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:52:56,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:52:56,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:52:56,229 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-05 10:53:00,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:00,903 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:53:00,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:53:00,904 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 10:53:00,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:00,905 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:53:00,905 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:53:00,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:53:00,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:53:00,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:53:00,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:53:00,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:53:00,908 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 10:53:00,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:00,908 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:53:00,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:53:00,908 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:53:00,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:53:00,909 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:00,909 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 10:53:00,909 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:00,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:00,909 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-08-05 10:53:00,910 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:00,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:00,965 WARN L254 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 314 conjunts are in the unsatisfiable core [2019-08-05 10:53:00,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:04,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:53:04,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:04,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:53:04,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:53:04,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:53:04,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:53:04,432 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-05 10:53:09,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:09,575 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:53:09,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:53:09,576 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-05 10:53:09,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:09,576 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:53:09,576 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:53:09,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:53:09,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:53:09,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:53:09,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:53:09,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:53:09,580 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 10:53:09,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:09,580 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:53:09,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:53:09,580 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:53:09,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:53:09,581 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:09,581 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-05 10:53:09,581 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:09,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:09,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-08-05 10:53:09,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:09,627 WARN L254 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 318 conjunts are in the unsatisfiable core [2019-08-05 10:53:09,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:13,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:53:13,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:13,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:53:13,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:53:13,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:53:13,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:53:13,169 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. Received shutdown request... [2019-08-05 10:53:17,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:53:17,209 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:53:17,215 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:53:17,215 INFO L202 PluginConnector]: Adding new model hhk2008.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:53:17 BoogieIcfgContainer [2019-08-05 10:53:17,215 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:53:17,217 INFO L168 Benchmark]: Toolchain (without parser) took 252857.46 ms. Allocated memory was 134.2 MB in the beginning and 174.6 MB in the end (delta: 40.4 MB). Free memory was 110.6 MB in the beginning and 106.0 MB in the end (delta: 4.7 MB). Peak memory consumption was 45.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:53:17,217 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 134.2 MB. Free memory is still 111.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:53:17,218 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.79 ms. Allocated memory is still 134.2 MB. Free memory was 110.2 MB in the beginning and 108.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:53:17,219 INFO L168 Benchmark]: Boogie Preprocessor took 23.51 ms. Allocated memory is still 134.2 MB. Free memory was 108.5 MB in the beginning and 107.7 MB in the end (delta: 855.6 kB). Peak memory consumption was 855.6 kB. Max. memory is 7.1 GB. [2019-08-05 10:53:17,219 INFO L168 Benchmark]: RCFGBuilder took 315.79 ms. Allocated memory is still 134.2 MB. Free memory was 107.7 MB in the beginning and 97.9 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:53:17,220 INFO L168 Benchmark]: TraceAbstraction took 252479.47 ms. Allocated memory was 134.2 MB in the beginning and 174.6 MB in the end (delta: 40.4 MB). Free memory was 97.9 MB in the beginning and 106.0 MB in the end (delta: -8.1 MB). Peak memory consumption was 32.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:53:17,222 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 134.2 MB. Free memory is still 111.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.79 ms. Allocated memory is still 134.2 MB. Free memory was 110.2 MB in the beginning and 108.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.51 ms. Allocated memory is still 134.2 MB. Free memory was 108.5 MB in the beginning and 107.7 MB in the end (delta: 855.6 kB). Peak memory consumption was 855.6 kB. Max. memory is 7.1 GB. * RCFGBuilder took 315.79 ms. Allocated memory is still 134.2 MB. Free memory was 107.7 MB in the beginning and 97.9 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 252479.47 ms. Allocated memory was 134.2 MB in the beginning and 174.6 MB in the end (delta: 40.4 MB). Free memory was 97.9 MB in the beginning and 106.0 MB in the end (delta: -8.1 MB). Peak memory consumption was 32.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 48]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 48). Cancelled while BasicCegarLoop was constructing difference of abstraction (82states) and FLOYD_HOARE automaton (currently 66 states, 81 states before enhancement),while ReachableStatesComputation was computing reachable states (64 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 252.4s OverallTime, 79 OverallIterations, 78 TraceHistogramMax, 136.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 235 SDtfs, 0 SDslu, 3081 SDs, 0 SdLazy, 172456 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 115.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3239 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 3160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 110.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 78 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 112.9s InterpolantComputationTime, 3318 NumberOfCodeBlocks, 3318 NumberOfCodeBlocksAsserted, 79 NumberOfCheckSat, 3239 ConstructedInterpolants, 0 QuantifiedInterpolants, 1877040 SizeOfPredicates, 316 NumberOfNonLiveVariables, 17459 ConjunctsInSsa, 12798 ConjunctsInUnsatCore, 79 InterpolantComputations, 1 PerfectInterpolantSequences, 0/82160 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown