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/20170304-DifficultPathPrograms/jm2006_variant.c.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:35:33,798 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:35:33,800 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:35:33,815 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:35:33,816 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:35:33,817 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:35:33,819 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:35:33,821 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:35:33,824 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:35:33,825 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:35:33,832 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:35:33,833 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:35:33,834 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:35:33,835 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:35:33,838 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:35:33,839 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:35:33,841 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:35:33,842 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:35:33,845 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:35:33,849 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:35:33,851 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:35:33,852 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:35:33,853 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:35:33,854 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:35:33,856 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:35:33,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:35:33,856 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:35:33,857 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:35:33,857 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:35:33,858 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:35:33,858 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:35:33,859 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:35:33,860 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:35:33,861 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:35:33,863 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:35:33,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:35:33,864 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:35:33,865 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:35:33,865 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:35:33,866 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:35:33,866 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:35:33,907 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:35:33,922 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:35:33,927 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:35:33,929 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:35:33,929 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:35:33,930 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/jm2006_variant.c.i_3.bpl [2019-08-04 21:35:33,931 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/jm2006_variant.c.i_3.bpl' [2019-08-04 21:35:33,972 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:35:33,974 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:35:33,975 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:35:33,975 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:35:33,975 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:35:33,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "jm2006_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:35:33" (1/1) ... [2019-08-04 21:35:34,002 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "jm2006_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:35:33" (1/1) ... [2019-08-04 21:35:34,010 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:35:34,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:35:34,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:35:34,011 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:35:34,022 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "jm2006_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:35:33" (1/1) ... [2019-08-04 21:35:34,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "jm2006_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:35:33" (1/1) ... [2019-08-04 21:35:34,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "jm2006_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:35:33" (1/1) ... [2019-08-04 21:35:34,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "jm2006_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:35:33" (1/1) ... [2019-08-04 21:35:34,027 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "jm2006_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:35:33" (1/1) ... [2019-08-04 21:35:34,029 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "jm2006_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:35:33" (1/1) ... [2019-08-04 21:35:34,030 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "jm2006_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:35:33" (1/1) ... [2019-08-04 21:35:34,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:35:34,032 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:35:34,032 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:35:34,032 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:35:34,033 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "jm2006_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:35:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-04 21:35:34,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-04 21:35:34,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-04 21:35:34,277 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-04 21:35:34,278 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-04 21:35:34,279 INFO L202 PluginConnector]: Adding new model jm2006_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:35:34 BoogieIcfgContainer [2019-08-04 21:35:34,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:35:34,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:35:34,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:35:34,284 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:35:34,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "jm2006_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:35:33" (1/2) ... [2019-08-04 21:35:34,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a6f0487 and model type jm2006_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:35:34, skipping insertion in model container [2019-08-04 21:35:34,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "jm2006_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:35:34" (2/2) ... [2019-08-04 21:35:34,287 INFO L109 eAbstractionObserver]: Analyzing ICFG jm2006_variant.c.i_3.bpl [2019-08-04 21:35:34,297 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:35:34,304 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-04 21:35:34,320 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-04 21:35:34,349 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:35:34,350 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:35:34,350 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:35:34,350 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:35:34,350 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:35:34,350 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:35:34,350 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:35:34,351 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:35:34,351 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:35:34,362 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-04 21:35:34,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-04 21:35:34,370 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:34,371 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-04 21:35:34,374 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:34,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:34,380 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-04 21:35:34,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:34,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-04 21:35:34,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:34,609 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-04 21:35:34,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:35:34,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-04 21:35:34,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:35:34,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:35:34,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:35:34,634 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-04 21:35:34,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:34,675 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-04 21:35:34,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:35:34,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-04 21:35:34,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:34,688 INFO L225 Difference]: With dead ends: 5 [2019-08-04 21:35:34,688 INFO L226 Difference]: Without dead ends: 5 [2019-08-04 21:35:34,690 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-04 21:35:34,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-04 21:35:34,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-04 21:35:34,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-04 21:35:34,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-04 21:35:34,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-04 21:35:34,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:34,724 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-04 21:35:34,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:35:34,725 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-04 21:35:34,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-04 21:35:34,725 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:34,725 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-04 21:35:34,726 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:34,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:34,726 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-04 21:35:34,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:34,751 WARN L254 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-04 21:35:34,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:34,911 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-04 21:35:34,999 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-04 21:35:34,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:35,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-04 21:35:35,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:35:35,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:35:35,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:35:35,002 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-04 21:35:35,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:35,068 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-04 21:35:35,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:35:35,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-04 21:35:35,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:35,070 INFO L225 Difference]: With dead ends: 6 [2019-08-04 21:35:35,070 INFO L226 Difference]: Without dead ends: 6 [2019-08-04 21:35:35,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:35:35,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-04 21:35:35,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-04 21:35:35,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-04 21:35:35,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-04 21:35:35,073 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-04 21:35:35,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:35,074 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-04 21:35:35,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:35:35,074 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-04 21:35:35,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-04 21:35:35,075 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:35,075 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-04 21:35:35,075 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:35,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:35,076 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-04 21:35:35,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:35,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:35,100 WARN L254 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-04 21:35:35,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:35,239 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-04 21:35:35,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:35,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:35:35,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:35:35,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:35:35,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:35:35,241 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-04 21:35:35,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:35,319 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-04 21:35:35,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:35:35,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-04 21:35:35,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:35,320 INFO L225 Difference]: With dead ends: 7 [2019-08-04 21:35:35,320 INFO L226 Difference]: Without dead ends: 7 [2019-08-04 21:35:35,321 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-04 21:35:35,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-04 21:35:35,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-04 21:35:35,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-04 21:35:35,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-04 21:35:35,324 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-04 21:35:35,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:35,324 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-04 21:35:35,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:35:35,324 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-04 21:35:35,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-04 21:35:35,339 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:35,339 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-04 21:35:35,339 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:35,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:35,340 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-04 21:35:35,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:35,390 WARN L254 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-04 21:35:35,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:35,704 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-04 21:35:35,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:35,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:35:35,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:35:35,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:35:35,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:35:35,706 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-04 21:35:35,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:35,753 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-04 21:35:35,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:35:35,754 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-04 21:35:35,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:35,755 INFO L225 Difference]: With dead ends: 8 [2019-08-04 21:35:35,755 INFO L226 Difference]: Without dead ends: 8 [2019-08-04 21:35:35,756 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-04 21:35:35,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-04 21:35:35,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-04 21:35:35,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-04 21:35:35,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-04 21:35:35,758 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-04 21:35:35,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:35,759 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-04 21:35:35,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:35:35,759 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-04 21:35:35,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:35:35,760 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:35,760 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-04 21:35:35,760 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:35,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:35,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-04 21:35:35,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:35,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:35,786 WARN L254 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-04 21:35:35,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:36,111 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-04 21:35:36,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:36,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:35:36,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:35:36,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:35:36,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:35:36,114 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-04 21:35:36,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:36,156 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-04 21:35:36,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:35:36,162 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-04 21:35:36,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:36,163 INFO L225 Difference]: With dead ends: 9 [2019-08-04 21:35:36,163 INFO L226 Difference]: Without dead ends: 9 [2019-08-04 21:35:36,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:35:36,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-04 21:35:36,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-04 21:35:36,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-04 21:35:36,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-04 21:35:36,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-04 21:35:36,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:36,167 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-04 21:35:36,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:35:36,167 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-04 21:35:36,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-04 21:35:36,168 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:36,168 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-04 21:35:36,168 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:36,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:36,168 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-04 21:35:36,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:36,215 WARN L254 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-04 21:35:36,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:36,390 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-04 21:35:36,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:36,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:35:36,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:35:36,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:35:36,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:35:36,396 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-04 21:35:36,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:36,517 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-04 21:35:36,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:35:36,518 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-04 21:35:36,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:36,519 INFO L225 Difference]: With dead ends: 10 [2019-08-04 21:35:36,519 INFO L226 Difference]: Without dead ends: 10 [2019-08-04 21:35:36,520 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-04 21:35:36,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-04 21:35:36,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-04 21:35:36,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-04 21:35:36,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-04 21:35:36,523 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-04 21:35:36,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:36,523 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-04 21:35:36,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:35:36,523 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-04 21:35:36,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-04 21:35:36,524 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:36,524 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-04 21:35:36,524 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:36,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:36,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-04 21:35:36,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:36,550 WARN L254 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-04 21:35:36,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:37,021 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-04 21:35:37,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:37,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:35:37,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:35:37,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:35:37,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:35:37,023 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-04 21:35:37,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:37,149 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-04 21:35:37,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:35:37,150 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-04 21:35:37,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:37,150 INFO L225 Difference]: With dead ends: 11 [2019-08-04 21:35:37,151 INFO L226 Difference]: Without dead ends: 11 [2019-08-04 21:35:37,151 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-04 21:35:37,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-04 21:35:37,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-04 21:35:37,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-04 21:35:37,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-04 21:35:37,154 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-04 21:35:37,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:37,155 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-04 21:35:37,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:35:37,155 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-04 21:35:37,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:35:37,156 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:37,156 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-04 21:35:37,156 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:37,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:37,156 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-04 21:35:37,157 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:37,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:37,179 WARN L254 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-04 21:35:37,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:37,455 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-04 21:35:37,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:37,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:35:37,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:35:37,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:35:37,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:35:37,457 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-04 21:35:37,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:37,605 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-04 21:35:37,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:35:37,605 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-04 21:35:37,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:37,606 INFO L225 Difference]: With dead ends: 12 [2019-08-04 21:35:37,606 INFO L226 Difference]: Without dead ends: 12 [2019-08-04 21:35:37,606 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-04 21:35:37,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-04 21:35:37,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-04 21:35:37,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-04 21:35:37,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-04 21:35:37,609 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-04 21:35:37,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:37,609 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-04 21:35:37,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:35:37,610 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-04 21:35:37,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-04 21:35:37,610 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:37,610 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-04 21:35:37,611 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:37,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:37,611 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-04 21:35:37,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:37,635 WARN L254 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-04 21:35:37,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:37,983 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-04 21:35:37,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:37,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-04 21:35:37,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-04 21:35:37,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-04 21:35:37,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:35:37,992 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-04 21:35:38,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:38,121 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-04 21:35:38,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:35:38,122 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-04 21:35:38,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:38,122 INFO L225 Difference]: With dead ends: 13 [2019-08-04 21:35:38,123 INFO L226 Difference]: Without dead ends: 13 [2019-08-04 21:35:38,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:35:38,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-04 21:35:38,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-04 21:35:38,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-04 21:35:38,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-04 21:35:38,126 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-04 21:35:38,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:38,127 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-04 21:35:38,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-04 21:35:38,127 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-04 21:35:38,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:35:38,128 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:38,128 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-04 21:35:38,128 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:38,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:38,128 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-04 21:35:38,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:38,152 WARN L254 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-04 21:35:38,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:38,479 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-04 21:35:38,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:38,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-04 21:35:38,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-04 21:35:38,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-04 21:35:38,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:35:38,482 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-04 21:35:38,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:38,604 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-04 21:35:38,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:35:38,605 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-04 21:35:38,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:38,606 INFO L225 Difference]: With dead ends: 14 [2019-08-04 21:35:38,606 INFO L226 Difference]: Without dead ends: 14 [2019-08-04 21:35:38,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:35:38,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-04 21:35:38,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-04 21:35:38,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-04 21:35:38,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-04 21:35:38,610 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-04 21:35:38,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:38,610 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-04 21:35:38,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-04 21:35:38,610 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-04 21:35:38,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-04 21:35:38,611 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:38,611 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-04 21:35:38,611 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:38,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:38,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-08-04 21:35:38,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:38,633 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-04 21:35:38,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:38,861 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-04 21:35:38,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:38,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-04 21:35:38,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-04 21:35:38,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-04 21:35:38,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:35:38,863 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-04 21:35:39,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:39,329 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-04 21:35:39,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:35:39,331 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-04 21:35:39,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:39,332 INFO L225 Difference]: With dead ends: 15 [2019-08-04 21:35:39,332 INFO L226 Difference]: Without dead ends: 15 [2019-08-04 21:35:39,333 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-04 21:35:39,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-04 21:35:39,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-04 21:35:39,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-04 21:35:39,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-04 21:35:39,336 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-04 21:35:39,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:39,337 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-04 21:35:39,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-04 21:35:39,338 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-04 21:35:39,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-04 21:35:39,338 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:39,338 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-04 21:35:39,338 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:39,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:39,339 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-08-04 21:35:39,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:39,363 WARN L254 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-04 21:35:39,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:39,699 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-04 21:35:39,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:39,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-04 21:35:39,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-04 21:35:39,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-04 21:35:39,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:35:39,701 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-04 21:35:39,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:39,915 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-04 21:35:39,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:35:39,915 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-04 21:35:39,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:39,916 INFO L225 Difference]: With dead ends: 16 [2019-08-04 21:35:39,916 INFO L226 Difference]: Without dead ends: 16 [2019-08-04 21:35:39,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:35:39,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-04 21:35:39,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-04 21:35:39,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-04 21:35:39,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-04 21:35:39,920 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-04 21:35:39,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:39,920 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-04 21:35:39,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-04 21:35:39,921 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-04 21:35:39,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-04 21:35:39,921 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:39,921 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-04 21:35:39,922 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:39,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:39,922 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-08-04 21:35:39,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:39,945 WARN L254 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-04 21:35:39,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:40,523 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-04 21:35:40,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:40,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-04 21:35:40,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-04 21:35:40,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-04 21:35:40,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:35:40,524 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-04 21:35:40,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:40,711 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-04 21:35:40,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:35:40,720 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-04 21:35:40,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:40,721 INFO L225 Difference]: With dead ends: 17 [2019-08-04 21:35:40,721 INFO L226 Difference]: Without dead ends: 17 [2019-08-04 21:35:40,722 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-04 21:35:40,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-04 21:35:40,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-04 21:35:40,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-04 21:35:40,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-04 21:35:40,725 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-04 21:35:40,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:40,725 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-04 21:35:40,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-04 21:35:40,725 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-04 21:35:40,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:35:40,726 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:40,726 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-04 21:35:40,726 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:40,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:40,726 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-08-04 21:35:40,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:40,760 WARN L254 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-04 21:35:40,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:41,060 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-04 21:35:41,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:41,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-04 21:35:41,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-04 21:35:41,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-04 21:35:41,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:35:41,062 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-04 21:35:41,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:41,371 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-04 21:35:41,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:35:41,372 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-04 21:35:41,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:41,373 INFO L225 Difference]: With dead ends: 18 [2019-08-04 21:35:41,373 INFO L226 Difference]: Without dead ends: 18 [2019-08-04 21:35:41,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:35:41,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-04 21:35:41,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-04 21:35:41,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-04 21:35:41,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-04 21:35:41,377 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-04 21:35:41,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:41,377 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-04 21:35:41,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-04 21:35:41,377 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-04 21:35:41,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-04 21:35:41,378 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:41,378 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-04 21:35:41,378 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:41,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:41,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-08-04 21:35:41,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:41,398 WARN L254 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-04 21:35:41,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:41,991 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-04 21:35:41,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:41,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-04 21:35:41,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-04 21:35:41,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-04 21:35:41,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:35:41,993 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-04 21:35:42,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:42,289 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-04 21:35:42,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-04 21:35:42,289 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-04 21:35:42,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:42,290 INFO L225 Difference]: With dead ends: 19 [2019-08-04 21:35:42,290 INFO L226 Difference]: Without dead ends: 19 [2019-08-04 21:35:42,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:35:42,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-04 21:35:42,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-04 21:35:42,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-04 21:35:42,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-04 21:35:42,293 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-04 21:35:42,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:42,294 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-04 21:35:42,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-04 21:35:42,294 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-04 21:35:42,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:35:42,294 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:42,295 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-04 21:35:42,295 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:42,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:42,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-08-04 21:35:42,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:42,312 WARN L254 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-04 21:35:42,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:42,792 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-04 21:35:42,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:42,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-04 21:35:42,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-04 21:35:42,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-04 21:35:42,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:35:42,794 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-04 21:35:43,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:43,099 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-04 21:35:43,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-04 21:35:43,099 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-04 21:35:43,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:43,100 INFO L225 Difference]: With dead ends: 20 [2019-08-04 21:35:43,100 INFO L226 Difference]: Without dead ends: 20 [2019-08-04 21:35:43,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:35:43,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-04 21:35:43,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-04 21:35:43,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-04 21:35:43,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-04 21:35:43,105 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-04 21:35:43,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:43,105 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-04 21:35:43,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-04 21:35:43,106 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-04 21:35:43,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-04 21:35:43,106 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:43,107 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-04 21:35:43,107 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:43,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:43,107 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-08-04 21:35:43,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:43,127 WARN L254 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-04 21:35:43,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:43,451 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-04 21:35:43,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:43,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-04 21:35:43,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-04 21:35:43,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-04 21:35:43,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:35:43,453 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-04 21:35:43,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:43,763 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-04 21:35:43,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-04 21:35:43,763 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-04 21:35:43,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:43,764 INFO L225 Difference]: With dead ends: 21 [2019-08-04 21:35:43,764 INFO L226 Difference]: Without dead ends: 21 [2019-08-04 21:35:43,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:35:43,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-04 21:35:43,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-04 21:35:43,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-04 21:35:43,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-04 21:35:43,768 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-04 21:35:43,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:43,768 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-04 21:35:43,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-04 21:35:43,768 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-04 21:35:43,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-04 21:35:43,769 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:43,769 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-04 21:35:43,769 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:43,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:43,769 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-08-04 21:35:43,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:43,789 WARN L254 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-04 21:35:43,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:44,343 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-04 21:35:44,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:44,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-04 21:35:44,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-04 21:35:44,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-04 21:35:44,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:35:44,345 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-04 21:35:44,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:44,701 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-04 21:35:44,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-04 21:35:44,702 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-04 21:35:44,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:44,703 INFO L225 Difference]: With dead ends: 22 [2019-08-04 21:35:44,703 INFO L226 Difference]: Without dead ends: 22 [2019-08-04 21:35:44,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:35:44,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-04 21:35:44,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-04 21:35:44,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-04 21:35:44,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-04 21:35:44,708 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-04 21:35:44,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:44,708 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-04 21:35:44,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-04 21:35:44,708 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-04 21:35:44,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-04 21:35:44,709 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:44,709 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-04 21:35:44,709 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:44,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:44,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-08-04 21:35:44,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:44,734 WARN L254 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 122 conjunts are in the unsatisfiable core [2019-08-04 21:35:44,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:45,244 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-04 21:35:45,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:45,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-04 21:35:45,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-04 21:35:45,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-04 21:35:45,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:35:45,246 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-04 21:35:45,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:45,652 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-04 21:35:45,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:35:45,653 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-04 21:35:45,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:45,653 INFO L225 Difference]: With dead ends: 23 [2019-08-04 21:35:45,654 INFO L226 Difference]: Without dead ends: 23 [2019-08-04 21:35:45,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:35:45,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-04 21:35:45,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-04 21:35:45,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-04 21:35:45,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-04 21:35:45,658 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-04 21:35:45,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:45,658 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-04 21:35:45,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-04 21:35:45,658 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-04 21:35:45,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-04 21:35:45,659 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:45,659 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-04 21:35:45,660 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:45,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:45,660 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-08-04 21:35:45,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:45,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:45,680 WARN L254 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 128 conjunts are in the unsatisfiable core [2019-08-04 21:35:45,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:46,099 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-04 21:35:46,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:46,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-04 21:35:46,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-04 21:35:46,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-04 21:35:46,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:35:46,101 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-04 21:35:46,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:46,615 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-04 21:35:46,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-04 21:35:46,615 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-04 21:35:46,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:46,616 INFO L225 Difference]: With dead ends: 24 [2019-08-04 21:35:46,616 INFO L226 Difference]: Without dead ends: 24 [2019-08-04 21:35:46,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:35:46,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-04 21:35:46,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-04 21:35:46,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-04 21:35:46,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-04 21:35:46,620 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-04 21:35:46,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:46,621 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-04 21:35:46,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-04 21:35:46,621 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-04 21:35:46,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-04 21:35:46,622 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:46,622 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-04 21:35:46,622 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:46,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:46,622 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-08-04 21:35:46,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:46,648 WARN L254 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 134 conjunts are in the unsatisfiable core [2019-08-04 21:35:46,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:47,210 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-04 21:35:47,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:47,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-04 21:35:47,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-04 21:35:47,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-04 21:35:47,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:35:47,212 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-04 21:35:47,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:47,712 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-04 21:35:47,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-04 21:35:47,713 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-04 21:35:47,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:47,713 INFO L225 Difference]: With dead ends: 25 [2019-08-04 21:35:47,714 INFO L226 Difference]: Without dead ends: 25 [2019-08-04 21:35:47,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:35:47,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-04 21:35:47,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-04 21:35:47,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-04 21:35:47,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-04 21:35:47,718 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-04 21:35:47,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:47,718 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-04 21:35:47,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-04 21:35:47,718 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-04 21:35:47,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-04 21:35:47,719 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:47,719 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-04 21:35:47,719 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:47,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:47,720 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-08-04 21:35:47,721 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:47,740 WARN L254 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 140 conjunts are in the unsatisfiable core [2019-08-04 21:35:47,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:48,570 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-04 21:35:48,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:48,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-04 21:35:48,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-04 21:35:48,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-04 21:35:48,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:35:48,571 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-04 21:35:49,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:49,046 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-04 21:35:49,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-04 21:35:49,047 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-04 21:35:49,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:49,047 INFO L225 Difference]: With dead ends: 26 [2019-08-04 21:35:49,048 INFO L226 Difference]: Without dead ends: 26 [2019-08-04 21:35:49,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:35:49,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-04 21:35:49,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-04 21:35:49,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-04 21:35:49,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-04 21:35:49,052 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-04 21:35:49,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:49,052 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-04 21:35:49,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-04 21:35:49,052 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-04 21:35:49,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:35:49,053 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:49,053 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-04 21:35:49,053 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:49,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:49,054 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-08-04 21:35:49,055 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:49,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:49,074 WARN L254 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 146 conjunts are in the unsatisfiable core [2019-08-04 21:35:49,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:49,671 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-04 21:35:51,598 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-04 21:35:51,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:51,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-04 21:35:51,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-04 21:35:51,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-04 21:35:51,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:35:51,599 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-04 21:35:52,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:52,398 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-04 21:35:52,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-04 21:35:52,399 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-04 21:35:52,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:52,400 INFO L225 Difference]: With dead ends: 27 [2019-08-04 21:35:52,400 INFO L226 Difference]: Without dead ends: 27 [2019-08-04 21:35:52,400 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:35:52,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-04 21:35:52,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-04 21:35:52,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-04 21:35:52,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-04 21:35:52,404 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-04 21:35:52,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:52,405 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-04 21:35:52,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-04 21:35:52,405 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-04 21:35:52,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-04 21:35:52,406 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:52,406 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-04 21:35:52,406 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:52,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:52,406 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-08-04 21:35:52,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:52,428 WARN L254 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 152 conjunts are in the unsatisfiable core [2019-08-04 21:35:52,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:53,140 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-04 21:35:53,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:53,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-04 21:35:53,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-04 21:35:53,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-04 21:35:53,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:35:53,142 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-04 21:35:53,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:53,869 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-04 21:35:53,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-04 21:35:53,870 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-04 21:35:53,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:53,871 INFO L225 Difference]: With dead ends: 28 [2019-08-04 21:35:53,871 INFO L226 Difference]: Without dead ends: 28 [2019-08-04 21:35:53,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:35:53,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-04 21:35:53,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-04 21:35:53,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-04 21:35:53,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-04 21:35:53,875 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-04 21:35:53,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:53,875 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-04 21:35:53,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-04 21:35:53,876 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-04 21:35:53,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-04 21:35:53,876 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:53,876 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-04 21:35:53,877 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:53,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:53,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-08-04 21:35:53,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:53,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:53,899 WARN L254 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 158 conjunts are in the unsatisfiable core [2019-08-04 21:35:53,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:54,536 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-04 21:35:54,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:54,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-04 21:35:54,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-04 21:35:54,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-04 21:35:54,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:35:54,537 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-04 21:35:55,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:55,092 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-04 21:35:55,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-04 21:35:55,093 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-04 21:35:55,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:55,093 INFO L225 Difference]: With dead ends: 29 [2019-08-04 21:35:55,094 INFO L226 Difference]: Without dead ends: 29 [2019-08-04 21:35:55,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:35:55,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-04 21:35:55,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-04 21:35:55,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-04 21:35:55,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-04 21:35:55,098 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-04 21:35:55,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:55,099 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-04 21:35:55,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-04 21:35:55,099 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-04 21:35:55,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-04 21:35:55,100 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:55,100 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-04 21:35:55,100 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:55,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:55,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-08-04 21:35:55,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:55,125 WARN L254 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 164 conjunts are in the unsatisfiable core [2019-08-04 21:35:55,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:55,708 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-04 21:35:55,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:55,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-04 21:35:55,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-04 21:35:55,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-04 21:35:55,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:35:55,710 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-04 21:35:56,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:56,325 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-04 21:35:56,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-04 21:35:56,325 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-04 21:35:56,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:56,326 INFO L225 Difference]: With dead ends: 30 [2019-08-04 21:35:56,326 INFO L226 Difference]: Without dead ends: 30 [2019-08-04 21:35:56,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:35:56,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-04 21:35:56,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-04 21:35:56,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-04 21:35:56,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-04 21:35:56,330 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-04 21:35:56,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:56,331 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-04 21:35:56,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-04 21:35:56,331 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-04 21:35:56,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-04 21:35:56,331 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:56,332 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-04 21:35:56,332 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:56,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:56,332 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-08-04 21:35:56,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:56,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:56,356 WARN L254 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 170 conjunts are in the unsatisfiable core [2019-08-04 21:35:56,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:57,200 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-04 21:35:57,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:57,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-04 21:35:57,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-04 21:35:57,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-04 21:35:57,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:35:57,202 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-04 21:35:57,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:57,933 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-04 21:35:57,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-04 21:35:57,934 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-04 21:35:57,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:57,934 INFO L225 Difference]: With dead ends: 31 [2019-08-04 21:35:57,934 INFO L226 Difference]: Without dead ends: 31 [2019-08-04 21:35:57,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:35:57,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-04 21:35:57,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-04 21:35:57,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-04 21:35:57,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-04 21:35:57,938 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-04 21:35:57,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:57,938 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-04 21:35:57,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-04 21:35:57,939 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-04 21:35:57,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-04 21:35:57,939 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:57,939 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-04 21:35:57,939 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:57,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:57,940 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-08-04 21:35:57,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:57,964 WARN L254 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 176 conjunts are in the unsatisfiable core [2019-08-04 21:35:57,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:35:58,643 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-04 21:35:58,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:35:58,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-04 21:35:58,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-04 21:35:58,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-04 21:35:58,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:35:58,645 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-04 21:35:59,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:35:59,353 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-04 21:35:59,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-04 21:35:59,353 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-04 21:35:59,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:35:59,354 INFO L225 Difference]: With dead ends: 32 [2019-08-04 21:35:59,354 INFO L226 Difference]: Without dead ends: 32 [2019-08-04 21:35:59,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:35:59,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-04 21:35:59,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-04 21:35:59,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-04 21:35:59,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-04 21:35:59,361 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-04 21:35:59,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:35:59,361 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-04 21:35:59,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-04 21:35:59,361 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-04 21:35:59,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-04 21:35:59,362 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:35:59,362 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-04 21:35:59,362 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:35:59,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:35:59,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-08-04 21:35:59,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:35:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:35:59,386 WARN L254 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 182 conjunts are in the unsatisfiable core [2019-08-04 21:35:59,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:00,058 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-04 21:36:00,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:00,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-04 21:36:00,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-04 21:36:00,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-04 21:36:00,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:36:00,060 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-04 21:36:00,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:00,801 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-04 21:36:00,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-04 21:36:00,802 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-04 21:36:00,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:00,802 INFO L225 Difference]: With dead ends: 33 [2019-08-04 21:36:00,802 INFO L226 Difference]: Without dead ends: 33 [2019-08-04 21:36:00,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:36:00,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-04 21:36:00,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-04 21:36:00,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-04 21:36:00,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-04 21:36:00,807 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-04 21:36:00,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:00,807 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-04 21:36:00,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-04 21:36:00,807 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-04 21:36:00,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-04 21:36:00,808 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:00,808 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-04 21:36:00,808 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:00,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:00,808 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-08-04 21:36:00,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:00,834 WARN L254 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 188 conjunts are in the unsatisfiable core [2019-08-04 21:36:00,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:01,592 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-04 21:36:01,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:01,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-04 21:36:01,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-04 21:36:01,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-04 21:36:01,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:36:01,594 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-04 21:36:02,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:02,403 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-04 21:36:02,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-04 21:36:02,404 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-04 21:36:02,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:02,405 INFO L225 Difference]: With dead ends: 34 [2019-08-04 21:36:02,405 INFO L226 Difference]: Without dead ends: 34 [2019-08-04 21:36:02,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:36:02,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-04 21:36:02,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-04 21:36:02,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-04 21:36:02,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-04 21:36:02,409 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-04 21:36:02,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:02,409 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-04 21:36:02,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-04 21:36:02,410 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-04 21:36:02,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-04 21:36:02,410 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:02,410 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-04 21:36:02,411 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:02,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:02,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-08-04 21:36:02,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:02,437 WARN L254 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 194 conjunts are in the unsatisfiable core [2019-08-04 21:36:02,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:03,466 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-04 21:36:03,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:03,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-04 21:36:03,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-04 21:36:03,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-04 21:36:03,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:36:03,468 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-04 21:36:04,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:04,396 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-04 21:36:04,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-04 21:36:04,397 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-04 21:36:04,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:04,397 INFO L225 Difference]: With dead ends: 35 [2019-08-04 21:36:04,397 INFO L226 Difference]: Without dead ends: 35 [2019-08-04 21:36:04,398 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-04 21:36:04,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-04 21:36:04,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-04 21:36:04,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-04 21:36:04,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-04 21:36:04,400 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-04 21:36:04,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:04,401 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-04 21:36:04,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-04 21:36:04,401 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-04 21:36:04,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-04 21:36:04,401 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:04,401 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-04 21:36:04,402 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:04,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:04,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-08-04 21:36:04,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:04,425 WARN L254 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 200 conjunts are in the unsatisfiable core [2019-08-04 21:36:04,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:05,208 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-04 21:36:05,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:05,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-04 21:36:05,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-04 21:36:05,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-04 21:36:05,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:36:05,209 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-04 21:36:06,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:06,101 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-04 21:36:06,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-04 21:36:06,102 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-04 21:36:06,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:06,102 INFO L225 Difference]: With dead ends: 36 [2019-08-04 21:36:06,102 INFO L226 Difference]: Without dead ends: 36 [2019-08-04 21:36:06,103 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-04 21:36:06,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-04 21:36:06,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-04 21:36:06,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-04 21:36:06,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-04 21:36:06,107 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-04 21:36:06,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:06,107 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-04 21:36:06,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-04 21:36:06,107 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-04 21:36:06,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-04 21:36:06,108 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:06,108 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-04 21:36:06,108 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:06,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:06,108 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-08-04 21:36:06,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:06,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:06,137 WARN L254 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 206 conjunts are in the unsatisfiable core [2019-08-04 21:36:06,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:07,129 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-04 21:36:07,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:07,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-04 21:36:07,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-04 21:36:07,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-04 21:36:07,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:36:07,131 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-04 21:36:08,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:08,147 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-04 21:36:08,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-04 21:36:08,147 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-04 21:36:08,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:08,148 INFO L225 Difference]: With dead ends: 37 [2019-08-04 21:36:08,148 INFO L226 Difference]: Without dead ends: 37 [2019-08-04 21:36:08,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:36:08,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-04 21:36:08,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-04 21:36:08,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-04 21:36:08,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-04 21:36:08,152 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-04 21:36:08,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:08,153 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-04 21:36:08,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-04 21:36:08,153 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-04 21:36:08,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-04 21:36:08,153 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:08,154 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-04 21:36:08,154 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:08,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:08,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-08-04 21:36:08,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:08,185 WARN L254 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 212 conjunts are in the unsatisfiable core [2019-08-04 21:36:08,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:09,238 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-04 21:36:09,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:09,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-04 21:36:09,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-04 21:36:09,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-04 21:36:09,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:36:09,240 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-04 21:36:10,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:10,233 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-04 21:36:10,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-04 21:36:10,234 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-04 21:36:10,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:10,234 INFO L225 Difference]: With dead ends: 38 [2019-08-04 21:36:10,235 INFO L226 Difference]: Without dead ends: 38 [2019-08-04 21:36:10,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:36:10,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-04 21:36:10,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-04 21:36:10,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-04 21:36:10,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-04 21:36:10,238 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-04 21:36:10,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:10,238 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-04 21:36:10,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-04 21:36:10,238 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-04 21:36:10,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-04 21:36:10,238 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:10,238 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-04 21:36:10,239 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:10,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:10,239 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-08-04 21:36:10,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:10,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:10,266 WARN L254 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 218 conjunts are in the unsatisfiable core [2019-08-04 21:36:10,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:11,157 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-04 21:36:11,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:11,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-04 21:36:11,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-04 21:36:11,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-04 21:36:11,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:36:11,159 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-04 21:36:12,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:12,229 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-04 21:36:12,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-04 21:36:12,230 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-04 21:36:12,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:12,230 INFO L225 Difference]: With dead ends: 39 [2019-08-04 21:36:12,231 INFO L226 Difference]: Without dead ends: 39 [2019-08-04 21:36:12,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:36:12,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-04 21:36:12,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-04 21:36:12,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-04 21:36:12,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-04 21:36:12,234 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-04 21:36:12,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:12,235 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-04 21:36:12,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-04 21:36:12,235 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-04 21:36:12,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-04 21:36:12,235 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:12,236 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-04 21:36:12,236 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:12,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:12,236 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-08-04 21:36:12,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:12,269 WARN L254 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 224 conjunts are in the unsatisfiable core [2019-08-04 21:36:12,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:13,475 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-04 21:36:13,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:13,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-04 21:36:13,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-04 21:36:13,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-04 21:36:13,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:36:13,477 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-04 21:36:14,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:14,577 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-04 21:36:14,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-04 21:36:14,578 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-04 21:36:14,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:14,578 INFO L225 Difference]: With dead ends: 40 [2019-08-04 21:36:14,578 INFO L226 Difference]: Without dead ends: 40 [2019-08-04 21:36:14,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:36:14,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-04 21:36:14,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-04 21:36:14,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-04 21:36:14,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-04 21:36:14,582 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-04 21:36:14,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:14,582 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-04 21:36:14,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-04 21:36:14,583 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-04 21:36:14,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-04 21:36:14,583 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:14,583 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-04 21:36:14,583 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:14,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:14,584 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-08-04 21:36:14,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:14,614 WARN L254 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 230 conjunts are in the unsatisfiable core [2019-08-04 21:36:14,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:15,667 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-04 21:36:15,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:15,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-04 21:36:15,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-04 21:36:15,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-04 21:36:15,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:36:15,668 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-04 21:36:16,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:16,845 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-04 21:36:16,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-04 21:36:16,845 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-04 21:36:16,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:16,846 INFO L225 Difference]: With dead ends: 41 [2019-08-04 21:36:16,846 INFO L226 Difference]: Without dead ends: 41 [2019-08-04 21:36:16,847 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-04 21:36:16,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-04 21:36:16,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-04 21:36:16,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-04 21:36:16,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-04 21:36:16,850 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-04 21:36:16,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:16,850 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-04 21:36:16,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-04 21:36:16,851 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-04 21:36:16,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-04 21:36:16,851 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:16,851 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-04 21:36:16,851 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:16,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:16,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-08-04 21:36:16,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:16,885 WARN L254 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 236 conjunts are in the unsatisfiable core [2019-08-04 21:36:16,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:17,913 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-04 21:36:17,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:17,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-04 21:36:17,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-04 21:36:17,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-04 21:36:17,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:36:17,915 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-04 21:36:19,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:19,238 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-04 21:36:19,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-04 21:36:19,238 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-04 21:36:19,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:19,239 INFO L225 Difference]: With dead ends: 42 [2019-08-04 21:36:19,239 INFO L226 Difference]: Without dead ends: 42 [2019-08-04 21:36:19,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:36:19,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-04 21:36:19,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-04 21:36:19,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-04 21:36:19,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-04 21:36:19,242 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-04 21:36:19,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:19,243 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-04 21:36:19,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-04 21:36:19,243 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-04 21:36:19,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-04 21:36:19,244 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:19,244 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-04 21:36:19,244 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:19,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:19,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-08-04 21:36:19,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:19,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:19,281 WARN L254 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 242 conjunts are in the unsatisfiable core [2019-08-04 21:36:19,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:20,371 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-04 21:36:20,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:20,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-04 21:36:20,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-04 21:36:20,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-04 21:36:20,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:36:20,372 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-04 21:36:21,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:21,674 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-04 21:36:21,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-04 21:36:21,674 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-04 21:36:21,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:21,675 INFO L225 Difference]: With dead ends: 43 [2019-08-04 21:36:21,675 INFO L226 Difference]: Without dead ends: 43 [2019-08-04 21:36:21,676 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-04 21:36:21,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-04 21:36:21,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-04 21:36:21,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-04 21:36:21,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-04 21:36:21,679 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-04 21:36:21,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:21,679 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-04 21:36:21,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-04 21:36:21,680 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-04 21:36:21,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-04 21:36:21,680 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:21,680 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-04 21:36:21,680 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:21,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:21,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-08-04 21:36:21,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:21,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:21,719 WARN L254 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 248 conjunts are in the unsatisfiable core [2019-08-04 21:36:21,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:22,909 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-04 21:36:22,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:22,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-04 21:36:22,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-04 21:36:22,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-04 21:36:22,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:36:22,911 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-04 21:36:24,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:24,406 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-04 21:36:24,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-04 21:36:24,407 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-04 21:36:24,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:24,408 INFO L225 Difference]: With dead ends: 44 [2019-08-04 21:36:24,408 INFO L226 Difference]: Without dead ends: 44 [2019-08-04 21:36:24,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:36:24,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-04 21:36:24,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-04 21:36:24,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-04 21:36:24,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-04 21:36:24,411 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-04 21:36:24,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:24,412 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-04 21:36:24,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-04 21:36:24,412 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-04 21:36:24,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-04 21:36:24,413 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:24,413 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-04 21:36:24,413 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:24,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:24,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-08-04 21:36:24,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:24,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:24,449 WARN L254 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 254 conjunts are in the unsatisfiable core [2019-08-04 21:36:24,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:25,611 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-04 21:36:25,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:25,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-04 21:36:25,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-04 21:36:25,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-04 21:36:25,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:36:25,613 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-04 21:36:27,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:27,101 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-04 21:36:27,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-04 21:36:27,101 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-04 21:36:27,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:27,102 INFO L225 Difference]: With dead ends: 45 [2019-08-04 21:36:27,102 INFO L226 Difference]: Without dead ends: 45 [2019-08-04 21:36:27,103 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-04 21:36:27,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-04 21:36:27,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-04 21:36:27,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-04 21:36:27,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-04 21:36:27,105 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-04 21:36:27,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:27,105 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-04 21:36:27,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-04 21:36:27,105 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-04 21:36:27,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-04 21:36:27,106 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:27,106 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-04 21:36:27,106 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:27,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:27,107 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-08-04 21:36:27,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:27,143 WARN L254 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 260 conjunts are in the unsatisfiable core [2019-08-04 21:36:27,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:28,590 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-04 21:36:28,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:28,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-04 21:36:28,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-04 21:36:28,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-04 21:36:28,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:36:28,591 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-04 21:36:30,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:30,140 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-04 21:36:30,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-04 21:36:30,140 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-04 21:36:30,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:30,141 INFO L225 Difference]: With dead ends: 46 [2019-08-04 21:36:30,141 INFO L226 Difference]: Without dead ends: 46 [2019-08-04 21:36:30,142 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-04 21:36:30,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-04 21:36:30,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-04 21:36:30,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-04 21:36:30,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-04 21:36:30,144 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-04 21:36:30,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:30,145 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-04 21:36:30,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-04 21:36:30,145 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-04 21:36:30,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-04 21:36:30,145 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:30,145 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-04 21:36:30,146 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:30,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:30,146 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-08-04 21:36:30,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:30,188 WARN L254 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 266 conjunts are in the unsatisfiable core [2019-08-04 21:36:30,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:32,327 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-04 21:36:32,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:32,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-04 21:36:32,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-04 21:36:32,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-04 21:36:32,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:36:32,328 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-04 21:36:34,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:34,064 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-04 21:36:34,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-04 21:36:34,064 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-04 21:36:34,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:34,065 INFO L225 Difference]: With dead ends: 47 [2019-08-04 21:36:34,065 INFO L226 Difference]: Without dead ends: 47 [2019-08-04 21:36:34,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:36:34,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-04 21:36:34,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-04 21:36:34,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-04 21:36:34,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-04 21:36:34,069 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-04 21:36:34,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:34,069 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-04 21:36:34,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-04 21:36:34,069 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-04 21:36:34,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-04 21:36:34,070 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:34,070 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-04 21:36:34,070 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:34,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:34,070 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-08-04 21:36:34,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:34,115 WARN L254 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 272 conjunts are in the unsatisfiable core [2019-08-04 21:36:34,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:35,497 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-04 21:36:35,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:35,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-04 21:36:35,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-04 21:36:35,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-04 21:36:35,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:36:35,498 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-04 21:36:37,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:37,134 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-04 21:36:37,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-04 21:36:37,134 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-04 21:36:37,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:37,135 INFO L225 Difference]: With dead ends: 48 [2019-08-04 21:36:37,135 INFO L226 Difference]: Without dead ends: 48 [2019-08-04 21:36:37,136 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-04 21:36:37,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-04 21:36:37,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-04 21:36:37,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-04 21:36:37,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-04 21:36:37,138 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-04 21:36:37,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:37,139 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-04 21:36:37,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-04 21:36:37,139 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-04 21:36:37,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-04 21:36:37,139 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:37,139 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-04 21:36:37,140 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:37,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:37,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-08-04 21:36:37,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:37,180 WARN L254 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 278 conjunts are in the unsatisfiable core [2019-08-04 21:36:37,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:38,719 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-04 21:36:38,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:38,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-04 21:36:38,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-04 21:36:38,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-04 21:36:38,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:36:38,721 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-04 21:36:40,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:40,494 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-04 21:36:40,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-04 21:36:40,494 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-04 21:36:40,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:40,495 INFO L225 Difference]: With dead ends: 49 [2019-08-04 21:36:40,495 INFO L226 Difference]: Without dead ends: 49 [2019-08-04 21:36:40,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:36:40,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-04 21:36:40,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-04 21:36:40,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-04 21:36:40,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-04 21:36:40,498 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-04 21:36:40,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:40,499 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-04 21:36:40,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-04 21:36:40,499 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-04 21:36:40,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-04 21:36:40,499 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:40,499 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-04 21:36:40,500 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:40,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:40,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-08-04 21:36:40,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:40,547 WARN L254 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 284 conjunts are in the unsatisfiable core [2019-08-04 21:36:40,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:42,259 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-04 21:36:42,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:42,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-04 21:36:42,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-04 21:36:42,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-04 21:36:42,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:36:42,260 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-04 21:36:44,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:44,203 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-04 21:36:44,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-04 21:36:44,203 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-04 21:36:44,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:44,204 INFO L225 Difference]: With dead ends: 50 [2019-08-04 21:36:44,204 INFO L226 Difference]: Without dead ends: 50 [2019-08-04 21:36:44,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:36:44,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-04 21:36:44,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-04 21:36:44,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-04 21:36:44,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-04 21:36:44,207 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-04 21:36:44,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:44,207 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-04 21:36:44,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-04 21:36:44,207 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-04 21:36:44,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-04 21:36:44,208 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:44,208 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-04 21:36:44,208 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:44,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:44,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-08-04 21:36:44,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:44,244 WARN L254 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 290 conjunts are in the unsatisfiable core [2019-08-04 21:36:44,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:45,946 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-04 21:36:45,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:45,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-04 21:36:45,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-04 21:36:45,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-04 21:36:45,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:36:45,947 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-04 21:36:47,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:47,825 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-04 21:36:47,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-04 21:36:47,826 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-04 21:36:47,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:47,827 INFO L225 Difference]: With dead ends: 51 [2019-08-04 21:36:47,827 INFO L226 Difference]: Without dead ends: 51 [2019-08-04 21:36:47,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:36:47,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-04 21:36:47,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-04 21:36:47,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-04 21:36:47,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-04 21:36:47,829 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-04 21:36:47,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:47,829 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-04 21:36:47,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-04 21:36:47,830 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-04 21:36:47,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-04 21:36:47,830 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:47,830 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-04 21:36:47,831 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:47,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:47,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-08-04 21:36:47,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:47,864 WARN L254 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 296 conjunts are in the unsatisfiable core [2019-08-04 21:36:47,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:49,675 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-04 21:36:49,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:49,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-04 21:36:49,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-04 21:36:49,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-04 21:36:49,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:36:49,677 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-04 21:36:51,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:51,624 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-04 21:36:51,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-04 21:36:51,624 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-04 21:36:51,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:51,625 INFO L225 Difference]: With dead ends: 52 [2019-08-04 21:36:51,625 INFO L226 Difference]: Without dead ends: 52 [2019-08-04 21:36:51,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:36:51,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-04 21:36:51,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-04 21:36:51,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-04 21:36:51,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-04 21:36:51,629 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-04 21:36:51,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:51,629 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-04 21:36:51,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-04 21:36:51,630 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-04 21:36:51,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-04 21:36:51,630 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:51,630 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-04 21:36:51,631 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:51,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:51,631 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-08-04 21:36:51,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:51,681 WARN L254 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 302 conjunts are in the unsatisfiable core [2019-08-04 21:36:51,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:53,256 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-04 21:36:53,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:53,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-04 21:36:53,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-04 21:36:53,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-04 21:36:53,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:36:53,257 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-04 21:36:55,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:55,463 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-04 21:36:55,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-04 21:36:55,464 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-04 21:36:55,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:55,465 INFO L225 Difference]: With dead ends: 53 [2019-08-04 21:36:55,465 INFO L226 Difference]: Without dead ends: 53 [2019-08-04 21:36:55,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:36:55,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-04 21:36:55,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-04 21:36:55,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-04 21:36:55,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-04 21:36:55,468 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-04 21:36:55,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:55,468 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-04 21:36:55,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-04 21:36:55,468 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-04 21:36:55,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-04 21:36:55,469 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:55,469 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-04 21:36:55,469 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:55,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:55,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-08-04 21:36:55,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:55,525 WARN L254 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 308 conjunts are in the unsatisfiable core [2019-08-04 21:36:55,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:57,201 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-04 21:36:57,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:57,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-04 21:36:57,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-04 21:36:57,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-04 21:36:57,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:36:57,202 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-04 21:36:59,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:59,448 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-04 21:36:59,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-04 21:36:59,449 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-04 21:36:59,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:59,450 INFO L225 Difference]: With dead ends: 54 [2019-08-04 21:36:59,450 INFO L226 Difference]: Without dead ends: 54 [2019-08-04 21:36:59,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:36:59,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-04 21:36:59,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-04 21:36:59,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-04 21:36:59,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-04 21:36:59,453 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-04 21:36:59,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:59,453 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-04 21:36:59,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-04 21:36:59,453 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-04 21:36:59,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-04 21:36:59,454 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:59,454 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-04 21:36:59,454 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:59,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:59,455 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-08-04 21:36:59,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:59,491 WARN L254 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 314 conjunts are in the unsatisfiable core [2019-08-04 21:36:59,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:01,223 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-04 21:37:01,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:01,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-04 21:37:01,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-04 21:37:01,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-04 21:37:01,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:37:01,225 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-04 21:37:03,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:03,420 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-04 21:37:03,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-04 21:37:03,420 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-04 21:37:03,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:03,421 INFO L225 Difference]: With dead ends: 55 [2019-08-04 21:37:03,422 INFO L226 Difference]: Without dead ends: 55 [2019-08-04 21:37:03,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:37:03,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-04 21:37:03,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-04 21:37:03,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-04 21:37:03,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-04 21:37:03,424 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-04 21:37:03,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:03,424 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-04 21:37:03,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-04 21:37:03,425 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-04 21:37:03,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-04 21:37:03,425 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:03,425 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-04 21:37:03,425 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:03,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:03,426 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-08-04 21:37:03,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:03,483 WARN L254 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 320 conjunts are in the unsatisfiable core [2019-08-04 21:37:03,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:05,579 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-04 21:37:05,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:05,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-04 21:37:05,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-04 21:37:05,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-04 21:37:05,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:37:05,581 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-04 21:37:07,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:07,982 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-04 21:37:07,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-04 21:37:07,982 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-04 21:37:07,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:07,983 INFO L225 Difference]: With dead ends: 56 [2019-08-04 21:37:07,983 INFO L226 Difference]: Without dead ends: 56 [2019-08-04 21:37:07,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:37:07,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-04 21:37:07,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-04 21:37:07,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-04 21:37:07,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-04 21:37:07,986 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-04 21:37:07,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:07,986 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-04 21:37:07,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-04 21:37:07,987 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-04 21:37:07,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-04 21:37:07,987 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:07,987 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-04 21:37:07,988 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:07,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:07,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-08-04 21:37:07,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:08,053 WARN L254 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 326 conjunts are in the unsatisfiable core [2019-08-04 21:37:08,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:10,157 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-04 21:37:10,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:10,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-04 21:37:10,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-04 21:37:10,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-04 21:37:10,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:37:10,159 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-04 21:37:12,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:12,521 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-04 21:37:12,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-04 21:37:12,522 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-04 21:37:12,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:12,522 INFO L225 Difference]: With dead ends: 57 [2019-08-04 21:37:12,522 INFO L226 Difference]: Without dead ends: 57 [2019-08-04 21:37:12,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:37:12,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-04 21:37:12,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-04 21:37:12,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-04 21:37:12,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-04 21:37:12,527 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-04 21:37:12,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:12,528 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-04 21:37:12,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-04 21:37:12,528 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-04 21:37:12,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-04 21:37:12,528 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:12,528 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-04 21:37:12,529 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:12,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:12,529 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-08-04 21:37:12,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:12,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:12,590 WARN L254 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 332 conjunts are in the unsatisfiable core [2019-08-04 21:37:12,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:14,688 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-04 21:37:14,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:14,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-04 21:37:14,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-04 21:37:14,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-04 21:37:14,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:37:14,689 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-04 21:37:17,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:17,159 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-04 21:37:17,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-04 21:37:17,160 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-04 21:37:17,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:17,161 INFO L225 Difference]: With dead ends: 58 [2019-08-04 21:37:17,161 INFO L226 Difference]: Without dead ends: 58 [2019-08-04 21:37:17,162 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-04 21:37:17,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-04 21:37:17,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-04 21:37:17,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-04 21:37:17,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-04 21:37:17,164 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-04 21:37:17,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:17,164 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-04 21:37:17,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-04 21:37:17,164 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-04 21:37:17,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-04 21:37:17,165 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:17,165 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-04 21:37:17,165 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:17,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:17,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-08-04 21:37:17,166 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:17,213 WARN L254 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 338 conjunts are in the unsatisfiable core [2019-08-04 21:37:17,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:19,152 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-04 21:37:19,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:19,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-04 21:37:19,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-04 21:37:19,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-04 21:37:19,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:37:19,153 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-04 21:37:21,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:21,855 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-04 21:37:21,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-04 21:37:21,856 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-04 21:37:21,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:21,857 INFO L225 Difference]: With dead ends: 59 [2019-08-04 21:37:21,857 INFO L226 Difference]: Without dead ends: 59 [2019-08-04 21:37:21,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:37:21,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-04 21:37:21,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-04 21:37:21,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-04 21:37:21,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-04 21:37:21,859 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-04 21:37:21,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:21,860 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-04 21:37:21,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-04 21:37:21,860 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-04 21:37:21,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-04 21:37:21,860 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:21,860 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-04 21:37:21,861 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:21,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:21,861 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-08-04 21:37:21,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:21,906 WARN L254 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 344 conjunts are in the unsatisfiable core [2019-08-04 21:37:21,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:23,875 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-04 21:37:23,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:23,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-04 21:37:23,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-04 21:37:23,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-04 21:37:23,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:37:23,876 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-04 21:37:26,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:26,711 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-04 21:37:26,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-04 21:37:26,712 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-04 21:37:26,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:26,713 INFO L225 Difference]: With dead ends: 60 [2019-08-04 21:37:26,713 INFO L226 Difference]: Without dead ends: 60 [2019-08-04 21:37:26,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:37:26,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-04 21:37:26,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-04 21:37:26,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-04 21:37:26,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-04 21:37:26,716 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-04 21:37:26,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:26,716 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-04 21:37:26,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-04 21:37:26,716 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-04 21:37:26,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-04 21:37:26,717 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:26,717 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-04 21:37:26,717 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:26,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:26,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-08-04 21:37:26,718 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:26,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:26,767 WARN L254 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 350 conjunts are in the unsatisfiable core [2019-08-04 21:37:26,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:28,873 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-04 21:37:28,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:28,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-04 21:37:28,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-04 21:37:28,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-04 21:37:28,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:37:28,875 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-04 21:37:31,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:31,724 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-04 21:37:31,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-04 21:37:31,725 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-04 21:37:31,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:31,726 INFO L225 Difference]: With dead ends: 61 [2019-08-04 21:37:31,726 INFO L226 Difference]: Without dead ends: 61 [2019-08-04 21:37:31,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:37:31,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-04 21:37:31,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-04 21:37:31,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-04 21:37:31,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-04 21:37:31,728 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-04 21:37:31,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:31,729 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-04 21:37:31,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-04 21:37:31,729 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-04 21:37:31,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-04 21:37:31,730 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:31,730 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-04 21:37:31,731 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:31,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:31,731 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-08-04 21:37:31,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:31,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:31,800 WARN L254 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 356 conjunts are in the unsatisfiable core [2019-08-04 21:37:31,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:33,968 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-04 21:37:33,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:33,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-04 21:37:33,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-04 21:37:33,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-04 21:37:33,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:37:33,969 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-04 21:37:36,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:37,000 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-04 21:37:37,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-04 21:37:37,000 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-04 21:37:37,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:37,001 INFO L225 Difference]: With dead ends: 62 [2019-08-04 21:37:37,001 INFO L226 Difference]: Without dead ends: 62 [2019-08-04 21:37:37,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:37:37,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-04 21:37:37,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-04 21:37:37,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-04 21:37:37,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-04 21:37:37,005 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-04 21:37:37,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:37,005 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-04 21:37:37,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-04 21:37:37,005 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-04 21:37:37,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-04 21:37:37,006 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:37,006 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-04 21:37:37,006 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:37,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:37,006 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-08-04 21:37:37,007 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:37,057 WARN L254 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 362 conjunts are in the unsatisfiable core [2019-08-04 21:37:37,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:39,223 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-04 21:37:39,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:39,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-04 21:37:39,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-04 21:37:39,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-04 21:37:39,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:37:39,224 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-04 21:37:42,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:42,300 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-04 21:37:42,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-04 21:37:42,300 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-04 21:37:42,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:42,301 INFO L225 Difference]: With dead ends: 63 [2019-08-04 21:37:42,301 INFO L226 Difference]: Without dead ends: 63 [2019-08-04 21:37:42,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:37:42,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-04 21:37:42,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-04 21:37:42,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-04 21:37:42,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-04 21:37:42,304 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-04 21:37:42,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:42,305 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-04 21:37:42,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-04 21:37:42,305 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-04 21:37:42,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-04 21:37:42,305 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:42,305 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-04 21:37:42,305 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:42,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:42,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-08-04 21:37:42,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:42,355 WARN L254 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 368 conjunts are in the unsatisfiable core [2019-08-04 21:37:42,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:45,666 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-04 21:37:45,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:45,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-04 21:37:45,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-04 21:37:45,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-04 21:37:45,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:37:45,667 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-04 21:37:48,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:48,688 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-04 21:37:48,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-04 21:37:48,688 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-04 21:37:48,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:48,689 INFO L225 Difference]: With dead ends: 64 [2019-08-04 21:37:48,689 INFO L226 Difference]: Without dead ends: 64 [2019-08-04 21:37:48,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:37:48,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-04 21:37:48,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-04 21:37:48,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-04 21:37:48,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-04 21:37:48,692 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-04 21:37:48,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:48,692 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-04 21:37:48,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-04 21:37:48,693 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-04 21:37:48,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-04 21:37:48,693 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:48,693 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-04 21:37:48,693 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:48,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:48,693 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-08-04 21:37:48,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:48,747 WARN L254 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 374 conjunts are in the unsatisfiable core [2019-08-04 21:37:48,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:49,383 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-04 21:37:52,659 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-04 21:37:52,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:52,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-04 21:37:52,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-04 21:37:52,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-04 21:37:52,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:37:52,660 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-04 21:37:55,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:55,891 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-04 21:37:55,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-04 21:37:55,892 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-04 21:37:55,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:55,893 INFO L225 Difference]: With dead ends: 65 [2019-08-04 21:37:55,893 INFO L226 Difference]: Without dead ends: 65 [2019-08-04 21:37:55,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:37:55,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-04 21:37:55,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-04 21:37:55,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-04 21:37:55,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-04 21:37:55,895 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-04 21:37:55,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:55,895 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-04 21:37:55,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-04 21:37:55,896 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-04 21:37:55,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-04 21:37:55,896 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:55,896 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-04 21:37:55,897 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:55,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:55,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-08-04 21:37:55,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:55,961 WARN L254 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 380 conjunts are in the unsatisfiable core [2019-08-04 21:37:55,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:58,330 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-04 21:37:58,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:58,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-04 21:37:58,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-04 21:37:58,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-04 21:37:58,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:37:58,331 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-04 21:38:01,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:01,706 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-04 21:38:01,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-04 21:38:01,707 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-04 21:38:01,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:01,707 INFO L225 Difference]: With dead ends: 66 [2019-08-04 21:38:01,708 INFO L226 Difference]: Without dead ends: 66 [2019-08-04 21:38:01,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:38:01,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-04 21:38:01,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-04 21:38:01,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-04 21:38:01,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-04 21:38:01,710 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-04 21:38:01,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:01,710 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-04 21:38:01,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-04 21:38:01,711 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-04 21:38:01,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-04 21:38:01,711 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:01,711 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-04 21:38:01,711 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:01,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:01,711 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-08-04 21:38:01,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:01,765 WARN L254 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 386 conjunts are in the unsatisfiable core [2019-08-04 21:38:01,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:04,217 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-04 21:38:04,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:04,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-04 21:38:04,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-04 21:38:04,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-04 21:38:04,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:38:04,218 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-04 21:38:07,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:07,725 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-04 21:38:07,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-04 21:38:07,726 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-04 21:38:07,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:07,726 INFO L225 Difference]: With dead ends: 67 [2019-08-04 21:38:07,727 INFO L226 Difference]: Without dead ends: 67 [2019-08-04 21:38:07,727 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-04 21:38:07,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-04 21:38:07,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-04 21:38:07,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-04 21:38:07,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-04 21:38:07,729 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-04 21:38:07,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:07,730 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-04 21:38:07,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-04 21:38:07,730 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-04 21:38:07,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-04 21:38:07,731 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:07,731 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-04 21:38:07,731 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:07,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:07,731 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-08-04 21:38:07,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:07,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:07,793 WARN L254 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 392 conjunts are in the unsatisfiable core [2019-08-04 21:38:07,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:10,376 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-04 21:38:10,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:10,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-04 21:38:10,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-04 21:38:10,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-04 21:38:10,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-04 21:38:10,378 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-04 21:38:13,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:13,950 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-04 21:38:13,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-04 21:38:13,951 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-04 21:38:13,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:13,952 INFO L225 Difference]: With dead ends: 68 [2019-08-04 21:38:13,952 INFO L226 Difference]: Without dead ends: 68 [2019-08-04 21:38:13,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-04 21:38:13,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-04 21:38:13,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-04 21:38:13,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-04 21:38:13,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-04 21:38:13,955 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-04 21:38:13,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:13,956 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-04 21:38:13,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-04 21:38:13,956 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-04 21:38:13,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-04 21:38:13,957 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:13,957 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-04 21:38:13,957 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:13,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:13,957 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-08-04 21:38:13,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:14,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:14,030 WARN L254 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 398 conjunts are in the unsatisfiable core [2019-08-04 21:38:14,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:16,973 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-04 21:38:16,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:16,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-04 21:38:16,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-04 21:38:16,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-04 21:38:16,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-04 21:38:16,974 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-04 21:38:20,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:20,514 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-04 21:38:20,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-04 21:38:20,515 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-04 21:38:20,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:20,516 INFO L225 Difference]: With dead ends: 69 [2019-08-04 21:38:20,516 INFO L226 Difference]: Without dead ends: 69 [2019-08-04 21:38:20,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-04 21:38:20,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-04 21:38:20,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-04 21:38:20,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-04 21:38:20,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-04 21:38:20,518 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-04 21:38:20,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:20,519 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-04 21:38:20,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-04 21:38:20,519 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-04 21:38:20,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-04 21:38:20,520 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:20,520 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-04 21:38:20,520 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:20,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:20,520 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-08-04 21:38:20,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:20,582 WARN L254 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 404 conjunts are in the unsatisfiable core [2019-08-04 21:38:20,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:23,532 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-04 21:38:23,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:23,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-04 21:38:23,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-04 21:38:23,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-04 21:38:23,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-04 21:38:23,533 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-04 21:38:27,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:27,353 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-04 21:38:27,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-04 21:38:27,354 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-04 21:38:27,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:27,354 INFO L225 Difference]: With dead ends: 70 [2019-08-04 21:38:27,355 INFO L226 Difference]: Without dead ends: 70 [2019-08-04 21:38:27,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-04 21:38:27,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-04 21:38:27,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-04 21:38:27,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-04 21:38:27,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-04 21:38:27,358 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-04 21:38:27,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:27,358 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-04 21:38:27,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-04 21:38:27,359 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-04 21:38:27,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-04 21:38:27,359 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:27,359 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-04 21:38:27,359 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:27,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:27,360 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-08-04 21:38:27,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:27,427 WARN L254 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 410 conjunts are in the unsatisfiable core [2019-08-04 21:38:27,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:30,506 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-04 21:38:30,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:30,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-04 21:38:30,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-04 21:38:30,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-04 21:38:30,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:38:30,507 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-04 21:38:34,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:34,462 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-04 21:38:34,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-04 21:38:34,462 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-04 21:38:34,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:34,463 INFO L225 Difference]: With dead ends: 71 [2019-08-04 21:38:34,463 INFO L226 Difference]: Without dead ends: 71 [2019-08-04 21:38:34,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:38:34,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-04 21:38:34,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-04 21:38:34,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-04 21:38:34,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-04 21:38:34,466 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-04 21:38:34,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:34,466 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-04 21:38:34,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-04 21:38:34,467 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-04 21:38:34,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-04 21:38:34,467 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:34,468 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-04 21:38:34,468 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:34,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:34,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-08-04 21:38:34,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:34,534 WARN L254 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 416 conjunts are in the unsatisfiable core [2019-08-04 21:38:34,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:37,723 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-04 21:38:37,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:37,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-04 21:38:37,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-04 21:38:37,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-04 21:38:37,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-04 21:38:37,724 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-04 21:38:41,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:41,755 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-04 21:38:41,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-04 21:38:41,755 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-04 21:38:41,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:41,756 INFO L225 Difference]: With dead ends: 72 [2019-08-04 21:38:41,756 INFO L226 Difference]: Without dead ends: 72 [2019-08-04 21:38:41,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-04 21:38:41,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-04 21:38:41,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-04 21:38:41,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-04 21:38:41,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-04 21:38:41,759 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-04 21:38:41,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:41,759 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-04 21:38:41,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-04 21:38:41,759 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-04 21:38:41,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-04 21:38:41,759 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:41,760 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-04 21:38:41,760 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:41,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:41,760 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-08-04 21:38:41,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:41,843 WARN L254 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 422 conjunts are in the unsatisfiable core [2019-08-04 21:38:41,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:44,781 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-04 21:38:44,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:44,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-04 21:38:44,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-04 21:38:44,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-04 21:38:44,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:38:44,782 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-04 21:38:48,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:48,847 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-04 21:38:48,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-04 21:38:48,848 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-04 21:38:48,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:48,848 INFO L225 Difference]: With dead ends: 73 [2019-08-04 21:38:48,849 INFO L226 Difference]: Without dead ends: 73 [2019-08-04 21:38:48,849 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-04 21:38:48,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-04 21:38:48,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-04 21:38:48,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-04 21:38:48,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-04 21:38:48,852 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-04 21:38:48,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:48,852 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-04 21:38:48,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-04 21:38:48,852 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-04 21:38:48,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-04 21:38:48,853 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:48,853 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-04 21:38:48,853 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:48,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:48,854 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-08-04 21:38:48,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:48,936 WARN L254 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 428 conjunts are in the unsatisfiable core [2019-08-04 21:38:48,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:52,166 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-04 21:38:52,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:52,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-04 21:38:52,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-04 21:38:52,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-04 21:38:52,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:38:52,168 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-04 21:38:56,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:56,280 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-04 21:38:56,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-04 21:38:56,281 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-04 21:38:56,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:56,282 INFO L225 Difference]: With dead ends: 74 [2019-08-04 21:38:56,282 INFO L226 Difference]: Without dead ends: 74 [2019-08-04 21:38:56,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:38:56,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-04 21:38:56,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-04 21:38:56,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-04 21:38:56,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-04 21:38:56,285 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-04 21:38:56,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:56,286 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-04 21:38:56,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-04 21:38:56,286 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-04 21:38:56,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-04 21:38:56,286 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:56,287 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-04 21:38:56,287 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:56,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:56,287 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-08-04 21:38:56,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:56,438 WARN L254 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 434 conjunts are in the unsatisfiable core [2019-08-04 21:38:56,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:59,890 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-04 21:38:59,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:59,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-04 21:38:59,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-04 21:38:59,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-04 21:38:59,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-04 21:38:59,892 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-04 21:39:04,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:04,262 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-04 21:39:04,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-04 21:39:04,262 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-04 21:39:04,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:04,263 INFO L225 Difference]: With dead ends: 75 [2019-08-04 21:39:04,263 INFO L226 Difference]: Without dead ends: 75 [2019-08-04 21:39:04,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-04 21:39:04,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-04 21:39:04,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-04 21:39:04,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-04 21:39:04,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-04 21:39:04,266 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-04 21:39:04,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:04,266 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-04 21:39:04,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-04 21:39:04,266 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-04 21:39:04,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-04 21:39:04,267 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:04,267 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-04 21:39:04,267 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:04,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:04,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-08-04 21:39:04,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:04,399 WARN L254 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 440 conjunts are in the unsatisfiable core [2019-08-04 21:39:04,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:08,097 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-04 21:39:08,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:08,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-04 21:39:08,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-04 21:39:08,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-04 21:39:08,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:39:08,098 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-04 21:39:12,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:12,616 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-04 21:39:12,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-04 21:39:12,616 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-04 21:39:12,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:12,617 INFO L225 Difference]: With dead ends: 76 [2019-08-04 21:39:12,617 INFO L226 Difference]: Without dead ends: 76 [2019-08-04 21:39:12,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:39:12,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-04 21:39:12,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-04 21:39:12,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-04 21:39:12,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-04 21:39:12,621 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-04 21:39:12,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:12,622 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-04 21:39:12,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-04 21:39:12,622 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-04 21:39:12,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-04 21:39:12,622 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:12,622 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-04 21:39:12,623 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:12,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:12,623 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-08-04 21:39:12,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:12,734 WARN L254 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 446 conjunts are in the unsatisfiable core [2019-08-04 21:39:12,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:16,036 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-04 21:39:16,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:16,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-04 21:39:16,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-04 21:39:16,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-04 21:39:16,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-04 21:39:16,037 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-04 21:39:20,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:20,805 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-04 21:39:20,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-04 21:39:20,805 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-04 21:39:20,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:20,806 INFO L225 Difference]: With dead ends: 77 [2019-08-04 21:39:20,806 INFO L226 Difference]: Without dead ends: 77 [2019-08-04 21:39:20,807 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-04 21:39:20,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-04 21:39:20,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-04 21:39:20,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-04 21:39:20,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-04 21:39:20,809 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-04 21:39:20,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:20,810 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-04 21:39:20,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-04 21:39:20,810 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-04 21:39:20,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-04 21:39:20,810 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:20,811 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-04 21:39:20,811 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:20,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:20,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-08-04 21:39:20,812 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:20,906 WARN L254 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 452 conjunts are in the unsatisfiable core [2019-08-04 21:39:20,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:24,547 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-04 21:39:24,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:24,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-04 21:39:24,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-04 21:39:24,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-04 21:39:24,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-04 21:39:24,548 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-04 21:39:29,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:29,443 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-04 21:39:29,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-04 21:39:29,444 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-04 21:39:29,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:29,445 INFO L225 Difference]: With dead ends: 78 [2019-08-04 21:39:29,445 INFO L226 Difference]: Without dead ends: 78 [2019-08-04 21:39:29,445 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-04 21:39:29,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-04 21:39:29,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-04 21:39:29,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-04 21:39:29,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-04 21:39:29,448 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-04 21:39:29,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:29,448 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-04 21:39:29,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-04 21:39:29,448 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-04 21:39:29,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-04 21:39:29,449 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:29,449 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-04 21:39:29,449 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:29,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:29,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-08-04 21:39:29,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:29,550 WARN L254 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 458 conjunts are in the unsatisfiable core [2019-08-04 21:39:29,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:33,216 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-04 21:39:33,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:33,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-04 21:39:33,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-04 21:39:33,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-04 21:39:33,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:39:33,217 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-04 21:39:38,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:38,221 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-04 21:39:38,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-04 21:39:38,221 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-04 21:39:38,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:38,222 INFO L225 Difference]: With dead ends: 79 [2019-08-04 21:39:38,222 INFO L226 Difference]: Without dead ends: 79 [2019-08-04 21:39:38,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:39:38,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-04 21:39:38,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-04 21:39:38,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-04 21:39:38,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-04 21:39:38,225 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-04 21:39:38,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:38,225 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-04 21:39:38,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-04 21:39:38,226 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-04 21:39:38,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-04 21:39:38,226 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:38,226 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-04 21:39:38,227 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:38,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:38,227 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-08-04 21:39:38,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:38,326 WARN L254 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 464 conjunts are in the unsatisfiable core [2019-08-04 21:39:38,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:41,906 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-04 21:39:41,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:41,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-04 21:39:41,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-04 21:39:41,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-04 21:39:41,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-04 21:39:41,908 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-04 21:39:47,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:47,047 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-04 21:39:47,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-04 21:39:47,047 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-04 21:39:47,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:47,048 INFO L225 Difference]: With dead ends: 80 [2019-08-04 21:39:47,048 INFO L226 Difference]: Without dead ends: 80 [2019-08-04 21:39:47,049 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-04 21:39:47,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-04 21:39:47,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-04 21:39:47,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-04 21:39:47,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-04 21:39:47,051 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-04 21:39:47,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:47,051 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-04 21:39:47,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-04 21:39:47,052 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-04 21:39:47,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-04 21:39:47,052 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:47,052 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-04 21:39:47,052 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:47,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:47,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-08-04 21:39:47,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:47,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:47,143 WARN L254 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 470 conjunts are in the unsatisfiable core [2019-08-04 21:39:47,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-04 21:39:48,584 WARN L196 SmtUtils]: Removed 1 from assertion stack [2019-08-04 21:39:48,584 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-04 21:39:48,585 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-04 21:39:48,589 WARN L223 ceAbstractionStarter]: Timeout [2019-08-04 21:39:48,589 INFO L202 PluginConnector]: Adding new model jm2006_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:39:48 BoogieIcfgContainer [2019-08-04 21:39:48,589 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:39:48,591 INFO L168 Benchmark]: Toolchain (without parser) took 254617.19 ms. Allocated memory was 134.2 MB in the beginning and 256.9 MB in the end (delta: 122.7 MB). Free memory was 111.8 MB in the beginning and 19.2 MB in the end (delta: 92.6 MB). Peak memory consumption was 215.3 MB. Max. memory is 7.1 GB. [2019-08-04 21:39:48,591 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 134.2 MB. Free memory is still 112.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-04 21:39:48,592 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.74 ms. Allocated memory is still 134.2 MB. Free memory was 111.4 MB in the beginning and 110.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-04 21:39:48,592 INFO L168 Benchmark]: Boogie Preprocessor took 20.96 ms. Allocated memory is still 134.2 MB. Free memory was 110.1 MB in the beginning and 108.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-04 21:39:48,593 INFO L168 Benchmark]: RCFGBuilder took 247.34 ms. Allocated memory is still 134.2 MB. Free memory was 108.8 MB in the beginning and 99.0 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2019-08-04 21:39:48,593 INFO L168 Benchmark]: TraceAbstraction took 254308.62 ms. Allocated memory was 134.2 MB in the beginning and 256.9 MB in the end (delta: 122.7 MB). Free memory was 98.6 MB in the beginning and 19.2 MB in the end (delta: 79.4 MB). Peak memory consumption was 202.1 MB. Max. memory is 7.1 GB. [2019-08-04 21:39:48,596 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.21 ms. Allocated memory is still 134.2 MB. Free memory is still 112.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.74 ms. Allocated memory is still 134.2 MB. Free memory was 111.4 MB in the beginning and 110.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.96 ms. Allocated memory is still 134.2 MB. Free memory was 110.1 MB in the beginning and 108.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 247.34 ms. Allocated memory is still 134.2 MB. Free memory was 108.8 MB in the beginning and 99.0 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 254308.62 ms. Allocated memory was 134.2 MB in the beginning and 256.9 MB in the end (delta: 122.7 MB). Free memory was 98.6 MB in the beginning and 19.2 MB in the end (delta: 79.4 MB). Peak memory consumption was 202.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 57). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 76,while TraceCheckSpWp was constructing forward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 13 for 0ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 254.2s OverallTime, 77 OverallIterations, 76 TraceHistogramMax, 133.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, 113.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3002 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 2926 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 113.0s 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.2s AutomataMinimizationTime, 76 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 115.5s InterpolantComputationTime, 3078 NumberOfCodeBlocks, 3078 NumberOfCodeBlocksAsserted, 76 NumberOfCheckSat, 3002 ConstructedInterpolants, 0 QuantifiedInterpolants, 2121152 SizeOfPredicates, 532 NumberOfNonLiveVariables, 22230 ConjunctsInSsa, 18164 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