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/random/RanFile073.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:04:12,994 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:04:12,996 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:04:13,007 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:04:13,007 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:04:13,008 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:04:13,010 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:04:13,011 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:04:13,013 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:04:13,014 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:04:13,015 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:04:13,015 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:04:13,016 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:04:13,017 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:04:13,018 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:04:13,019 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:04:13,020 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:04:13,021 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:04:13,022 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:04:13,024 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:04:13,026 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:04:13,027 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:04:13,028 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:04:13,029 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:04:13,032 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:04:13,032 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:04:13,032 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:04:13,033 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:04:13,037 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:04:13,038 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:04:13,038 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:04:13,039 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:04:13,043 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:04:13,044 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:04:13,045 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:04:13,045 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:04:13,045 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:04:13,046 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:04:13,046 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:04:13,047 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:04:13,049 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:04:13,087 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:04:13,100 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:04:13,103 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:04:13,104 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:04:13,105 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:04:13,106 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/random/RanFile073.bpl [2019-08-05 10:04:13,106 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/random/RanFile073.bpl' [2019-08-05 10:04:13,163 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:04:13,165 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:04:13,166 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:04:13,166 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:04:13,166 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:04:13,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "RanFile073.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:13" (1/1) ... [2019-08-05 10:04:13,196 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "RanFile073.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:13" (1/1) ... [2019-08-05 10:04:13,202 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:04:13,202 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:04:13,202 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:04:13,204 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:04:13,205 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:04:13,205 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:04:13,205 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:04:13,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "RanFile073.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:13" (1/1) ... [2019-08-05 10:04:13,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "RanFile073.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:13" (1/1) ... [2019-08-05 10:04:13,219 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "RanFile073.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:13" (1/1) ... [2019-08-05 10:04:13,219 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "RanFile073.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:13" (1/1) ... [2019-08-05 10:04:13,226 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "RanFile073.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:13" (1/1) ... [2019-08-05 10:04:13,239 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "RanFile073.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:13" (1/1) ... [2019-08-05 10:04:13,242 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "RanFile073.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:13" (1/1) ... [2019-08-05 10:04:13,246 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:04:13,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:04:13,246 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:04:13,247 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:04:13,248 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "RanFile073.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:04:13,323 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:04:13,324 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:04:13,324 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:04:14,747 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:04:14,747 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:04:14,749 INFO L202 PluginConnector]: Adding new model RanFile073.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:04:14 BoogieIcfgContainer [2019-08-05 10:04:14,749 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:04:14,750 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:04:14,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:04:14,754 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:04:14,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RanFile073.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:13" (1/2) ... [2019-08-05 10:04:14,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c1d076 and model type RanFile073.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:04:14, skipping insertion in model container [2019-08-05 10:04:14,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RanFile073.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:04:14" (2/2) ... [2019-08-05 10:04:14,757 INFO L109 eAbstractionObserver]: Analyzing ICFG RanFile073.bpl [2019-08-05 10:04:14,767 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:04:14,778 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-08-05 10:04:14,796 INFO L252 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-08-05 10:04:14,822 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:04:14,823 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:04:14,823 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:04:14,823 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:04:14,824 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:04:14,824 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:04:14,824 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:04:14,824 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:04:14,824 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:04:14,841 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2019-08-05 10:04:14,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:04:14,852 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:14,853 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:14,858 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:14,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:14,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1121473255, now seen corresponding path program 1 times [2019-08-05 10:04:14,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:14,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:04:14,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:15,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:15,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:15,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:04:15,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:04:15,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:04:15,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:04:15,146 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 4 states. [2019-08-05 10:04:15,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:15,638 INFO L93 Difference]: Finished difference Result 59 states and 95 transitions. [2019-08-05 10:04:15,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:04:15,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-08-05 10:04:15,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:15,653 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:04:15,653 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:04:15,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:04:15,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:04:15,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2019-08-05 10:04:15,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:04:15,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 88 transitions. [2019-08-05 10:04:15,696 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 88 transitions. Word has length 23 [2019-08-05 10:04:15,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:15,699 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 88 transitions. [2019-08-05 10:04:15,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:04:15,699 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 88 transitions. [2019-08-05 10:04:15,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:04:15,701 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:15,701 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:15,701 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:15,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:15,702 INFO L82 PathProgramCache]: Analyzing trace with hash -405932201, now seen corresponding path program 1 times [2019-08-05 10:04:15,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:15,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:15,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:04:15,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:16,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:16,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:16,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-08-05 10:04:16,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:04:16,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:04:16,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:04:16,474 INFO L87 Difference]: Start difference. First operand 52 states and 88 transitions. Second operand 9 states. [2019-08-05 10:04:21,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:21,872 INFO L93 Difference]: Finished difference Result 95 states and 163 transitions. [2019-08-05 10:04:21,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:04:21,872 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-08-05 10:04:21,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:21,874 INFO L225 Difference]: With dead ends: 95 [2019-08-05 10:04:21,875 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:04:21,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:04:21,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:04:21,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 62. [2019-08-05 10:04:21,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:04:21,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 104 transitions. [2019-08-05 10:04:21,887 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 104 transitions. Word has length 24 [2019-08-05 10:04:21,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:21,887 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 104 transitions. [2019-08-05 10:04:21,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:04:21,887 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 104 transitions. [2019-08-05 10:04:21,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:04:21,889 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:21,889 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:21,889 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:21,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:21,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1599685534, now seen corresponding path program 1 times [2019-08-05 10:04:21,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:21,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:04:21,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:22,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:22,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:22,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:04:22,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:04:22,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:04:22,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:04:22,031 INFO L87 Difference]: Start difference. First operand 62 states and 104 transitions. Second operand 4 states. [2019-08-05 10:04:22,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:22,342 INFO L93 Difference]: Finished difference Result 78 states and 132 transitions. [2019-08-05 10:04:22,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:04:22,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-08-05 10:04:22,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:22,344 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:04:22,344 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:04:22,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:04:22,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:04:22,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:04:22,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:04:22,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 124 transitions. [2019-08-05 10:04:22,353 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 124 transitions. Word has length 25 [2019-08-05 10:04:22,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:22,354 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 124 transitions. [2019-08-05 10:04:22,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:04:22,354 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 124 transitions. [2019-08-05 10:04:22,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:04:22,355 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:22,355 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:22,356 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:22,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:22,356 INFO L82 PathProgramCache]: Analyzing trace with hash 2021530013, now seen corresponding path program 1 times [2019-08-05 10:04:22,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:22,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:04:22,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:22,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:22,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:22,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:04:22,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:04:22,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:04:22,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:04:22,410 INFO L87 Difference]: Start difference. First operand 74 states and 124 transitions. Second operand 3 states. [2019-08-05 10:04:22,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:22,511 INFO L93 Difference]: Finished difference Result 76 states and 126 transitions. [2019-08-05 10:04:22,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:04:22,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-08-05 10:04:22,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:22,514 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:04:22,514 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:04:22,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:04:22,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:04:22,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:04:22,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:04:22,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 121 transitions. [2019-08-05 10:04:22,522 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 121 transitions. Word has length 25 [2019-08-05 10:04:22,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:22,523 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 121 transitions. [2019-08-05 10:04:22,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:04:22,523 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 121 transitions. [2019-08-05 10:04:22,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:04:22,524 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:22,524 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:22,525 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:22,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:22,525 INFO L82 PathProgramCache]: Analyzing trace with hash 2072118274, now seen corresponding path program 1 times [2019-08-05 10:04:22,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:22,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:04:22,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:22,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:22,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:22,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:04:22,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:04:22,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:04:22,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:04:22,607 INFO L87 Difference]: Start difference. First operand 74 states and 121 transitions. Second operand 4 states. [2019-08-05 10:04:22,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:22,898 INFO L93 Difference]: Finished difference Result 115 states and 186 transitions. [2019-08-05 10:04:22,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:04:22,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-08-05 10:04:22,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:22,901 INFO L225 Difference]: With dead ends: 115 [2019-08-05 10:04:22,902 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:04:22,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:04:22,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:04:22,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89. [2019-08-05 10:04:22,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:04:22,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 143 transitions. [2019-08-05 10:04:22,911 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 143 transitions. Word has length 25 [2019-08-05 10:04:22,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:22,911 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 143 transitions. [2019-08-05 10:04:22,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:04:22,912 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 143 transitions. [2019-08-05 10:04:22,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:04:22,913 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:22,913 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:22,914 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:22,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:22,914 INFO L82 PathProgramCache]: Analyzing trace with hash 2031390731, now seen corresponding path program 1 times [2019-08-05 10:04:22,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:22,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:04:22,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:23,024 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:23,319 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:24,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:24,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:24,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-08-05 10:04:24,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:04:24,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:04:24,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=136, Unknown=1, NotChecked=0, Total=182 [2019-08-05 10:04:24,041 INFO L87 Difference]: Start difference. First operand 89 states and 143 transitions. Second operand 14 states. [2019-08-05 10:04:26,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:26,040 INFO L93 Difference]: Finished difference Result 181 states and 284 transitions. [2019-08-05 10:04:26,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:04:26,042 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-08-05 10:04:26,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:26,044 INFO L225 Difference]: With dead ends: 181 [2019-08-05 10:04:26,044 INFO L226 Difference]: Without dead ends: 178 [2019-08-05 10:04:26,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=56, Invalid=183, Unknown=1, NotChecked=0, Total=240 [2019-08-05 10:04:26,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-08-05 10:04:26,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 119. [2019-08-05 10:04:26,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 10:04:26,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 189 transitions. [2019-08-05 10:04:26,054 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 189 transitions. Word has length 25 [2019-08-05 10:04:26,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:26,054 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 189 transitions. [2019-08-05 10:04:26,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:04:26,055 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 189 transitions. [2019-08-05 10:04:26,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:04:26,056 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:26,056 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:26,057 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:26,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:26,057 INFO L82 PathProgramCache]: Analyzing trace with hash 2077977994, now seen corresponding path program 1 times [2019-08-05 10:04:26,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:26,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:04:26,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:26,218 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:26,417 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-08-05 10:04:26,663 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:28,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:28,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:28,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-08-05 10:04:28,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:04:28,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:04:28,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=250, Unknown=1, NotChecked=0, Total=306 [2019-08-05 10:04:28,040 INFO L87 Difference]: Start difference. First operand 119 states and 189 transitions. Second operand 18 states. [2019-08-05 10:04:36,020 WARN L188 SmtUtils]: Spent 2.82 s on a formula simplification that was a NOOP. DAG size: 60 [2019-08-05 10:04:42,327 WARN L188 SmtUtils]: Spent 5.94 s on a formula simplification that was a NOOP. DAG size: 62 [2019-08-05 10:04:42,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:42,397 INFO L93 Difference]: Finished difference Result 190 states and 292 transitions. [2019-08-05 10:04:42,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:04:42,398 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2019-08-05 10:04:42,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:42,399 INFO L225 Difference]: With dead ends: 190 [2019-08-05 10:04:42,399 INFO L226 Difference]: Without dead ends: 190 [2019-08-05 10:04:42,400 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=98, Invalid=453, Unknown=1, NotChecked=0, Total=552 [2019-08-05 10:04:42,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-08-05 10:04:42,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 119. [2019-08-05 10:04:42,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 10:04:42,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 189 transitions. [2019-08-05 10:04:42,409 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 189 transitions. Word has length 25 [2019-08-05 10:04:42,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:42,409 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 189 transitions. [2019-08-05 10:04:42,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:04:42,409 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 189 transitions. [2019-08-05 10:04:42,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:04:42,411 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:42,411 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:42,411 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:42,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:42,412 INFO L82 PathProgramCache]: Analyzing trace with hash -49615273, now seen corresponding path program 1 times [2019-08-05 10:04:42,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:42,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:04:42,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:42,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:42,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:42,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 10:04:42,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:04:42,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:04:42,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:04:42,528 INFO L87 Difference]: Start difference. First operand 119 states and 189 transitions. Second operand 6 states. [2019-08-05 10:04:43,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:43,122 INFO L93 Difference]: Finished difference Result 187 states and 294 transitions. [2019-08-05 10:04:43,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:04:43,123 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-08-05 10:04:43,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:43,125 INFO L225 Difference]: With dead ends: 187 [2019-08-05 10:04:43,125 INFO L226 Difference]: Without dead ends: 181 [2019-08-05 10:04:43,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:04:43,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-08-05 10:04:43,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 134. [2019-08-05 10:04:43,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-08-05 10:04:43,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 214 transitions. [2019-08-05 10:04:43,132 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 214 transitions. Word has length 26 [2019-08-05 10:04:43,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:43,132 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 214 transitions. [2019-08-05 10:04:43,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:04:43,133 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 214 transitions. [2019-08-05 10:04:43,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:04:43,134 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:43,134 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:43,134 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:43,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:43,135 INFO L82 PathProgramCache]: Analyzing trace with hash 2034143207, now seen corresponding path program 1 times [2019-08-05 10:04:43,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:43,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:04:43,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:43,458 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-08-05 10:04:44,087 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-08-05 10:04:44,089 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:44,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:44,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:44,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-08-05 10:04:44,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:04:44,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:04:44,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:04:44,269 INFO L87 Difference]: Start difference. First operand 134 states and 214 transitions. Second operand 14 states. [2019-08-05 10:04:47,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:47,133 INFO L93 Difference]: Finished difference Result 170 states and 264 transitions. [2019-08-05 10:04:47,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:04:47,133 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-08-05 10:04:47,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:47,135 INFO L225 Difference]: With dead ends: 170 [2019-08-05 10:04:47,135 INFO L226 Difference]: Without dead ends: 168 [2019-08-05 10:04:47,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:04:47,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-08-05 10:04:47,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 153. [2019-08-05 10:04:47,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 10:04:47,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 242 transitions. [2019-08-05 10:04:47,142 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 242 transitions. Word has length 26 [2019-08-05 10:04:47,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:47,142 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 242 transitions. [2019-08-05 10:04:47,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:04:47,142 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 242 transitions. [2019-08-05 10:04:47,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:04:47,144 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:47,144 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:47,144 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:47,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:47,144 INFO L82 PathProgramCache]: Analyzing trace with hash 2080730470, now seen corresponding path program 1 times [2019-08-05 10:04:47,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:47,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:04:47,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:47,493 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:01,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:05:01,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:01,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-08-05 10:05:01,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:05:01,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:05:01,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=227, Unknown=1, NotChecked=0, Total=272 [2019-08-05 10:05:01,366 INFO L87 Difference]: Start difference. First operand 153 states and 242 transitions. Second operand 17 states. [2019-08-05 10:05:20,851 WARN L188 SmtUtils]: Spent 12.10 s on a formula simplification that was a NOOP. DAG size: 106 [2019-08-05 10:05:21,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:21,015 INFO L93 Difference]: Finished difference Result 201 states and 306 transitions. [2019-08-05 10:05:21,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:05:21,016 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2019-08-05 10:05:21,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:21,018 INFO L225 Difference]: With dead ends: 201 [2019-08-05 10:05:21,018 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 10:05:21,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 26.3s TimeCoverageRelationStatistics Valid=82, Invalid=423, Unknown=1, NotChecked=0, Total=506 [2019-08-05 10:05:21,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 10:05:21,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 164. [2019-08-05 10:05:21,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-08-05 10:05:21,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 256 transitions. [2019-08-05 10:05:21,024 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 256 transitions. Word has length 26 [2019-08-05 10:05:21,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:21,024 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 256 transitions. [2019-08-05 10:05:21,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:05:21,024 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 256 transitions. [2019-08-05 10:05:21,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:05:21,025 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:21,025 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:21,026 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:21,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:21,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1451396441, now seen corresponding path program 1 times [2019-08-05 10:05:21,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:21,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:05:21,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:21,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:21,569 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:21,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:05:21,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:21,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-08-05 10:05:21,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:05:21,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:05:21,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=126, Unknown=1, NotChecked=0, Total=156 [2019-08-05 10:05:21,600 INFO L87 Difference]: Start difference. First operand 164 states and 256 transitions. Second operand 13 states. [2019-08-05 10:05:24,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:24,509 INFO L93 Difference]: Finished difference Result 219 states and 345 transitions. [2019-08-05 10:05:24,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:05:24,509 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2019-08-05 10:05:24,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:24,511 INFO L225 Difference]: With dead ends: 219 [2019-08-05 10:05:24,512 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 10:05:24,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=68, Invalid=309, Unknown=3, NotChecked=0, Total=380 [2019-08-05 10:05:24,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 10:05:24,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 173. [2019-08-05 10:05:24,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-08-05 10:05:24,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 269 transitions. [2019-08-05 10:05:24,519 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 269 transitions. Word has length 26 [2019-08-05 10:05:24,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:24,519 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 269 transitions. [2019-08-05 10:05:24,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:05:24,520 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 269 transitions. [2019-08-05 10:05:24,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:05:24,520 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:24,521 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:24,521 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:24,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:24,521 INFO L82 PathProgramCache]: Analyzing trace with hash 675099815, now seen corresponding path program 1 times [2019-08-05 10:05:24,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:24,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:05:24,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:24,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:05:24,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:24,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 10:05:24,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:05:24,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:05:24,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:05:24,657 INFO L87 Difference]: Start difference. First operand 173 states and 269 transitions. Second operand 6 states. [2019-08-05 10:05:24,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:24,870 INFO L93 Difference]: Finished difference Result 169 states and 260 transitions. [2019-08-05 10:05:24,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:05:24,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-08-05 10:05:24,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:24,874 INFO L225 Difference]: With dead ends: 169 [2019-08-05 10:05:24,874 INFO L226 Difference]: Without dead ends: 165 [2019-08-05 10:05:24,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:05:24,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-08-05 10:05:24,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 152. [2019-08-05 10:05:24,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-08-05 10:05:24,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 231 transitions. [2019-08-05 10:05:24,879 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 231 transitions. Word has length 26 [2019-08-05 10:05:24,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:24,879 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 231 transitions. [2019-08-05 10:05:24,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:05:24,879 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 231 transitions. [2019-08-05 10:05:24,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:05:24,880 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:24,880 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:24,881 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:24,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:24,881 INFO L82 PathProgramCache]: Analyzing trace with hash -696673693, now seen corresponding path program 1 times [2019-08-05 10:05:24,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:24,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:05:24,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:25,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:05:25,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:25,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-08-05 10:05:25,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:05:25,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:05:25,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:05:25,130 INFO L87 Difference]: Start difference. First operand 152 states and 231 transitions. Second operand 9 states. [2019-08-05 10:05:25,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:25,626 INFO L93 Difference]: Finished difference Result 176 states and 268 transitions. [2019-08-05 10:05:25,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:05:25,627 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-08-05 10:05:25,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:25,629 INFO L225 Difference]: With dead ends: 176 [2019-08-05 10:05:25,629 INFO L226 Difference]: Without dead ends: 172 [2019-08-05 10:05:25,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:05:25,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-08-05 10:05:25,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 164. [2019-08-05 10:05:25,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-08-05 10:05:25,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 249 transitions. [2019-08-05 10:05:25,637 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 249 transitions. Word has length 26 [2019-08-05 10:05:25,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:25,637 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 249 transitions. [2019-08-05 10:05:25,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:05:25,637 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 249 transitions. [2019-08-05 10:05:25,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:05:25,638 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:25,638 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:25,639 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:25,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:25,639 INFO L82 PathProgramCache]: Analyzing trace with hash -811739246, now seen corresponding path program 1 times [2019-08-05 10:05:25,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:25,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:05:25,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:25,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:05:25,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:25,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-08-05 10:05:25,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:05:25,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:05:25,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:05:25,918 INFO L87 Difference]: Start difference. First operand 164 states and 249 transitions. Second operand 8 states. [2019-08-05 10:05:26,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:26,390 INFO L93 Difference]: Finished difference Result 191 states and 292 transitions. [2019-08-05 10:05:26,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:05:26,391 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-08-05 10:05:26,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:26,393 INFO L225 Difference]: With dead ends: 191 [2019-08-05 10:05:26,393 INFO L226 Difference]: Without dead ends: 187 [2019-08-05 10:05:26,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:05:26,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-05 10:05:26,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 171. [2019-08-05 10:05:26,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-08-05 10:05:26,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 260 transitions. [2019-08-05 10:05:26,401 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 260 transitions. Word has length 26 [2019-08-05 10:05:26,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:26,402 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 260 transitions. [2019-08-05 10:05:26,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:05:26,402 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 260 transitions. [2019-08-05 10:05:26,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:05:26,403 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:26,403 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:26,403 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:26,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:26,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1669065071, now seen corresponding path program 1 times [2019-08-05 10:05:26,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:26,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:05:26,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:26,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:05:26,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:26,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:05:26,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:05:26,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:05:26,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:05:26,466 INFO L87 Difference]: Start difference. First operand 171 states and 260 transitions. Second operand 3 states. [2019-08-05 10:05:26,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:26,574 INFO L93 Difference]: Finished difference Result 174 states and 263 transitions. [2019-08-05 10:05:26,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:05:26,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-08-05 10:05:26,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:26,577 INFO L225 Difference]: With dead ends: 174 [2019-08-05 10:05:26,577 INFO L226 Difference]: Without dead ends: 171 [2019-08-05 10:05:26,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:05:26,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-05 10:05:26,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2019-08-05 10:05:26,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-08-05 10:05:26,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 253 transitions. [2019-08-05 10:05:26,582 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 253 transitions. Word has length 27 [2019-08-05 10:05:26,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:26,583 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 253 transitions. [2019-08-05 10:05:26,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:05:26,583 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 253 transitions. [2019-08-05 10:05:26,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:05:26,584 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:26,584 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:26,584 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:26,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:26,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1633033107, now seen corresponding path program 1 times [2019-08-05 10:05:26,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:26,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:05:26,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:26,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:05:26,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:26,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:05:26,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:05:26,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:05:26,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:05:26,608 INFO L87 Difference]: Start difference. First operand 170 states and 253 transitions. Second operand 3 states. [2019-08-05 10:05:26,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:26,699 INFO L93 Difference]: Finished difference Result 171 states and 254 transitions. [2019-08-05 10:05:26,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:05:26,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-08-05 10:05:26,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:26,702 INFO L225 Difference]: With dead ends: 171 [2019-08-05 10:05:26,702 INFO L226 Difference]: Without dead ends: 154 [2019-08-05 10:05:26,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:05:26,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-08-05 10:05:26,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-08-05 10:05:26,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-08-05 10:05:26,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 224 transitions. [2019-08-05 10:05:26,706 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 224 transitions. Word has length 27 [2019-08-05 10:05:26,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:26,706 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 224 transitions. [2019-08-05 10:05:26,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:05:26,706 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 224 transitions. [2019-08-05 10:05:26,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:05:26,707 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:26,707 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:26,708 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:26,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:26,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1366069685, now seen corresponding path program 1 times [2019-08-05 10:05:26,709 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:26,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:05:26,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:27,800 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:29,596 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 115 [2019-08-05 10:05:29,598 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:30,433 WARN L188 SmtUtils]: Spent 457.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-08-05 10:05:30,436 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:30,437 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:30,440 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:30,667 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-08-05 10:06:11,296 WARN L188 SmtUtils]: Spent 39.48 s on a formula simplification that was a NOOP. DAG size: 124 [2019-08-05 10:06:11,298 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown