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/jm2006_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:47:36,701 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:47:36,704 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:47:36,720 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:47:36,721 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:47:36,722 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:47:36,723 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:47:36,727 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:47:36,729 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:47:36,732 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:47:36,733 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:47:36,733 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:47:36,733 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:47:36,735 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:47:36,736 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:47:36,739 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:47:36,746 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:47:36,747 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:47:36,751 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:47:36,753 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:47:36,757 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:47:36,759 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:47:36,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:47:36,761 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:47:36,764 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:47:36,764 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:47:36,764 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:47:36,765 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:47:36,766 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:47:36,767 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:47:36,767 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:47:36,769 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:47:36,770 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:47:36,772 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:47:36,774 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:47:36,774 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:47:36,775 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:47:36,775 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:47:36,775 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:47:36,776 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:47:36,776 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:47:36,817 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:47:36,829 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:47:36,833 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:47:36,834 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:47:36,835 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:47:36,835 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/jm2006_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl [2019-08-05 10:47:36,836 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/jm2006_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl' [2019-08-05 10:47:36,871 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:47:36,872 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:47:36,873 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:47:36,873 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:47:36,873 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:47:36,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "jm2006_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:36" (1/1) ... [2019-08-05 10:47:36,898 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "jm2006_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:36" (1/1) ... [2019-08-05 10:47:36,906 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:47:36,907 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:47:36,907 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:47:36,907 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:47:36,918 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "jm2006_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:36" (1/1) ... [2019-08-05 10:47:36,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "jm2006_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:36" (1/1) ... [2019-08-05 10:47:36,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "jm2006_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:36" (1/1) ... [2019-08-05 10:47:36,919 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "jm2006_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:36" (1/1) ... [2019-08-05 10:47:36,923 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "jm2006_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:36" (1/1) ... [2019-08-05 10:47:36,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "jm2006_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:36" (1/1) ... [2019-08-05 10:47:36,925 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "jm2006_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:36" (1/1) ... [2019-08-05 10:47:36,927 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:47:36,927 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:47:36,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:47:36,927 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:47:36,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "jm2006_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:36" (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:47:36,997 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:47:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:47:36,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:47:37,284 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:47:37,285 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:47:37,286 INFO L202 PluginConnector]: Adding new model jm2006_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:47:37 BoogieIcfgContainer [2019-08-05 10:47:37,286 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:47:37,291 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:47:37,291 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:47:37,295 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:47:37,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "jm2006_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:36" (1/2) ... [2019-08-05 10:47:37,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b8237a0 and model type jm2006_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:47:37, skipping insertion in model container [2019-08-05 10:47:37,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "jm2006_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:47:37" (2/2) ... [2019-08-05 10:47:37,299 INFO L109 eAbstractionObserver]: Analyzing ICFG jm2006_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl [2019-08-05 10:47:37,307 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:47:37,317 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:47:37,335 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:47:37,361 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:47:37,362 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:47:37,362 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:47:37,362 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:47:37,362 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:47:37,362 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:47:37,363 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:47:37,363 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:47:37,363 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:47:37,377 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:47:37,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:47:37,385 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:37,386 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:47:37,389 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:37,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:37,395 INFO L82 PathProgramCache]: Analyzing trace with hash 30017, now seen corresponding path program 1 times [2019-08-05 10:47:37,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:37,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:37,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:47:37,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:37,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:37,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:47:37,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:47:37,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:47:37,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:47:37,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:47:37,646 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:47:37,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:37,709 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:47:37,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:47:37,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:47:37,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:37,722 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:47:37,723 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:47:37,725 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:47:37,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:47:37,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:47:37,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:47:37,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:47:37,757 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:47:37,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:37,757 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:47:37,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:47:37,758 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:47:37,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:47:37,758 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:37,758 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:47:37,759 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:37,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:37,760 INFO L82 PathProgramCache]: Analyzing trace with hash 928552, now seen corresponding path program 1 times [2019-08-05 10:47:37,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:37,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:47:37,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:37,938 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:47:37,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:37,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:47:37,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:47:37,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:47:37,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:47:37,941 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:47:37,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:37,975 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:47:37,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:47:37,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:47:37,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:37,977 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:47:37,977 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:47:37,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:47:37,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:47:37,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:47:37,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:47:37,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:47:37,981 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:47:37,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:37,981 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:47:37,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:47:37,982 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:47:37,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:47:37,983 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:37,983 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:47:37,983 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:37,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:37,984 INFO L82 PathProgramCache]: Analyzing trace with hash 28783137, now seen corresponding path program 2 times [2019-08-05 10:47:37,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:38,023 WARN L254 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:47:38,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:38,169 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:47:38,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:38,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:47:38,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:47:38,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:47:38,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:47:38,172 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:47:38,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:38,250 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:47:38,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:47:38,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:47:38,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:38,252 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:47:38,252 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:47:38,253 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:47:38,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:47:38,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:47:38,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:47:38,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:47:38,255 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:47:38,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:38,255 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:47:38,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:47:38,256 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:47:38,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:47:38,256 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:38,256 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:47:38,257 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:38,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:38,257 INFO L82 PathProgramCache]: Analyzing trace with hash 892275272, now seen corresponding path program 3 times [2019-08-05 10:47:38,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:38,282 WARN L254 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:47:38,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:38,587 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:47:38,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:38,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:47:38,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:47:38,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:47:38,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:47:38,589 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:47:38,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:38,644 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:47:38,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:47:38,644 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:47:38,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:38,645 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:47:38,645 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:47:38,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:47:38,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:47:38,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:47:38,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:47:38,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:47:38,649 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:47:38,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:38,649 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:47:38,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:47:38,649 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:47:38,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:47:38,650 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:38,650 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:47:38,650 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:38,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:38,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1890727681, now seen corresponding path program 4 times [2019-08-05 10:47:38,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:38,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:38,677 WARN L254 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:47:38,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:38,962 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:47:38,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:38,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:47:38,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:47:38,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:47:38,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:47:38,963 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:47:39,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:39,046 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:47:39,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:47:39,047 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:47:39,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:39,048 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:47:39,048 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:47:39,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:47:39,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:47:39,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:47:39,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:47:39,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:47:39,051 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:47:39,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:39,052 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:47:39,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:47:39,052 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:47:39,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:47:39,053 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:39,053 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:47:39,053 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:39,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:39,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1516986008, now seen corresponding path program 5 times [2019-08-05 10:47:39,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:39,079 WARN L254 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:47:39,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:39,262 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:47:39,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:39,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:47:39,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:47:39,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:47:39,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:47:39,265 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:47:39,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:39,392 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:47:39,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:47:39,398 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:47:39,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:39,399 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:47:39,399 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:47:39,400 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:47:39,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:47:39,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:47:39,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:47:39,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:47:39,405 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:47:39,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:39,406 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:47:39,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:47:39,406 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:47:39,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:47:39,407 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:39,407 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:47:39,409 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:39,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:39,409 INFO L82 PathProgramCache]: Analyzing trace with hash 218072033, now seen corresponding path program 6 times [2019-08-05 10:47:39,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:39,444 WARN L254 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:47:39,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:39,880 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:47:39,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:39,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:47:39,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:47:39,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:47:39,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:47:39,882 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:47:40,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:40,006 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:47:40,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:47:40,007 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:47:40,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:40,008 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:47:40,008 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:47:40,009 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:47:40,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:47:40,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:47:40,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:47:40,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:47:40,012 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:47:40,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:40,012 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:47:40,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:47:40,012 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:47:40,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:47:40,013 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:40,013 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:47:40,013 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:40,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:40,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1829703544, now seen corresponding path program 7 times [2019-08-05 10:47:40,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:40,041 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:47:40,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:40,318 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:47:40,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:40,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:47:40,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:47:40,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:47:40,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:47:40,320 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:47:40,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:40,439 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:47:40,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:47:40,441 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:47:40,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:40,442 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:47:40,442 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:47:40,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:47:40,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:47:40,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:47:40,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:47:40,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:47:40,446 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:47:40,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:40,446 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:47:40,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:47:40,446 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:47:40,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:47:40,447 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:40,447 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:47:40,447 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:40,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:40,448 INFO L82 PathProgramCache]: Analyzing trace with hash -886236991, now seen corresponding path program 8 times [2019-08-05 10:47:40,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:40,473 WARN L254 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:47:40,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:40,769 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:47:40,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:40,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:47:40,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:47:40,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:47:40,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:47:40,771 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:47:40,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:40,920 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:47:40,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:47:40,920 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:47:40,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:40,921 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:47:40,921 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:47:40,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:47:40,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:47:40,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:47:40,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:47:40,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:47:40,925 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:47:40,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:40,925 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:47:40,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:47:40,926 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:47:40,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:47:40,926 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:40,926 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:47:40,926 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:40,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:40,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1703544920, now seen corresponding path program 9 times [2019-08-05 10:47:40,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:40,953 WARN L254 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:47:40,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:41,158 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:47:41,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:41,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:47:41,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:47:41,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:47:41,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:47:41,160 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:47:41,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:41,313 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:47:41,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:47:41,314 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:47:41,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:41,315 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:47:41,315 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:47:41,316 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:47:41,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:47:41,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:47:41,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:47:41,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:47:41,321 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:47:41,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:41,321 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:47:41,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:47:41,322 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:47:41,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:47:41,322 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:41,322 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:47:41,322 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:41,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:41,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1270286943, now seen corresponding path program 10 times [2019-08-05 10:47:41,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:41,353 WARN L254 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:47:41,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:41,573 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:47:41,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:41,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:47:41,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:47:41,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:47:41,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:47:41,575 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:47:41,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:41,988 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:47:41,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:47:41,989 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:47:41,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:41,990 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:47:41,990 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:47:41,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:47:41,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:47:41,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:47:41,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:47:41,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:47:41,993 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:47:41,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:41,994 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:47:41,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:47:41,994 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:47:41,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:47:41,994 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:41,995 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:47:41,995 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:41,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:41,995 INFO L82 PathProgramCache]: Analyzing trace with hash -724191544, now seen corresponding path program 11 times [2019-08-05 10:47:41,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:42,019 WARN L254 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:47:42,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:42,313 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:47:42,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:42,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:47:42,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:47:42,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:47:42,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:47:42,316 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:47:42,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:42,487 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:47:42,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:47:42,487 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:47:42,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:42,488 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:47:42,488 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:47:42,489 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:47:42,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:47:42,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:47:42,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:47:42,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:47:42,492 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:47:42,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:42,492 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:47:42,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:47:42,492 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:47:42,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:47:42,493 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:42,493 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:47:42,493 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:42,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:42,494 INFO L82 PathProgramCache]: Analyzing trace with hash -975103359, now seen corresponding path program 12 times [2019-08-05 10:47:42,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:42,516 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:47:42,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:43,084 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:47:43,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:43,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:47:43,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:47:43,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:47:43,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:47:43,086 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:47:43,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:43,278 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:47:43,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:47:43,285 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:47:43,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:43,286 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:47:43,286 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:47:43,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:47:43,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:47:43,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:47:43,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:47:43,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:47:43,292 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:47:43,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:43,292 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:47:43,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:47:43,292 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:47:43,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:47:43,293 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:43,293 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:47:43,294 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:43,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:43,294 INFO L82 PathProgramCache]: Analyzing trace with hash -163435032, now seen corresponding path program 13 times [2019-08-05 10:47:43,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:43,334 WARN L254 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:47:43,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:43,724 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:47:43,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:43,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:47:43,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:47:43,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:47:43,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:47:43,726 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:47:44,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:44,046 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:47:44,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:47:44,046 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:47:44,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:44,047 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:47:44,047 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:47:44,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:47:44,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:47:44,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:47:44,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:47:44,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:47:44,051 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:47:44,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:44,052 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:47:44,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:47:44,052 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:47:44,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:47:44,052 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:44,053 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:47:44,053 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:44,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:44,053 INFO L82 PathProgramCache]: Analyzing trace with hash -771520671, now seen corresponding path program 14 times [2019-08-05 10:47:44,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:44,071 WARN L254 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:47:44,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:44,557 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:47:44,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:44,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:47:44,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:47:44,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:47:44,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:47:44,560 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:47:44,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:44,788 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:47:44,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:47:44,788 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:47:44,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:44,790 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:47:44,790 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:47:44,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:47:44,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:47:44,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:47:44,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:47:44,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:47:44,793 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:47:44,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:44,794 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:47:44,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:47:44,794 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:47:44,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:47:44,795 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:44,795 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:47:44,795 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:44,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:44,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1852661000, now seen corresponding path program 15 times [2019-08-05 10:47:44,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:44,813 WARN L254 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:47:44,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:45,096 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:47:45,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:45,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:47:45,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:47:45,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:47:45,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:47:45,098 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:47:45,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:45,372 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:47:45,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:47:45,373 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:47:45,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:45,374 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:47:45,374 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:47:45,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:47:45,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:47:45,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:47:45,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:47:45,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:47:45,378 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:47:45,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:45,379 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:47:45,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:47:45,379 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:47:45,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:47:45,379 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:45,380 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:47:45,380 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:45,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:45,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1597914177, now seen corresponding path program 16 times [2019-08-05 10:47:45,381 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:45,399 WARN L254 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 10:47:45,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:45,875 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:47:45,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:45,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:47:45,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:47:45,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:47:45,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:47:45,877 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:47:46,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:46,185 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:47:46,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:47:46,185 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:47:46,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:46,186 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:47:46,186 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:47:46,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:47:46,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:47:46,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:47:46,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:47:46,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:47:46,189 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:47:46,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:46,189 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:47:46,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:47:46,190 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:47:46,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:47:46,190 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:46,190 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:47:46,191 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:46,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:46,191 INFO L82 PathProgramCache]: Analyzing trace with hash -2004270040, now seen corresponding path program 17 times [2019-08-05 10:47:46,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:46,209 WARN L254 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 10:47:46,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:46,558 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:47:46,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:46,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:47:46,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:47:46,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:47:46,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:47:46,560 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:47:46,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:46,937 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:47:46,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:47:46,938 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:47:46,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:46,939 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:47:46,939 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:47:46,940 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:47:46,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:47:46,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:47:46,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:47:46,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:47:46,943 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:47:46,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:46,943 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:47:46,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:47:46,943 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:47:46,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:47:46,944 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:46,944 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:47:46,944 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:46,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:46,945 INFO L82 PathProgramCache]: Analyzing trace with hash -2002831071, now seen corresponding path program 18 times [2019-08-05 10:47:46,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:46,968 WARN L254 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 119 conjunts are in the unsatisfiable core [2019-08-05 10:47:46,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:47,505 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:47:47,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:47,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:47:47,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:47:47,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:47:47,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:47:47,507 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:47:47,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:47,918 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:47:47,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:47:47,918 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:47:47,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:47,919 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:47:47,919 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:47:47,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:47:47,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:47:47,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:47:47,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:47:47,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:47:47,923 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:47:47,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:47,924 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:47:47,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:47:47,924 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:47:47,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:47:47,925 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:47,925 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:47:47,925 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:47,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:47,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1958223032, now seen corresponding path program 19 times [2019-08-05 10:47:47,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:47,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:47,946 WARN L254 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 125 conjunts are in the unsatisfiable core [2019-08-05 10:47:47,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:48,359 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:47:48,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:48,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:47:48,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:47:48,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:47:48,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:47:48,361 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:47:48,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:48,831 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:47:48,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:47:48,832 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:47:48,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:48,832 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:47:48,832 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:47:48,833 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:47:48,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:47:48,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:47:48,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:47:48,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:47:48,836 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:47:48,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:48,837 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:47:48,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:47:48,837 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:47:48,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:47:48,838 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:48,838 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:47:48,838 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:48,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:48,838 INFO L82 PathProgramCache]: Analyzing trace with hash -575373823, now seen corresponding path program 20 times [2019-08-05 10:47:48,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:48,861 WARN L254 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 131 conjunts are in the unsatisfiable core [2019-08-05 10:47:48,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:49,603 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:47:49,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:49,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:47:49,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:47:49,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:47:49,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:47:49,604 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:47:50,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:50,022 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:47:50,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:47:50,027 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:47:50,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:50,028 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:47:50,028 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:47:50,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:47:50,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:47:50,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:47:50,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:47:50,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:47:50,031 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:47:50,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:50,031 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:47:50,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:47:50,032 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:47:50,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:47:50,032 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:50,032 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:47:50,033 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:50,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:50,033 INFO L82 PathProgramCache]: Analyzing trace with hash -656721304, now seen corresponding path program 21 times [2019-08-05 10:47:50,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:50,053 WARN L254 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 137 conjunts are in the unsatisfiable core [2019-08-05 10:47:50,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:50,839 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:47:50,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:50,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:47:50,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:47:50,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:47:50,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:47:50,841 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:47:51,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:51,408 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:47:51,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:47:51,411 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:47:51,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:51,412 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:47:51,412 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:47:51,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:47:51,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:47:51,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:47:51,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:47:51,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:47:51,415 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:47:51,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:51,415 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:47:51,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:47:51,416 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:47:51,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:47:51,416 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:51,416 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:47:51,417 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:51,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:51,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1116474081, now seen corresponding path program 22 times [2019-08-05 10:47:51,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:51,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:51,440 WARN L254 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 143 conjunts are in the unsatisfiable core [2019-08-05 10:47:51,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:52,073 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:47:52,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:52,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:52,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:47:52,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:47:52,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:47:52,074 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:47:52,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:52,862 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:47:52,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:47:52,864 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:47:52,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:52,864 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:47:52,864 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:47:52,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:47:52,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:47:52,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:47:52,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:47:52,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:47:52,868 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:47:52,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:52,868 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:47:52,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:47:52,868 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:47:52,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:47:52,869 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:52,869 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:47:52,869 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:52,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:52,870 INFO L82 PathProgramCache]: Analyzing trace with hash 250956168, now seen corresponding path program 23 times [2019-08-05 10:47:52,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:52,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:52,892 WARN L254 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 149 conjunts are in the unsatisfiable core [2019-08-05 10:47:52,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:54,021 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:47:54,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:54,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:47:54,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:54,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:54,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:54,022 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:47:54,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:54,911 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:47:54,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:54,912 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:47:54,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:54,913 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:47:54,913 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:47:54,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:54,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:47:54,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:47:54,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:47:54,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:47:54,917 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:47:54,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:54,918 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:47:54,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:54,918 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:47:54,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:47:54,919 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:54,919 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:47:54,919 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:54,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:54,919 INFO L82 PathProgramCache]: Analyzing trace with hash -810295359, now seen corresponding path program 24 times [2019-08-05 10:47:54,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:54,941 WARN L254 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 155 conjunts are in the unsatisfiable core [2019-08-05 10:47:54,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:55,209 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:47:55,955 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:47:55,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:55,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:47:55,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:47:55,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:47:55,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:55,957 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:47:56,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:56,531 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:47:56,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:47:56,531 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:47:56,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:56,532 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:47:56,532 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:47:56,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:56,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:47:56,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:47:56,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:47:56,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:47:56,537 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:47:56,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:56,537 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:47:56,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:47:56,538 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:47:56,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:47:56,538 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:56,538 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:47:56,539 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:56,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:56,539 INFO L82 PathProgramCache]: Analyzing trace with hash 650645672, now seen corresponding path program 25 times [2019-08-05 10:47:56,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:56,565 WARN L254 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 161 conjunts are in the unsatisfiable core [2019-08-05 10:47:56,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:57,251 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:47:57,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:57,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:47:57,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:47:57,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:47:57,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:47:57,252 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:47:57,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:57,863 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:47:57,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:47:57,864 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:47:57,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:57,864 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:47:57,864 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:47:57,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:47:57,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:47:57,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:47:57,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:47:57,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:47:57,868 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:47:57,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:57,868 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:47:57,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:47:57,869 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:47:57,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:47:57,869 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:57,869 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:47:57,869 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:57,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:57,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1304822623, now seen corresponding path program 26 times [2019-08-05 10:47:57,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:57,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:57,891 WARN L254 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 167 conjunts are in the unsatisfiable core [2019-08-05 10:47:57,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:58,512 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:47:58,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:58,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:47:58,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:47:58,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:47:58,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:47:58,514 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:47:59,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:59,180 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:47:59,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:47:59,180 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:47:59,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:59,181 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:47:59,181 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:47:59,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:47:59,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:47:59,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:47:59,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:47:59,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:47:59,185 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:47:59,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:59,185 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:47:59,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:47:59,185 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:47:59,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:47:59,186 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:59,186 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:47:59,186 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:59,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:59,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1794797624, now seen corresponding path program 27 times [2019-08-05 10:47:59,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:59,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:59,209 WARN L254 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 173 conjunts are in the unsatisfiable core [2019-08-05 10:47:59,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:00,084 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:48:00,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:00,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:48:00,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:48:00,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:48:00,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:48:00,086 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:48:00,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:00,792 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:48:00,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:48:00,793 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:48:00,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:00,793 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:48:00,794 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:48:00,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:48:00,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:48:00,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:48:00,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:48:00,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:48:00,798 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:48:00,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:00,798 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:48:00,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:48:00,798 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:48:00,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:48:00,799 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:00,799 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:48:00,799 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:00,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:00,800 INFO L82 PathProgramCache]: Analyzing trace with hash 195846529, now seen corresponding path program 28 times [2019-08-05 10:48:00,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:00,824 WARN L254 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 179 conjunts are in the unsatisfiable core [2019-08-05 10:48:00,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:01,661 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:48:01,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:01,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:48:01,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:48:01,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:48:01,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:48:01,662 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:48:02,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:02,403 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:48:02,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:48:02,403 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:48:02,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:02,404 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:48:02,404 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:48:02,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:48:02,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:48:02,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:48:02,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:48:02,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:48:02,409 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:48:02,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:02,409 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:48:02,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:48:02,409 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:48:02,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:48:02,410 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:02,410 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:48:02,410 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:02,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:02,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1776273128, now seen corresponding path program 29 times [2019-08-05 10:48:02,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:02,437 WARN L254 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 185 conjunts are in the unsatisfiable core [2019-08-05 10:48:02,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:03,267 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:48:03,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:03,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:48:03,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:48:03,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:48:03,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:48:03,268 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:48:04,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:04,037 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:48:04,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:48:04,037 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:48:04,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:04,038 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:48:04,038 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:48:04,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:48:04,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:48:04,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:48:04,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:48:04,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:48:04,042 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:48:04,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:04,043 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:48:04,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:48:04,043 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:48:04,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:48:04,043 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:04,043 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:48:04,044 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:04,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:04,044 INFO L82 PathProgramCache]: Analyzing trace with hash -770109855, now seen corresponding path program 30 times [2019-08-05 10:48:04,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:04,068 WARN L254 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 191 conjunts are in the unsatisfiable core [2019-08-05 10:48:04,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:05,155 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:48:05,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:05,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:48:05,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:48:05,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:48:05,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:48:05,157 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:48:05,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:05,986 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:48:05,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:48:05,987 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:48:05,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:05,988 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:48:05,988 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:48:05,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:48:05,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:48:05,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:48:05,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:48:05,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:48:05,992 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:48:05,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:05,992 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:48:05,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:48:05,992 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:48:05,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:48:05,993 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:05,993 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:48:05,993 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:05,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:05,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1896396296, now seen corresponding path program 31 times [2019-08-05 10:48:05,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:06,020 WARN L254 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 197 conjunts are in the unsatisfiable core [2019-08-05 10:48:06,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:06,816 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:48:06,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:06,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:48:06,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:48:06,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:48:06,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:48:06,818 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:48:07,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:07,752 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:48:07,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:48:07,752 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:48:07,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:07,753 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:48:07,753 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:48:07,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:48:07,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:48:07,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:48:07,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:48:07,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:48:07,757 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:48:07,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:07,757 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:48:07,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:48:07,757 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:48:07,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:48:07,758 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:07,758 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:48:07,758 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:07,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:07,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1341258943, now seen corresponding path program 32 times [2019-08-05 10:48:07,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:07,786 WARN L254 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 203 conjunts are in the unsatisfiable core [2019-08-05 10:48:07,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:08,630 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:48:08,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:08,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:48:08,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:48:08,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:48:08,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:48:08,631 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:48:09,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:09,570 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:48:09,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:48:09,570 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:48:09,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:09,571 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:48:09,571 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:48:09,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:48:09,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:48:09,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:48:09,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:48:09,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:48:09,574 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:48:09,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:09,574 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:48:09,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:48:09,575 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:48:09,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:48:09,575 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:09,575 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:48:09,575 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:09,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:09,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1370643752, now seen corresponding path program 33 times [2019-08-05 10:48:09,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:09,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:09,608 WARN L254 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 209 conjunts are in the unsatisfiable core [2019-08-05 10:48:09,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:10,952 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:48:10,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:10,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:48:10,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:48:10,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:48:10,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:48:10,954 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:48:12,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:12,053 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:48:12,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:48:12,054 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:48:12,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:12,054 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:48:12,055 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:48:12,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:48:12,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:48:12,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:48:12,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:48:12,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:48:12,058 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:48:12,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:12,058 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:48:12,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:48:12,059 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:48:12,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:48:12,059 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:12,059 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:48:12,059 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:12,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:12,060 INFO L82 PathProgramCache]: Analyzing trace with hash -459718623, now seen corresponding path program 34 times [2019-08-05 10:48:12,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:12,085 WARN L254 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 215 conjunts are in the unsatisfiable core [2019-08-05 10:48:12,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:13,095 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:48:13,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:13,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:48:13,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:48:13,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:48:13,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:48:13,096 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:48:14,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:14,216 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:48:14,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:48:14,217 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:48:14,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:14,217 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:48:14,218 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:48:14,218 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:48:14,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:48:14,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:48:14,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:48:14,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:48:14,221 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:48:14,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:14,221 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:48:14,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:48:14,221 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:48:14,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:48:14,222 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:14,222 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:48:14,222 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:14,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:14,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1366377400, now seen corresponding path program 35 times [2019-08-05 10:48:14,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:14,256 WARN L254 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 221 conjunts are in the unsatisfiable core [2019-08-05 10:48:14,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:15,669 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:48:15,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:15,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:48:15,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:48:15,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:48:15,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:48:15,671 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:48:16,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:16,832 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:48:16,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:48:16,833 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:48:16,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:16,834 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:48:16,834 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:48:16,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:48:16,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:48:16,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:48:16,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:48:16,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:48:16,837 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:48:16,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:16,838 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:48:16,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:48:16,838 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:48:16,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:48:16,838 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:16,838 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:48:16,839 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:16,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:16,839 INFO L82 PathProgramCache]: Analyzing trace with hash 591971585, now seen corresponding path program 36 times [2019-08-05 10:48:16,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:16,870 WARN L254 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 227 conjunts are in the unsatisfiable core [2019-08-05 10:48:16,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:17,928 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:48:17,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:17,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:48:17,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:48:17,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:48:17,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:48:17,930 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:48:19,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:19,134 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:48:19,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:48:19,135 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:48:19,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:19,136 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:48:19,136 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:48:19,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:48:19,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:48:19,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:48:19,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:48:19,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:48:19,139 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:48:19,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:19,140 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:48:19,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:48:19,140 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:48:19,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:48:19,140 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:19,140 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:48:19,141 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:19,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:19,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1171247976, now seen corresponding path program 37 times [2019-08-05 10:48:19,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:19,170 WARN L254 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 233 conjunts are in the unsatisfiable core [2019-08-05 10:48:19,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:20,435 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:48:20,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:20,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:48:20,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:48:20,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:48:20,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:48:20,436 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:48:21,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:21,711 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:48:21,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:48:21,712 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:48:21,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:21,712 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:48:21,713 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:48:21,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:48:21,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:48:21,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:48:21,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:48:21,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:48:21,716 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:48:21,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:21,716 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:48:21,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:48:21,716 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:48:21,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:48:21,717 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:21,717 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:48:21,717 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:21,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:21,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1948946913, now seen corresponding path program 38 times [2019-08-05 10:48:21,718 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:21,753 WARN L254 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 239 conjunts are in the unsatisfiable core [2019-08-05 10:48:21,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:22,870 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:48:22,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:22,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:48:22,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:48:22,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:48:22,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:48:22,871 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:48:24,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:24,233 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:48:24,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:48:24,234 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:48:24,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:24,235 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:48:24,235 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:48:24,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:48:24,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:48:24,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:48:24,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:48:24,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:48:24,239 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:48:24,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:24,239 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:48:24,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:48:24,239 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:48:24,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:48:24,240 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:24,240 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:48:24,240 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:24,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:24,240 INFO L82 PathProgramCache]: Analyzing trace with hash 287810184, now seen corresponding path program 39 times [2019-08-05 10:48:24,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:24,280 WARN L254 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 245 conjunts are in the unsatisfiable core [2019-08-05 10:48:24,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:25,523 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:48:25,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:25,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:48:25,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:48:25,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:48:25,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:48:25,525 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:48:26,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:26,933 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:48:26,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:48:26,933 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:48:26,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:26,934 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:48:26,934 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:48:26,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:48:26,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:48:26,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:48:26,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:48:26,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:48:26,937 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:48:26,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:26,937 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:48:26,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:48:26,937 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:48:26,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:48:26,938 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:26,938 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:48:26,938 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:26,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:26,938 INFO L82 PathProgramCache]: Analyzing trace with hash 332179137, now seen corresponding path program 40 times [2019-08-05 10:48:26,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:26,972 WARN L254 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 251 conjunts are in the unsatisfiable core [2019-08-05 10:48:26,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:28,180 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:48:28,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:28,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:48:28,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:48:28,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:48:28,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:48:28,182 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:48:29,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:29,802 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:48:29,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:48:29,803 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:48:29,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:29,804 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:48:29,804 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:48:29,804 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:48:29,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:48:29,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:48:29,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:48:29,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:48:29,806 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:48:29,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:29,806 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:48:29,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:48:29,806 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:48:29,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:48:29,807 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:29,807 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:48:29,807 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:29,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:29,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1707616680, now seen corresponding path program 41 times [2019-08-05 10:48:29,808 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:29,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:29,846 WARN L254 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 257 conjunts are in the unsatisfiable core [2019-08-05 10:48:29,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:31,353 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:48:31,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:31,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:48:31,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:48:31,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:48:31,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:48:31,355 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:48:32,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:32,924 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:48:32,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:48:32,924 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:48:32,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:32,925 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:48:32,925 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:48:32,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:48:32,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:48:32,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:48:32,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:48:32,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:48:32,928 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:48:32,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:32,928 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:48:32,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:48:32,929 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:48:32,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:48:32,929 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:32,929 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:48:32,929 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:32,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:32,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1396507553, now seen corresponding path program 42 times [2019-08-05 10:48:32,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:32,970 WARN L254 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 263 conjunts are in the unsatisfiable core [2019-08-05 10:48:32,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:34,426 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:48:34,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:34,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:48:34,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:48:34,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:48:34,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:48:34,428 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:48:36,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:36,090 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:48:36,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:48:36,091 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:48:36,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:36,091 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:48:36,091 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:48:36,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:48:36,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:48:36,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:48:36,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:48:36,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:48:36,095 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:48:36,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:36,096 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:48:36,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:48:36,096 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:48:36,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:48:36,096 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:36,096 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:48:36,097 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:36,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:36,097 INFO L82 PathProgramCache]: Analyzing trace with hash 342059208, now seen corresponding path program 43 times [2019-08-05 10:48:36,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:36,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:36,132 WARN L254 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 269 conjunts are in the unsatisfiable core [2019-08-05 10:48:36,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:37,496 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:48:37,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:37,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:48:37,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:48:37,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:48:37,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:48:37,498 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:48:39,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:39,195 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:48:39,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:48:39,195 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:48:39,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:39,196 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:48:39,196 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:48:39,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:48:39,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:48:39,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:48:39,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:48:39,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:48:39,199 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:48:39,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:39,200 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:48:39,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:48:39,200 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:48:39,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:48:39,201 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:39,201 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:48:39,201 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:39,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:39,201 INFO L82 PathProgramCache]: Analyzing trace with hash 2013898881, now seen corresponding path program 44 times [2019-08-05 10:48:39,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:39,252 WARN L254 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 275 conjunts are in the unsatisfiable core [2019-08-05 10:48:39,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:40,959 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:48:40,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:40,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:48:40,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:48:40,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:48:40,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:48:40,960 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:48:42,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:42,713 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:48:42,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:48:42,714 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:48:42,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:42,715 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:48:42,715 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:48:42,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:48:42,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:48:42,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:48:42,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:48:42,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:48:42,718 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:48:42,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:42,718 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:48:42,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:48:42,719 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:48:42,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:48:42,719 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:42,719 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:48:42,719 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:42,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:42,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1993646104, now seen corresponding path program 45 times [2019-08-05 10:48:42,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:42,769 WARN L254 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 281 conjunts are in the unsatisfiable core [2019-08-05 10:48:42,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:44,644 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:48:44,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:44,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:48:44,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:48:44,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:48:44,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:48:44,645 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:48:46,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:46,536 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:48:46,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:48:46,536 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:48:46,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:46,537 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:48:46,537 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:48:46,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:48:46,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:48:46,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:48:46,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:48:46,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:48:46,540 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:48:46,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:46,540 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:48:46,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:48:46,540 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:48:46,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:48:46,541 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:46,541 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:48:46,541 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:46,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:46,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1673489055, now seen corresponding path program 46 times [2019-08-05 10:48:46,542 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:46,585 WARN L254 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 287 conjunts are in the unsatisfiable core [2019-08-05 10:48:46,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:48,083 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:48:48,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:48,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:48:48,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:48:48,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:48:48,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:48:48,085 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:48:50,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:50,012 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:48:50,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:48:50,013 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:48:50,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:50,013 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:48:50,014 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:48:50,014 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:48:50,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:48:50,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:48:50,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:48:50,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:48:50,016 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:48:50,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:50,016 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:48:50,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:48:50,016 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:48:50,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:48:50,017 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:50,017 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:48:50,017 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:50,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:50,017 INFO L82 PathProgramCache]: Analyzing trace with hash -338555128, now seen corresponding path program 47 times [2019-08-05 10:48:50,018 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:50,065 WARN L254 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 293 conjunts are in the unsatisfiable core [2019-08-05 10:48:50,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:52,054 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:48:52,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:52,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:48:52,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:48:52,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:48:52,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:48:52,055 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:48:54,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:54,054 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:48:54,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:48:54,055 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:48:54,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:54,055 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:48:54,056 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:48:54,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:48:54,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:48:54,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:48:54,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:48:54,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:48:54,058 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:48:54,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:54,059 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:48:54,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:48:54,059 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:48:54,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:48:54,059 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:54,059 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:48:54,060 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:54,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:54,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1905276351, now seen corresponding path program 48 times [2019-08-05 10:48:54,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:54,109 WARN L254 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 299 conjunts are in the unsatisfiable core [2019-08-05 10:48:54,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:55,842 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:48:55,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:55,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:48:55,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:48:55,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:48:55,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:48:55,843 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:48:57,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:57,973 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:48:57,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:48:57,974 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:48:57,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:57,975 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:48:57,975 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:48:57,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:48:57,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:48:57,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:48:57,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:48:57,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:48:57,978 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:48:57,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:57,979 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:48:57,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:48:57,979 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:48:57,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:48:57,979 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:57,979 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:48:57,980 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:57,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:57,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1065973288, now seen corresponding path program 49 times [2019-08-05 10:48:57,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:58,035 WARN L254 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 305 conjunts are in the unsatisfiable core [2019-08-05 10:48:58,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:58,295 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:49:00,425 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:49:00,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:00,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:49:00,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:49:00,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:49:00,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:49:00,426 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:49:02,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:02,699 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:49:02,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:49:02,701 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:49:02,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:02,701 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:49:02,702 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:49:02,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:49:02,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:49:02,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:49:02,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:49:02,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:49:02,705 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:49:02,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:02,705 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:49:02,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:49:02,705 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:49:02,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:49:02,706 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:02,706 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:49:02,706 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:02,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:02,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1314568415, now seen corresponding path program 50 times [2019-08-05 10:49:02,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:02,759 WARN L254 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 311 conjunts are in the unsatisfiable core [2019-08-05 10:49:02,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:04,481 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:49:04,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:04,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:49:04,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:49:04,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:49:04,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:49:04,483 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 10:49:06,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:06,835 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:49:06,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:49:06,836 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:49:06,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:06,837 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:49:06,837 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:49:06,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:49:06,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:49:06,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:49:06,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:49:06,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:49:06,840 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:49:06,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:06,840 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:49:06,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:49:06,840 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:49:06,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:49:06,841 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:06,841 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:49:06,841 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:06,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:06,841 INFO L82 PathProgramCache]: Analyzing trace with hash -2096917176, now seen corresponding path program 51 times [2019-08-05 10:49:06,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:06,896 WARN L254 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 317 conjunts are in the unsatisfiable core [2019-08-05 10:49:06,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:08,728 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:49:08,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:08,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:49:08,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:49:08,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:49:08,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:49:08,729 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 10:49:11,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:11,141 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:49:11,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:49:11,142 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:49:11,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:11,142 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:49:11,142 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:49:11,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:49:11,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:49:11,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:49:11,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:49:11,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:49:11,145 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:49:11,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:11,145 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:49:11,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:49:11,145 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:49:11,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:49:11,146 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:11,146 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:49:11,146 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:11,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:11,146 INFO L82 PathProgramCache]: Analyzing trace with hash -579924991, now seen corresponding path program 52 times [2019-08-05 10:49:11,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:11,186 WARN L254 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 323 conjunts are in the unsatisfiable core [2019-08-05 10:49:11,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:13,057 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:49:13,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:13,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:49:13,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:49:13,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:49:13,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:49:13,058 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 10:49:15,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:15,482 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:49:15,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:49:15,482 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:49:15,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:15,483 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:49:15,483 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:49:15,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:49:15,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:49:15,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:49:15,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:49:15,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:49:15,487 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:49:15,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:15,487 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:49:15,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:49:15,487 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:49:15,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:49:15,488 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:15,488 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:49:15,488 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:15,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:15,489 INFO L82 PathProgramCache]: Analyzing trace with hash -797807512, now seen corresponding path program 53 times [2019-08-05 10:49:15,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:15,547 WARN L254 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 329 conjunts are in the unsatisfiable core [2019-08-05 10:49:15,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:17,644 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:49:17,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:17,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:49:17,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:49:17,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:49:17,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:49:17,645 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 10:49:20,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:20,153 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:49:20,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:49:20,154 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:49:20,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:20,155 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:49:20,155 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:49:20,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:49:20,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:49:20,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:49:20,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:49:20,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:49:20,157 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:49:20,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:20,157 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:49:20,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:49:20,157 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:49:20,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:49:20,157 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:20,158 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:49:20,158 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:20,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:20,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1037768929, now seen corresponding path program 54 times [2019-08-05 10:49:20,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:20,200 WARN L254 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 335 conjunts are in the unsatisfiable core [2019-08-05 10:49:20,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:22,471 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:49:22,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:22,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:49:22,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:49:22,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:49:22,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:49:22,473 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 10:49:25,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:25,058 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:49:25,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:49:25,059 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:49:25,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:25,060 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:49:25,060 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:49:25,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:49:25,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:49:25,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:49:25,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:49:25,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:49:25,062 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:49:25,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:25,063 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:49:25,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:49:25,063 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:49:25,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:49:25,063 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:25,064 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:49:25,064 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:25,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:25,064 INFO L82 PathProgramCache]: Analyzing trace with hash 2106063752, now seen corresponding path program 55 times [2019-08-05 10:49:25,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:25,119 WARN L254 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 341 conjunts are in the unsatisfiable core [2019-08-05 10:49:25,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:27,428 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:49:27,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:27,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:49:27,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:49:27,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:49:27,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:49:27,429 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 10:49:30,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:30,157 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:49:30,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:49:30,158 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:49:30,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:30,159 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:49:30,159 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:49:30,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:49:30,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:49:30,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:49:30,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:49:30,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:49:30,162 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:49:30,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:30,162 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:49:30,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:49:30,162 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:49:30,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:49:30,163 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:30,163 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:49:30,163 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:30,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:30,163 INFO L82 PathProgramCache]: Analyzing trace with hash 863464897, now seen corresponding path program 56 times [2019-08-05 10:49:30,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:30,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:30,212 WARN L254 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 347 conjunts are in the unsatisfiable core [2019-08-05 10:49:30,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:32,559 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:49:32,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:32,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:49:32,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:49:32,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:49:32,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:49:32,560 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:49:35,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:35,330 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:49:35,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:49:35,331 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:49:35,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:35,332 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:49:35,332 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:49:35,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:49:35,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:49:35,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:49:35,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:49:35,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:49:35,335 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:49:35,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:35,335 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:49:35,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:49:35,336 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:49:35,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:49:35,336 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:35,336 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:49:35,337 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:35,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:35,337 INFO L82 PathProgramCache]: Analyzing trace with hash 997606056, now seen corresponding path program 57 times [2019-08-05 10:49:35,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:35,389 WARN L254 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 353 conjunts are in the unsatisfiable core [2019-08-05 10:49:35,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:37,683 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:49:37,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:37,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:49:37,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:49:37,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:49:37,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:49:37,685 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:49:40,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:40,587 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:49:40,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:49:40,588 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:49:40,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:40,589 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:49:40,589 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:49:40,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:49:40,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:49:40,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:49:40,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:49:40,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:49:40,592 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:49:40,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:40,593 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:49:40,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:49:40,593 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:49:40,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:49:40,593 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:40,593 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:49:40,594 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:40,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:40,594 INFO L82 PathProgramCache]: Analyzing trace with hash 861014689, now seen corresponding path program 58 times [2019-08-05 10:49:40,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:40,641 WARN L254 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 359 conjunts are in the unsatisfiable core [2019-08-05 10:49:40,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:43,015 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:49:43,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:43,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:49:43,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:49:43,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:49:43,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:49:43,016 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 10:49:45,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:45,988 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:49:45,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:49:45,989 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:49:45,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:45,989 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:49:45,990 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:49:45,990 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:49:45,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:49:45,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:49:45,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:49:45,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:49:45,992 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:49:45,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:45,993 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:49:45,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:49:45,993 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:49:45,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:49:45,994 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:45,994 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:49:45,994 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:45,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:45,994 INFO L82 PathProgramCache]: Analyzing trace with hash 921649608, now seen corresponding path program 59 times [2019-08-05 10:49:45,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:46,052 WARN L254 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 365 conjunts are in the unsatisfiable core [2019-08-05 10:49:46,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:49,045 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:49:49,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:49,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:49:49,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:49:49,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:49:49,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:49:49,046 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 10:49:52,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:52,092 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:49:52,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:49:52,093 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:49:52,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:52,093 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:49:52,094 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:49:52,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:49:52,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:49:52,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:49:52,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:49:52,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:49:52,096 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:49:52,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:52,096 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:49:52,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:49:52,097 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:49:52,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:49:52,097 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:52,097 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:49:52,097 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:52,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:52,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1493635199, now seen corresponding path program 60 times [2019-08-05 10:49:52,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:52,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:52,149 WARN L254 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 371 conjunts are in the unsatisfiable core [2019-08-05 10:49:52,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:52,766 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:49:55,413 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:49:55,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:55,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:49:55,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:49:55,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:49:55,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:49:55,415 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 10:49:58,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:58,565 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:49:58,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:49:58,566 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:49:58,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:58,566 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:49:58,567 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:49:58,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:49:58,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:49:58,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:49:58,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:49:58,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:49:58,569 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:49:58,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:58,569 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:49:58,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:49:58,570 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:49:58,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:49:58,570 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:58,570 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:49:58,571 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:58,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:58,571 INFO L82 PathProgramCache]: Analyzing trace with hash 941947112, now seen corresponding path program 61 times [2019-08-05 10:49:58,572 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:58,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:58,629 WARN L254 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 377 conjunts are in the unsatisfiable core [2019-08-05 10:49:58,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:01,109 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:50:01,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:01,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:50:01,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:50:01,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:50:01,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:50:01,110 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 10:50:04,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:04,365 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:50:04,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:50:04,365 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:50:04,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:04,366 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:50:04,366 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:50:04,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:50:04,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:50:04,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:50:04,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:50:04,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:50:04,369 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:50:04,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:04,369 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:50:04,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:50:04,369 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:50:04,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:50:04,369 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:04,370 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:50:04,370 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:04,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:04,370 INFO L82 PathProgramCache]: Analyzing trace with hash -864412575, now seen corresponding path program 62 times [2019-08-05 10:50:04,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:04,432 WARN L254 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 383 conjunts are in the unsatisfiable core [2019-08-05 10:50:04,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:06,963 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:50:06,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:06,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:50:06,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:50:06,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:50:06,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:50:06,964 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 10:50:10,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:10,486 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:50:10,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:50:10,487 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 10:50:10,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:10,488 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:50:10,488 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:50:10,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:50:10,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:50:10,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:50:10,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:50:10,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:50:10,491 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:50:10,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:10,491 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:50:10,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:50:10,491 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:50:10,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:50:10,491 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:10,492 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:50:10,492 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:10,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:10,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1026988024, now seen corresponding path program 63 times [2019-08-05 10:50:10,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:10,563 WARN L254 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 389 conjunts are in the unsatisfiable core [2019-08-05 10:50:10,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:13,504 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:50:13,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:13,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:50:13,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:50:13,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:50:13,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:50:13,506 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 10:50:16,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:16,993 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:50:16,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:50:16,994 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:50:16,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:16,994 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:50:16,994 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:50:16,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:50:16,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:50:16,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:50:16,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:50:16,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:50:16,998 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:50:16,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:16,998 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:50:16,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:50:16,998 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:50:16,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:50:16,999 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:16,999 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:50:16,999 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:16,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:17,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1771859647, now seen corresponding path program 64 times [2019-08-05 10:50:17,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:17,058 WARN L254 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 395 conjunts are in the unsatisfiable core [2019-08-05 10:50:17,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:19,889 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:50:19,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:19,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:50:19,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:50:19,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:50:19,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:50:19,890 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:50:23,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:23,516 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:50:23,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:50:23,517 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:50:23,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:23,518 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:50:23,518 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:50:23,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:50:23,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:50:23,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:50:23,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:50:23,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:50:23,520 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:50:23,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:23,521 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:50:23,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:50:23,521 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:50:23,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:50:23,521 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:23,521 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:50:23,522 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:23,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:23,522 INFO L82 PathProgramCache]: Analyzing trace with hash 906923816, now seen corresponding path program 65 times [2019-08-05 10:50:23,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:23,589 WARN L254 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 401 conjunts are in the unsatisfiable core [2019-08-05 10:50:23,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:26,471 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:50:26,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:26,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:50:26,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:50:26,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:50:26,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:50:26,472 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:50:30,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:30,221 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:50:30,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:50:30,221 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:50:30,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:30,222 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:50:30,222 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:50:30,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:50:30,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:50:30,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:50:30,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:50:30,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:50:30,225 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:50:30,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:30,225 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:50:30,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:50:30,225 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:50:30,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:50:30,226 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:30,226 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:50:30,226 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:30,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:30,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1950134751, now seen corresponding path program 66 times [2019-08-05 10:50:30,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:30,289 WARN L254 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 407 conjunts are in the unsatisfiable core [2019-08-05 10:50:30,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:31,605 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:50:33,714 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:50:33,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:33,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:50:33,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:50:33,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:50:33,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:50:33,716 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 10:50:37,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:37,519 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:50:37,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:50:37,520 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 10:50:37,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:37,520 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:50:37,521 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:50:37,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:50:37,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:50:37,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:50:37,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:50:37,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:50:37,523 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:50:37,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:37,524 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:50:37,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:50:37,524 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:50:37,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:50:37,525 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:37,525 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:50:37,525 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:37,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:37,526 INFO L82 PathProgramCache]: Analyzing trace with hash -324637112, now seen corresponding path program 67 times [2019-08-05 10:50:37,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:37,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:37,589 WARN L254 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 413 conjunts are in the unsatisfiable core [2019-08-05 10:50:37,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:40,695 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:50:40,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:40,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:50:40,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:50:40,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:50:40,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:50:40,696 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 10:50:44,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:44,759 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:50:44,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:50:44,759 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:50:44,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:44,760 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:50:44,760 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:50:44,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:50:44,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:50:44,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:50:44,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:50:44,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:50:44,763 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:50:44,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:44,763 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:50:44,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:50:44,763 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:50:44,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:50:44,763 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:44,763 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:50:44,764 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:44,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:44,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1473817855, now seen corresponding path program 68 times [2019-08-05 10:50:44,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:44,839 WARN L254 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 419 conjunts are in the unsatisfiable core [2019-08-05 10:50:44,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:47,771 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:50:47,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:47,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:50:47,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:50:47,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:50:47,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:50:47,772 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 10:50:51,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:51,914 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:50:51,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:50:51,915 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 10:50:51,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:51,916 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:50:51,916 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:50:51,916 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:50:51,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:50:51,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:50:51,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:50:51,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:50:51,918 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:50:51,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:51,919 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:50:51,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:50:51,919 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:50:51,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:50:51,919 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:51,920 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:50:51,920 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:51,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:51,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1556284776, now seen corresponding path program 69 times [2019-08-05 10:50:51,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:52,015 WARN L254 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 425 conjunts are in the unsatisfiable core [2019-08-05 10:50:52,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:55,312 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:50:55,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:55,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:50:55,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:50:55,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:50:55,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:50:55,314 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 10:50:59,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:59,527 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:50:59,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:50:59,528 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:50:59,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:59,529 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:50:59,529 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:50:59,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:50:59,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:50:59,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:50:59,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:50:59,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:50:59,533 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:50:59,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:59,533 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:50:59,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:50:59,533 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:50:59,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:50:59,534 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:59,534 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:50:59,534 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:59,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:59,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1000185825, now seen corresponding path program 70 times [2019-08-05 10:50:59,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:59,689 WARN L254 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 431 conjunts are in the unsatisfiable core [2019-08-05 10:50:59,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:02,896 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:51:02,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:02,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:51:02,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:51:02,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:51:02,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:51:02,897 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 10:51:07,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:07,274 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:51:07,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:51:07,275 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 10:51:07,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:07,275 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:51:07,276 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:51:07,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:51:07,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:51:07,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:51:07,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:51:07,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:51:07,279 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:51:07,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:07,279 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:51:07,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:51:07,279 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:51:07,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:51:07,280 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:07,280 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:51:07,280 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:07,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:07,281 INFO L82 PathProgramCache]: Analyzing trace with hash 940987528, now seen corresponding path program 71 times [2019-08-05 10:51:07,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:07,372 WARN L254 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 437 conjunts are in the unsatisfiable core [2019-08-05 10:51:07,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:10,771 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:51:10,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:10,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:51:10,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:51:10,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:51:10,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:51:10,772 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 10:51:15,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:15,270 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:51:15,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:51:15,271 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:51:15,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:15,272 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:51:15,272 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:51:15,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:51:15,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:51:15,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:51:15,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:51:15,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:51:15,275 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:51:15,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:15,275 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:51:15,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:51:15,275 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:51:15,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:51:15,276 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:15,276 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:51:15,276 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:15,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:15,277 INFO L82 PathProgramCache]: Analyzing trace with hash -894159679, now seen corresponding path program 72 times [2019-08-05 10:51:15,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:15,389 WARN L254 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 443 conjunts are in the unsatisfiable core [2019-08-05 10:51:15,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:18,665 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:51:18,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:18,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:51:18,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:51:18,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:51:18,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:51:18,666 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:51:23,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:23,325 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:51:23,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:51:23,326 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:51:23,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:23,327 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:51:23,327 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:51:23,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:51:23,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:51:23,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:51:23,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:51:23,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:51:23,330 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:51:23,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:23,330 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:51:23,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:51:23,330 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:51:23,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:51:23,330 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:23,331 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:51:23,331 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:23,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:23,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1949148248, now seen corresponding path program 73 times [2019-08-05 10:51:23,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:23,414 WARN L254 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 449 conjunts are in the unsatisfiable core [2019-08-05 10:51:23,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:27,033 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:51:27,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:27,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:51:27,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:51:27,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:51:27,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:51:27,034 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 10:51:31,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:31,670 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:51:31,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:51:31,671 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:51:31,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:31,671 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:51:31,672 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:51:31,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:51:31,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:51:31,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:51:31,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:51:31,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:51:31,675 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:51:31,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:31,675 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:51:31,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:51:31,675 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:51:31,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:51:31,676 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:31,676 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:51:31,676 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:31,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:31,677 INFO L82 PathProgramCache]: Analyzing trace with hash -294055519, now seen corresponding path program 74 times [2019-08-05 10:51:31,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:31,812 WARN L254 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 455 conjunts are in the unsatisfiable core [2019-08-05 10:51:31,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:35,587 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:51:35,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:35,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:51:35,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:51:35,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:51:35,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:51:35,588 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 10:51:40,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:40,412 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:51:40,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:51:40,413 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 10:51:40,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:40,414 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:51:40,414 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:51:40,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:51:40,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:51:40,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:51:40,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:51:40,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:51:40,417 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:51:40,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:40,417 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:51:40,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:51:40,418 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:51:40,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:51:40,418 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:40,418 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:51:40,418 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:40,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:40,419 INFO L82 PathProgramCache]: Analyzing trace with hash -525788472, now seen corresponding path program 75 times [2019-08-05 10:51:40,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:40,501 WARN L254 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 461 conjunts are in the unsatisfiable core [2019-08-05 10:51:40,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:44,059 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:51:44,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:44,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:51:44,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:51:44,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:51:44,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:51:44,060 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 10:51:49,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:49,110 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:51:49,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:51:49,110 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:51:49,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:49,111 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:51:49,111 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:51:49,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:51:49,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:51:49,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:51:49,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:51:49,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:51:49,114 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:51:49,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:49,114 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:51:49,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:51:49,114 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:51:49,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:51:49,115 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:49,115 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:51:49,115 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:49,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:49,116 INFO L82 PathProgramCache]: Analyzing trace with hash 880424577, now seen corresponding path program 76 times [2019-08-05 10:51:49,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:49,202 WARN L254 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 467 conjunts are in the unsatisfiable core [2019-08-05 10:51:49,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:51:51,820 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:51:51,820 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:51:51,824 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:51:51,825 INFO L202 PluginConnector]: Adding new model jm2006_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:51:51 BoogieIcfgContainer [2019-08-05 10:51:51,825 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:51:51,826 INFO L168 Benchmark]: Toolchain (without parser) took 254954.31 ms. Allocated memory was 141.0 MB in the beginning and 234.9 MB in the end (delta: 93.8 MB). Free memory was 109.3 MB in the beginning and 56.5 MB in the end (delta: 52.8 MB). Peak memory consumption was 146.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:51:51,828 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 141.0 MB. Free memory was 110.5 MB in the beginning and 110.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-08-05 10:51:51,829 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.37 ms. Allocated memory is still 141.0 MB. Free memory was 109.1 MB in the beginning and 107.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:51:51,829 INFO L168 Benchmark]: Boogie Preprocessor took 20.17 ms. Allocated memory is still 141.0 MB. Free memory was 107.5 MB in the beginning and 106.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:51:51,830 INFO L168 Benchmark]: RCFGBuilder took 359.31 ms. Allocated memory is still 141.0 MB. Free memory was 106.3 MB in the beginning and 96.4 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:51:51,831 INFO L168 Benchmark]: TraceAbstraction took 254534.01 ms. Allocated memory was 141.0 MB in the beginning and 234.9 MB in the end (delta: 93.8 MB). Free memory was 96.2 MB in the beginning and 56.5 MB in the end (delta: 39.7 MB). Peak memory consumption was 133.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:51:51,834 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 141.0 MB. Free memory was 110.5 MB in the beginning and 110.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 33.37 ms. Allocated memory is still 141.0 MB. Free memory was 109.1 MB in the beginning and 107.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.17 ms. Allocated memory is still 141.0 MB. Free memory was 107.5 MB in the beginning and 106.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 359.31 ms. Allocated memory is still 141.0 MB. Free memory was 106.3 MB in the beginning and 96.4 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 254534.01 ms. Allocated memory was 141.0 MB in the beginning and 234.9 MB in the end (delta: 93.8 MB). Free memory was 96.2 MB in the beginning and 56.5 MB in the end (delta: 39.7 MB). Peak memory consumption was 133.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 58). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 76,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 63 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 254.4s OverallTime, 77 OverallIterations, 76 TraceHistogramMax, 132.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 228 SDtfs, 0 SDslu, 2926 SDs, 0 SdLazy, 155078 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 112.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3002 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 2926 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 113.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=76, 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.1s AutomataMinimizationTime, 76 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 115.6s InterpolantComputationTime, 3078 NumberOfCodeBlocks, 3078 NumberOfCodeBlocksAsserted, 76 NumberOfCheckSat, 3002 ConstructedInterpolants, 0 QuantifiedInterpolants, 2121152 SizeOfPredicates, 380 NumberOfNonLiveVariables, 22306 ConjunctsInSsa, 17936 ConjunctsInUnsatCore, 76 InterpolantComputations, 1 PerfectInterpolantSequences, 0/73150 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown