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/real-life/PricedTimedautomataBSearch/u2b07_batman_intermittent_power_600.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:10:11,071 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:10:11,072 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:10:11,085 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:10:11,085 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:10:11,087 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:10:11,088 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:10:11,091 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:10:11,095 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:10:11,096 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:10:11,098 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:10:11,099 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:10:11,099 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:10:11,102 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:10:11,108 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:10:11,110 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:10:11,112 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:10:11,113 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:10:11,118 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:10:11,120 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:10:11,123 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:10:11,125 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:10:11,126 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:10:11,126 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:10:11,129 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:10:11,130 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:10:11,130 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:10:11,131 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:10:11,132 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:10:11,133 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:10:11,133 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:10:11,137 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:10:11,138 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:10:11,139 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:10:11,140 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:10:11,141 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:10:11,142 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:10:11,142 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:10:11,142 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:10:11,143 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:10:11,144 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:10:11,190 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:10:11,204 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:10:11,207 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:10:11,209 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:10:11,209 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:10:11,210 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/PricedTimedautomataBSearch/u2b07_batman_intermittent_power_600.bpl [2019-08-05 10:10:11,210 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/PricedTimedautomataBSearch/u2b07_batman_intermittent_power_600.bpl' [2019-08-05 10:10:11,292 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:10:11,293 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:10:11,294 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:10:11,294 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:10:11,294 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:10:11,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "u2b07_batman_intermittent_power_600.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:10:11" (1/1) ... [2019-08-05 10:10:11,333 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "u2b07_batman_intermittent_power_600.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:10:11" (1/1) ... [2019-08-05 10:10:11,341 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:10:11,341 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:10:11,342 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:10:11,344 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:10:11,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:10:11,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:10:11,345 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:10:11,356 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_600.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:10:11" (1/1) ... [2019-08-05 10:10:11,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_600.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:10:11" (1/1) ... [2019-08-05 10:10:11,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_600.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:10:11" (1/1) ... [2019-08-05 10:10:11,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_600.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:10:11" (1/1) ... [2019-08-05 10:10:11,395 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_600.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:10:11" (1/1) ... [2019-08-05 10:10:11,404 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_600.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:10:11" (1/1) ... [2019-08-05 10:10:11,419 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_600.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:10:11" (1/1) ... [2019-08-05 10:10:11,435 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:10:11,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:10:11,436 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:10:11,436 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:10:11,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "u2b07_batman_intermittent_power_600.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:10:11" (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:10:11,509 INFO L130 BoogieDeclarations]: Found specification of procedure perform_resets [2019-08-05 10:10:11,509 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_time [2019-08-05 10:10:11,510 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_channelBusy [2019-08-05 10:10:11,510 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_APP_LZ_1$t0 [2019-08-05 10:10:11,510 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_ENV_1$t [2019-08-05 10:10:11,511 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:10:11,511 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:10:11,511 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:10:11,511 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_queue [2019-08-05 10:10:11,511 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_MAC_1$t0 [2019-08-05 10:10:11,512 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_MAC_1$t [2019-08-05 10:10:11,512 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_ENV_1$t0 [2019-08-05 10:10:11,512 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_MEDIUM_1$sendCount [2019-08-05 10:10:11,512 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_MEDIUM_1$t0 [2019-08-05 10:10:11,512 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_APP_RX_1$t0 [2019-08-05 10:10:11,850 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-08-05 10:10:15,555 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:10:15,555 INFO L283 CfgBuilder]: Removed 32 assume(true) statements. [2019-08-05 10:10:15,557 INFO L202 PluginConnector]: Adding new model u2b07_batman_intermittent_power_600.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:10:15 BoogieIcfgContainer [2019-08-05 10:10:15,557 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:10:15,558 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:10:15,558 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:10:15,561 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:10:15,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "u2b07_batman_intermittent_power_600.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:10:11" (1/2) ... [2019-08-05 10:10:15,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf514e2 and model type u2b07_batman_intermittent_power_600.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:10:15, skipping insertion in model container [2019-08-05 10:10:15,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "u2b07_batman_intermittent_power_600.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:10:15" (2/2) ... [2019-08-05 10:10:15,565 INFO L109 eAbstractionObserver]: Analyzing ICFG u2b07_batman_intermittent_power_600.bpl [2019-08-05 10:10:15,574 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:10:15,580 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 10:10:15,593 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 10:10:15,618 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:10:15,619 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:10:15,619 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:10:15,619 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:10:15,619 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:10:15,620 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:10:15,620 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:10:15,620 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:10:15,620 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:10:15,637 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2019-08-05 10:10:15,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:10:15,645 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:15,646 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:10:15,649 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:15,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:15,654 INFO L82 PathProgramCache]: Analyzing trace with hash 21207, now seen corresponding path program 1 times [2019-08-05 10:10:15,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:15,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:15,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:10:15,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:15,853 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:10:15,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:15,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:10:15,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:10:15,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:10:15,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:15,878 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 3 states. [2019-08-05 10:10:15,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:15,981 INFO L93 Difference]: Finished difference Result 79 states and 153 transitions. [2019-08-05 10:10:15,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:10:15,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:10:15,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:15,997 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:10:15,998 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:10:16,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:10:16,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:10:16,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:10:16,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:10:16,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 135 transitions. [2019-08-05 10:10:16,050 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 135 transitions. Word has length 2 [2019-08-05 10:10:16,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:16,050 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 135 transitions. [2019-08-05 10:10:16,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:10:16,051 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 135 transitions. [2019-08-05 10:10:16,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:10:16,051 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:16,051 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:16,052 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:16,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:16,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1256322736, now seen corresponding path program 1 times [2019-08-05 10:10:16,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:16,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:10:16,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:16,185 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:10:16,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:16,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:10:16,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:10:16,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:10:16,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:16,189 INFO L87 Difference]: Start difference. First operand 77 states and 135 transitions. Second operand 3 states. [2019-08-05 10:10:16,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:16,555 INFO L93 Difference]: Finished difference Result 142 states and 235 transitions. [2019-08-05 10:10:16,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:10:16,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-08-05 10:10:16,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:16,560 INFO L225 Difference]: With dead ends: 142 [2019-08-05 10:10:16,560 INFO L226 Difference]: Without dead ends: 140 [2019-08-05 10:10:16,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 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:10:16,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-08-05 10:10:16,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2019-08-05 10:10:16,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 10:10:16,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 232 transitions. [2019-08-05 10:10:16,577 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 232 transitions. Word has length 8 [2019-08-05 10:10:16,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:16,578 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 232 transitions. [2019-08-05 10:10:16,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:10:16,578 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 232 transitions. [2019-08-05 10:10:16,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:10:16,579 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:16,579 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] [2019-08-05 10:10:16,579 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:16,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:16,580 INFO L82 PathProgramCache]: Analyzing trace with hash -858023310, now seen corresponding path program 1 times [2019-08-05 10:10:16,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:16,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:10:16,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:16,658 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:10:16,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:16,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:10:16,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:10:16,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:10:16,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:16,663 INFO L87 Difference]: Start difference. First operand 137 states and 232 transitions. Second operand 3 states. [2019-08-05 10:10:16,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:16,790 INFO L93 Difference]: Finished difference Result 272 states and 458 transitions. [2019-08-05 10:10:16,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:10:16,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-08-05 10:10:16,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:16,795 INFO L225 Difference]: With dead ends: 272 [2019-08-05 10:10:16,795 INFO L226 Difference]: Without dead ends: 270 [2019-08-05 10:10:16,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 1 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:10:16,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-08-05 10:10:16,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 262. [2019-08-05 10:10:16,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-08-05 10:10:16,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 450 transitions. [2019-08-05 10:10:16,830 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 450 transitions. Word has length 20 [2019-08-05 10:10:16,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:16,830 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 450 transitions. [2019-08-05 10:10:16,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:10:16,830 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 450 transitions. [2019-08-05 10:10:16,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:10:16,831 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:16,831 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] [2019-08-05 10:10:16,833 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:16,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:16,833 INFO L82 PathProgramCache]: Analyzing trace with hash -777560288, now seen corresponding path program 1 times [2019-08-05 10:10:16,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:16,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:10:16,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:16,899 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:10:16,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:16,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:10:16,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:10:16,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:10:16,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:16,901 INFO L87 Difference]: Start difference. First operand 262 states and 450 transitions. Second operand 3 states. [2019-08-05 10:10:16,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:16,958 INFO L93 Difference]: Finished difference Result 518 states and 886 transitions. [2019-08-05 10:10:16,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:10:16,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-08-05 10:10:16,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:16,969 INFO L225 Difference]: With dead ends: 518 [2019-08-05 10:10:16,969 INFO L226 Difference]: Without dead ends: 518 [2019-08-05 10:10:16,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 1 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:10:16,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-08-05 10:10:17,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 512. [2019-08-05 10:10:17,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-08-05 10:10:17,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 882 transitions. [2019-08-05 10:10:17,015 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 882 transitions. Word has length 21 [2019-08-05 10:10:17,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:17,016 INFO L475 AbstractCegarLoop]: Abstraction has 512 states and 882 transitions. [2019-08-05 10:10:17,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:10:17,016 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 882 transitions. [2019-08-05 10:10:17,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:10:17,017 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:17,017 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] [2019-08-05 10:10:17,018 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:17,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:17,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1667072215, now seen corresponding path program 1 times [2019-08-05 10:10:17,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:17,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:10:17,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:17,099 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:10:17,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:17,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:10:17,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:10:17,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:10:17,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:17,100 INFO L87 Difference]: Start difference. First operand 512 states and 882 transitions. Second operand 3 states. [2019-08-05 10:10:17,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:17,425 INFO L93 Difference]: Finished difference Result 1006 states and 1666 transitions. [2019-08-05 10:10:17,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:10:17,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-08-05 10:10:17,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:17,433 INFO L225 Difference]: With dead ends: 1006 [2019-08-05 10:10:17,433 INFO L226 Difference]: Without dead ends: 982 [2019-08-05 10:10:17,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 1 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:10:17,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2019-08-05 10:10:17,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 972. [2019-08-05 10:10:17,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-08-05 10:10:17,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1634 transitions. [2019-08-05 10:10:17,456 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1634 transitions. Word has length 22 [2019-08-05 10:10:17,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:17,456 INFO L475 AbstractCegarLoop]: Abstraction has 972 states and 1634 transitions. [2019-08-05 10:10:17,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:10:17,456 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1634 transitions. [2019-08-05 10:10:17,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:10:17,457 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:17,457 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:10:17,458 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:17,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:17,458 INFO L82 PathProgramCache]: Analyzing trace with hash -2110740859, now seen corresponding path program 1 times [2019-08-05 10:10:17,463 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:17,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:10:17,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:17,528 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:10:17,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:17,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:10:17,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:10:17,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:10:17,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:17,530 INFO L87 Difference]: Start difference. First operand 972 states and 1634 transitions. Second operand 3 states. [2019-08-05 10:10:17,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:17,881 INFO L93 Difference]: Finished difference Result 1798 states and 2850 transitions. [2019-08-05 10:10:17,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:10:17,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-08-05 10:10:17,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:17,893 INFO L225 Difference]: With dead ends: 1798 [2019-08-05 10:10:17,893 INFO L226 Difference]: Without dead ends: 1798 [2019-08-05 10:10:17,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 1 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:10:17,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2019-08-05 10:10:17,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 1780. [2019-08-05 10:10:17,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1780 states. [2019-08-05 10:10:17,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2834 transitions. [2019-08-05 10:10:17,935 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2834 transitions. Word has length 27 [2019-08-05 10:10:17,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:17,935 INFO L475 AbstractCegarLoop]: Abstraction has 1780 states and 2834 transitions. [2019-08-05 10:10:17,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:10:17,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2834 transitions. [2019-08-05 10:10:17,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:10:17,937 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:17,937 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:17,938 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:17,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:17,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1946526065, now seen corresponding path program 1 times [2019-08-05 10:10:17,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:17,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:10:18,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:18,059 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,062 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,063 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,064 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,065 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,066 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,067 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,068 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,069 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,070 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:18,429 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 5 [2019-08-05 10:10:18,674 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 5 [2019-08-05 10:10:18,691 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:10:18,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:18,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:10:18,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:10:18,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:10:18,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:10:18,693 INFO L87 Difference]: Start difference. First operand 1780 states and 2834 transitions. Second operand 5 states. [2019-08-05 10:10:19,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:19,619 INFO L93 Difference]: Finished difference Result 1829 states and 2887 transitions. [2019-08-05 10:10:19,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:10:19,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-08-05 10:10:19,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:19,629 INFO L225 Difference]: With dead ends: 1829 [2019-08-05 10:10:19,630 INFO L226 Difference]: Without dead ends: 1829 [2019-08-05 10:10:19,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:10:19,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2019-08-05 10:10:19,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1829. [2019-08-05 10:10:19,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1829 states. [2019-08-05 10:10:19,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2887 transitions. [2019-08-05 10:10:19,669 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2887 transitions. Word has length 35 [2019-08-05 10:10:19,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:19,669 INFO L475 AbstractCegarLoop]: Abstraction has 1829 states and 2887 transitions. [2019-08-05 10:10:19,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:10:19,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2887 transitions. [2019-08-05 10:10:19,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:10:19,672 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:19,672 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:19,673 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:19,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:19,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1941441835, now seen corresponding path program 1 times [2019-08-05 10:10:19,678 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:19,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:10:19,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:19,803 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:10:19,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:19,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:10:19,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:10:19,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:10:19,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:19,805 INFO L87 Difference]: Start difference. First operand 1829 states and 2887 transitions. Second operand 3 states. [2019-08-05 10:10:20,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:20,094 INFO L93 Difference]: Finished difference Result 2663 states and 4063 transitions. [2019-08-05 10:10:20,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:10:20,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-08-05 10:10:20,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:20,124 INFO L225 Difference]: With dead ends: 2663 [2019-08-05 10:10:20,125 INFO L226 Difference]: Without dead ends: 2631 [2019-08-05 10:10:20,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 1 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:10:20,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2631 states. [2019-08-05 10:10:20,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2631 to 2629. [2019-08-05 10:10:20,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2629 states. [2019-08-05 10:10:20,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 4031 transitions. [2019-08-05 10:10:20,200 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 4031 transitions. Word has length 60 [2019-08-05 10:10:20,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:20,202 INFO L475 AbstractCegarLoop]: Abstraction has 2629 states and 4031 transitions. [2019-08-05 10:10:20,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:10:20,202 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 4031 transitions. [2019-08-05 10:10:20,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:10:20,205 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:20,208 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:20,208 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:20,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:20,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1650973313, now seen corresponding path program 1 times [2019-08-05 10:10:20,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:20,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:10:20,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:20,290 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:10:20,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:20,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:10:20,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:10:20,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:10:20,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:20,292 INFO L87 Difference]: Start difference. First operand 2629 states and 4031 transitions. Second operand 3 states. [2019-08-05 10:10:20,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:20,455 INFO L93 Difference]: Finished difference Result 3895 states and 5791 transitions. [2019-08-05 10:10:20,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:10:20,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-08-05 10:10:20,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:20,473 INFO L225 Difference]: With dead ends: 3895 [2019-08-05 10:10:20,473 INFO L226 Difference]: Without dead ends: 3895 [2019-08-05 10:10:20,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 60 SyntacticMatches, 1 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:10:20,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3895 states. [2019-08-05 10:10:20,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3895 to 3893. [2019-08-05 10:10:20,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3893 states. [2019-08-05 10:10:20,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3893 states to 3893 states and 5791 transitions. [2019-08-05 10:10:20,541 INFO L78 Accepts]: Start accepts. Automaton has 3893 states and 5791 transitions. Word has length 63 [2019-08-05 10:10:20,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:20,542 INFO L475 AbstractCegarLoop]: Abstraction has 3893 states and 5791 transitions. [2019-08-05 10:10:20,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:10:20,542 INFO L276 IsEmpty]: Start isEmpty. Operand 3893 states and 5791 transitions. [2019-08-05 10:10:20,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:10:20,544 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:20,544 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:20,545 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:20,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:20,545 INFO L82 PathProgramCache]: Analyzing trace with hash 919830319, now seen corresponding path program 1 times [2019-08-05 10:10:20,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:20,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:10:20,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:20,633 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:10:20,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:20,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:10:20,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:10:20,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:10:20,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:20,635 INFO L87 Difference]: Start difference. First operand 3893 states and 5791 transitions. Second operand 3 states. [2019-08-05 10:10:20,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:20,945 INFO L93 Difference]: Finished difference Result 3819 states and 5559 transitions. [2019-08-05 10:10:20,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:10:20,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-08-05 10:10:20,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:20,960 INFO L225 Difference]: With dead ends: 3819 [2019-08-05 10:10:20,960 INFO L226 Difference]: Without dead ends: 3745 [2019-08-05 10:10:20,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 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:10:20,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3745 states. [2019-08-05 10:10:21,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3745 to 3721. [2019-08-05 10:10:21,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3721 states. [2019-08-05 10:10:21,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3721 states to 3721 states and 5461 transitions. [2019-08-05 10:10:21,015 INFO L78 Accepts]: Start accepts. Automaton has 3721 states and 5461 transitions. Word has length 68 [2019-08-05 10:10:21,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:21,015 INFO L475 AbstractCegarLoop]: Abstraction has 3721 states and 5461 transitions. [2019-08-05 10:10:21,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:10:21,016 INFO L276 IsEmpty]: Start isEmpty. Operand 3721 states and 5461 transitions. [2019-08-05 10:10:21,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:10:21,017 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:21,017 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:21,017 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:21,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:21,017 INFO L82 PathProgramCache]: Analyzing trace with hash 373368093, now seen corresponding path program 1 times [2019-08-05 10:10:21,022 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:21,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:10:21,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:21,149 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:10:21,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:21,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:10:21,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:10:21,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:10:21,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:10:21,150 INFO L87 Difference]: Start difference. First operand 3721 states and 5461 transitions. Second operand 5 states. [2019-08-05 10:10:22,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:22,375 INFO L93 Difference]: Finished difference Result 4653 states and 6755 transitions. [2019-08-05 10:10:22,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:10:22,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-08-05 10:10:22,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:22,397 INFO L225 Difference]: With dead ends: 4653 [2019-08-05 10:10:22,397 INFO L226 Difference]: Without dead ends: 4649 [2019-08-05 10:10:22,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:10:22,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4649 states. [2019-08-05 10:10:22,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4649 to 4517. [2019-08-05 10:10:22,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4517 states. [2019-08-05 10:10:22,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4517 states to 4517 states and 6562 transitions. [2019-08-05 10:10:22,477 INFO L78 Accepts]: Start accepts. Automaton has 4517 states and 6562 transitions. Word has length 70 [2019-08-05 10:10:22,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:22,478 INFO L475 AbstractCegarLoop]: Abstraction has 4517 states and 6562 transitions. [2019-08-05 10:10:22,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:10:22,478 INFO L276 IsEmpty]: Start isEmpty. Operand 4517 states and 6562 transitions. [2019-08-05 10:10:22,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:10:22,479 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:22,480 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:22,480 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:22,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:22,481 INFO L82 PathProgramCache]: Analyzing trace with hash -30411294, now seen corresponding path program 1 times [2019-08-05 10:10:22,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:22,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:10:22,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:22,658 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,659 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,660 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,663 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,664 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,665 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,668 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,668 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,669 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,670 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,671 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:23,125 WARN L188 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 9 [2019-08-05 10:10:23,855 WARN L188 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 9 [2019-08-05 10:10:23,861 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:23,863 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:23,864 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:23,865 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:23,867 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:23,868 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:23,870 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:23,871 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:23,872 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:23,873 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:24,685 WARN L188 SmtUtils]: Spent 731.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 5 [2019-08-05 10:10:24,709 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:10:24,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:24,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:10:24,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:10:24,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:10:24,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:10:24,710 INFO L87 Difference]: Start difference. First operand 4517 states and 6562 transitions. Second operand 6 states. [2019-08-05 10:10:25,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:25,222 INFO L93 Difference]: Finished difference Result 4755 states and 6848 transitions. [2019-08-05 10:10:25,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:10:25,223 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-08-05 10:10:25,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:25,255 INFO L225 Difference]: With dead ends: 4755 [2019-08-05 10:10:25,256 INFO L226 Difference]: Without dead ends: 4755 [2019-08-05 10:10:25,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:10:25,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4755 states. [2019-08-05 10:10:25,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4755 to 4732. [2019-08-05 10:10:25,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4732 states. [2019-08-05 10:10:25,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4732 states to 4732 states and 6824 transitions. [2019-08-05 10:10:25,333 INFO L78 Accepts]: Start accepts. Automaton has 4732 states and 6824 transitions. Word has length 70 [2019-08-05 10:10:25,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:25,334 INFO L475 AbstractCegarLoop]: Abstraction has 4732 states and 6824 transitions. [2019-08-05 10:10:25,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:10:25,334 INFO L276 IsEmpty]: Start isEmpty. Operand 4732 states and 6824 transitions. [2019-08-05 10:10:25,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:10:25,334 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:25,335 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:25,335 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:25,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:25,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1143179452, now seen corresponding path program 1 times [2019-08-05 10:10:25,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:25,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:10:25,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:25,563 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:10:25,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:25,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:10:25,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:10:25,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:10:25,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:10:25,565 INFO L87 Difference]: Start difference. First operand 4732 states and 6824 transitions. Second operand 5 states. [2019-08-05 10:10:26,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:26,091 INFO L93 Difference]: Finished difference Result 4812 states and 6942 transitions. [2019-08-05 10:10:26,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:10:26,091 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-08-05 10:10:26,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:26,102 INFO L225 Difference]: With dead ends: 4812 [2019-08-05 10:10:26,102 INFO L226 Difference]: Without dead ends: 4800 [2019-08-05 10:10:26,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:10:26,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4800 states. [2019-08-05 10:10:26,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4800 to 4665. [2019-08-05 10:10:26,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-08-05 10:10:26,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 6738 transitions. [2019-08-05 10:10:26,197 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 6738 transitions. Word has length 71 [2019-08-05 10:10:26,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:26,197 INFO L475 AbstractCegarLoop]: Abstraction has 4665 states and 6738 transitions. [2019-08-05 10:10:26,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:10:26,197 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 6738 transitions. [2019-08-05 10:10:26,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 10:10:26,198 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:26,198 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:26,199 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:26,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:26,199 INFO L82 PathProgramCache]: Analyzing trace with hash 2074252044, now seen corresponding path program 1 times [2019-08-05 10:10:26,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:26,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:10:26,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:26,316 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:26,317 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:26,318 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:26,318 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:26,319 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:26,320 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:26,320 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:26,321 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:26,322 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:26,322 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:26,323 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:26,464 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:26,465 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:26,466 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:26,467 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:26,467 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:26,468 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:26,469 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:26,470 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:26,471 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:26,472 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:26,648 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 5 [2019-08-05 10:10:26,674 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:26,674 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:26,675 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:26,676 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:26,676 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:26,678 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:26,679 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:26,680 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:26,680 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:26,681 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:26,682 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:26,942 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-08-05 10:10:26,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:26,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:10:26,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:10:26,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:10:26,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:10:26,944 INFO L87 Difference]: Start difference. First operand 4665 states and 6738 transitions. Second operand 7 states. [2019-08-05 10:10:27,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:27,436 INFO L93 Difference]: Finished difference Result 4905 states and 7026 transitions. [2019-08-05 10:10:27,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:10:27,437 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2019-08-05 10:10:27,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:27,447 INFO L225 Difference]: With dead ends: 4905 [2019-08-05 10:10:27,447 INFO L226 Difference]: Without dead ends: 4905 [2019-08-05 10:10:27,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:10:27,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2019-08-05 10:10:27,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4902. [2019-08-05 10:10:27,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4902 states. [2019-08-05 10:10:27,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4902 states to 4902 states and 7023 transitions. [2019-08-05 10:10:27,505 INFO L78 Accepts]: Start accepts. Automaton has 4902 states and 7023 transitions. Word has length 105 [2019-08-05 10:10:27,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:27,505 INFO L475 AbstractCegarLoop]: Abstraction has 4902 states and 7023 transitions. [2019-08-05 10:10:27,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:10:27,505 INFO L276 IsEmpty]: Start isEmpty. Operand 4902 states and 7023 transitions. [2019-08-05 10:10:27,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 10:10:27,506 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:27,506 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:27,507 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:27,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:27,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1809599206, now seen corresponding path program 1 times [2019-08-05 10:10:27,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:27,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:10:27,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:27,635 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:27,636 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:27,636 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:27,637 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:27,637 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:27,638 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:27,639 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:27,639 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:27,640 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:27,641 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:27,641 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:27,805 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:27,805 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:27,806 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:27,806 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:27,807 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:27,807 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:27,808 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:27,809 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:27,809 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:27,853 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:27,853 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:27,895 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:27,896 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:27,896 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:27,897 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:27,898 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:27,898 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:27,899 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:27,899 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:27,900 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:27,901 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:28,023 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-08-05 10:10:28,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:28,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:10:28,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:10:28,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:10:28,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:10:28,024 INFO L87 Difference]: Start difference. First operand 4902 states and 7023 transitions. Second operand 5 states. [2019-08-05 10:10:28,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:28,201 INFO L93 Difference]: Finished difference Result 5173 states and 7346 transitions. [2019-08-05 10:10:28,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:10:28,202 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-08-05 10:10:28,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:28,212 INFO L225 Difference]: With dead ends: 5173 [2019-08-05 10:10:28,212 INFO L226 Difference]: Without dead ends: 5173 [2019-08-05 10:10:28,212 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:10:28,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5173 states. [2019-08-05 10:10:28,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5173 to 5155. [2019-08-05 10:10:28,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5155 states. [2019-08-05 10:10:28,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5155 states to 5155 states and 7328 transitions. [2019-08-05 10:10:28,267 INFO L78 Accepts]: Start accepts. Automaton has 5155 states and 7328 transitions. Word has length 107 [2019-08-05 10:10:28,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:28,267 INFO L475 AbstractCegarLoop]: Abstraction has 5155 states and 7328 transitions. [2019-08-05 10:10:28,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:10:28,267 INFO L276 IsEmpty]: Start isEmpty. Operand 5155 states and 7328 transitions. [2019-08-05 10:10:28,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-08-05 10:10:28,269 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:28,269 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:28,269 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:28,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:28,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1148551150, now seen corresponding path program 1 times [2019-08-05 10:10:28,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:28,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:10:28,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:28,440 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 126 proven. 4 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-08-05 10:10:28,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:28,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:10:28,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:10:28,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:10:28,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:10:28,442 INFO L87 Difference]: Start difference. First operand 5155 states and 7328 transitions. Second operand 4 states. [2019-08-05 10:10:29,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:29,846 INFO L93 Difference]: Finished difference Result 11604 states and 16347 transitions. [2019-08-05 10:10:29,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:10:29,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-08-05 10:10:29,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:29,866 INFO L225 Difference]: With dead ends: 11604 [2019-08-05 10:10:29,866 INFO L226 Difference]: Without dead ends: 11556 [2019-08-05 10:10:29,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:10:29,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11556 states. [2019-08-05 10:10:29,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11556 to 10967. [2019-08-05 10:10:29,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10967 states. [2019-08-05 10:10:30,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10967 states to 10967 states and 15524 transitions. [2019-08-05 10:10:30,088 INFO L78 Accepts]: Start accepts. Automaton has 10967 states and 15524 transitions. Word has length 130 [2019-08-05 10:10:30,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:30,088 INFO L475 AbstractCegarLoop]: Abstraction has 10967 states and 15524 transitions. [2019-08-05 10:10:30,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:10:30,088 INFO L276 IsEmpty]: Start isEmpty. Operand 10967 states and 15524 transitions. [2019-08-05 10:10:30,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-08-05 10:10:30,091 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:30,091 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:30,092 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:30,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:30,094 INFO L82 PathProgramCache]: Analyzing trace with hash -2126953540, now seen corresponding path program 1 times [2019-08-05 10:10:30,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:30,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:10:30,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:30,220 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-08-05 10:10:30,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:30,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:10:30,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:10:30,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:10:30,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:30,222 INFO L87 Difference]: Start difference. First operand 10967 states and 15524 transitions. Second operand 3 states. [2019-08-05 10:10:30,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:30,754 INFO L93 Difference]: Finished difference Result 15551 states and 21862 transitions. [2019-08-05 10:10:30,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:10:30,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-08-05 10:10:30,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:30,778 INFO L225 Difference]: With dead ends: 15551 [2019-08-05 10:10:30,779 INFO L226 Difference]: Without dead ends: 15455 [2019-08-05 10:10:30,779 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 131 SyntacticMatches, 1 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:10:30,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15455 states. [2019-08-05 10:10:30,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15455 to 15373. [2019-08-05 10:10:30,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15373 states. [2019-08-05 10:10:30,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15373 states to 15373 states and 21682 transitions. [2019-08-05 10:10:30,968 INFO L78 Accepts]: Start accepts. Automaton has 15373 states and 21682 transitions. Word has length 134 [2019-08-05 10:10:30,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:30,969 INFO L475 AbstractCegarLoop]: Abstraction has 15373 states and 21682 transitions. [2019-08-05 10:10:30,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:10:30,969 INFO L276 IsEmpty]: Start isEmpty. Operand 15373 states and 21682 transitions. [2019-08-05 10:10:30,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-08-05 10:10:30,971 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:30,971 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:30,972 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:30,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:30,972 INFO L82 PathProgramCache]: Analyzing trace with hash 887643078, now seen corresponding path program 1 times [2019-08-05 10:10:30,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:31,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:10:31,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:31,079 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-08-05 10:10:31,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:31,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:10:31,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:10:31,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:10:31,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:31,081 INFO L87 Difference]: Start difference. First operand 15373 states and 21682 transitions. Second operand 3 states. [2019-08-05 10:10:31,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:31,384 INFO L93 Difference]: Finished difference Result 20487 states and 28307 transitions. [2019-08-05 10:10:31,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:10:31,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-08-05 10:10:31,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:31,840 INFO L225 Difference]: With dead ends: 20487 [2019-08-05 10:10:31,840 INFO L226 Difference]: Without dead ends: 20487 [2019-08-05 10:10:31,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 135 SyntacticMatches, 1 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:10:31,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20487 states. [2019-08-05 10:10:32,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20487 to 20051. [2019-08-05 10:10:32,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20051 states. [2019-08-05 10:10:32,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20051 states to 20051 states and 27873 transitions. [2019-08-05 10:10:32,026 INFO L78 Accepts]: Start accepts. Automaton has 20051 states and 27873 transitions. Word has length 138 [2019-08-05 10:10:32,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:32,026 INFO L475 AbstractCegarLoop]: Abstraction has 20051 states and 27873 transitions. [2019-08-05 10:10:32,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:10:32,027 INFO L276 IsEmpty]: Start isEmpty. Operand 20051 states and 27873 transitions. [2019-08-05 10:10:32,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-08-05 10:10:32,029 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:32,029 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:32,030 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:32,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:32,030 INFO L82 PathProgramCache]: Analyzing trace with hash 11293620, now seen corresponding path program 1 times [2019-08-05 10:10:32,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:32,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:10:32,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:32,190 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,191 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,191 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,192 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,192 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,192 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,193 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,193 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,194 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,195 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,195 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,477 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,477 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,478 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,479 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,480 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,481 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,481 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,482 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,483 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,483 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,682 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 5 [2019-08-05 10:10:32,704 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,705 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,706 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,707 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,707 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,708 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,708 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,709 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,709 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,710 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,710 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,924 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 9 [2019-08-05 10:10:32,929 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,930 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,930 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,931 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,931 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,931 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,932 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,933 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,933 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,934 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:32,934 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:33,375 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-08-05 10:10:33,708 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-08-05 10:10:33,949 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-08-05 10:10:34,171 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-08-05 10:10:34,385 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-08-05 10:10:34,579 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-08-05 10:10:34,767 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-08-05 10:10:34,949 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-08-05 10:10:35,124 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-08-05 10:10:35,126 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:10:35,247 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 20 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:10:35,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:35,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:10:35,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:10:35,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:10:35,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:10:35,248 INFO L87 Difference]: Start difference. First operand 20051 states and 27873 transitions. Second operand 20 states. [2019-08-05 10:10:36,459 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-08-05 10:10:36,899 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-08-05 10:10:37,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:37,167 INFO L93 Difference]: Finished difference Result 21935 states and 30075 transitions. [2019-08-05 10:10:37,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:10:37,168 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 139 [2019-08-05 10:10:37,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:37,191 INFO L225 Difference]: With dead ends: 21935 [2019-08-05 10:10:37,191 INFO L226 Difference]: Without dead ends: 21935 [2019-08-05 10:10:37,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=306, Invalid=624, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:10:37,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21935 states. [2019-08-05 10:10:37,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21935 to 21838. [2019-08-05 10:10:37,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21838 states. [2019-08-05 10:10:37,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21838 states to 21838 states and 29978 transitions. [2019-08-05 10:10:37,425 INFO L78 Accepts]: Start accepts. Automaton has 21838 states and 29978 transitions. Word has length 139 [2019-08-05 10:10:37,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:37,425 INFO L475 AbstractCegarLoop]: Abstraction has 21838 states and 29978 transitions. [2019-08-05 10:10:37,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:10:37,426 INFO L276 IsEmpty]: Start isEmpty. Operand 21838 states and 29978 transitions. [2019-08-05 10:10:37,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-08-05 10:10:37,428 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:37,428 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:37,428 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:37,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:37,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1823249627, now seen corresponding path program 1 times [2019-08-05 10:10:37,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:37,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:37,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:10:37,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:37,613 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:10:37,615 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:37,615 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:37,615 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:37,616 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:37,616 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:37,617 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:37,618 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:37,618 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:37,619 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:37,623 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:37,624 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:37,741 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:37,742 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:37,742 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:37,743 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:37,744 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:37,745 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:37,745 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:37,746 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:37,747 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:37,748 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:37,748 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:37,787 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:37,789 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:37,789 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:37,790 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:37,791 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:37,792 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:37,796 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:37,796 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:37,797 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:37,798 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:37,799 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:38,011 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:38,012 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:38,013 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:38,013 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:38,014 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:38,014 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:38,015 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:38,015 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:38,016 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:38,017 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:38,505 WARN L188 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 5 [2019-08-05 10:10:38,659 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 10:10:38,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:38,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:10:38,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:10:38,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:10:38,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:10:38,661 INFO L87 Difference]: Start difference. First operand 21838 states and 29978 transitions. Second operand 7 states. [2019-08-05 10:10:39,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:39,038 INFO L93 Difference]: Finished difference Result 23920 states and 32548 transitions. [2019-08-05 10:10:39,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:10:39,038 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-08-05 10:10:39,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:39,058 INFO L225 Difference]: With dead ends: 23920 [2019-08-05 10:10:39,058 INFO L226 Difference]: Without dead ends: 23920 [2019-08-05 10:10:39,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:10:39,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23920 states. [2019-08-05 10:10:39,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23920 to 23546. [2019-08-05 10:10:39,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23546 states. [2019-08-05 10:10:39,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23546 states to 23546 states and 32116 transitions. [2019-08-05 10:10:39,275 INFO L78 Accepts]: Start accepts. Automaton has 23546 states and 32116 transitions. Word has length 143 [2019-08-05 10:10:39,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:39,275 INFO L475 AbstractCegarLoop]: Abstraction has 23546 states and 32116 transitions. [2019-08-05 10:10:39,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:10:39,275 INFO L276 IsEmpty]: Start isEmpty. Operand 23546 states and 32116 transitions. [2019-08-05 10:10:39,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-08-05 10:10:39,277 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:39,277 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:39,278 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:39,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:39,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1330469809, now seen corresponding path program 1 times [2019-08-05 10:10:39,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:39,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:10:39,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:39,583 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 134 proven. 4 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-08-05 10:10:39,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:39,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:10:39,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:10:39,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:10:39,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:10:39,584 INFO L87 Difference]: Start difference. First operand 23546 states and 32116 transitions. Second operand 5 states. [2019-08-05 10:10:39,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:39,867 INFO L93 Difference]: Finished difference Result 24324 states and 33161 transitions. [2019-08-05 10:10:39,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:10:39,868 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2019-08-05 10:10:39,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:39,887 INFO L225 Difference]: With dead ends: 24324 [2019-08-05 10:10:39,888 INFO L226 Difference]: Without dead ends: 24317 [2019-08-05 10:10:39,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:10:39,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24317 states. [2019-08-05 10:10:40,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24317 to 24035. [2019-08-05 10:10:40,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24035 states. [2019-08-05 10:10:40,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24035 states to 24035 states and 32686 transitions. [2019-08-05 10:10:40,160 INFO L78 Accepts]: Start accepts. Automaton has 24035 states and 32686 transitions. Word has length 143 [2019-08-05 10:10:40,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:40,160 INFO L475 AbstractCegarLoop]: Abstraction has 24035 states and 32686 transitions. [2019-08-05 10:10:40,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:10:40,161 INFO L276 IsEmpty]: Start isEmpty. Operand 24035 states and 32686 transitions. [2019-08-05 10:10:40,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-08-05 10:10:40,166 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:40,166 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:40,166 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:40,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:40,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1674424068, now seen corresponding path program 1 times [2019-08-05 10:10:40,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:40,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:10:40,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:40,262 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-08-05 10:10:40,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:40,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:10:40,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:10:40,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:10:40,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:40,263 INFO L87 Difference]: Start difference. First operand 24035 states and 32686 transitions. Second operand 3 states. [2019-08-05 10:10:40,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:40,476 INFO L93 Difference]: Finished difference Result 28005 states and 37776 transitions. [2019-08-05 10:10:40,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:10:40,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-08-05 10:10:40,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:40,502 INFO L225 Difference]: With dead ends: 28005 [2019-08-05 10:10:40,502 INFO L226 Difference]: Without dead ends: 27932 [2019-08-05 10:10:40,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 168 SyntacticMatches, 1 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:10:40,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27932 states. [2019-08-05 10:10:40,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27932 to 27882. [2019-08-05 10:10:40,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27882 states. [2019-08-05 10:10:40,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27882 states to 27882 states and 37631 transitions. [2019-08-05 10:10:40,703 INFO L78 Accepts]: Start accepts. Automaton has 27882 states and 37631 transitions. Word has length 171 [2019-08-05 10:10:40,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:40,703 INFO L475 AbstractCegarLoop]: Abstraction has 27882 states and 37631 transitions. [2019-08-05 10:10:40,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:10:40,704 INFO L276 IsEmpty]: Start isEmpty. Operand 27882 states and 37631 transitions. [2019-08-05 10:10:40,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-08-05 10:10:40,709 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:40,709 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 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:10:40,709 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:40,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:40,709 INFO L82 PathProgramCache]: Analyzing trace with hash -110644143, now seen corresponding path program 1 times [2019-08-05 10:10:40,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:40,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:10:40,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:40,814 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-08-05 10:10:40,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:40,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:10:40,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:10:40,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:10:40,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:40,816 INFO L87 Difference]: Start difference. First operand 27882 states and 37631 transitions. Second operand 3 states. [2019-08-05 10:10:41,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:41,050 INFO L93 Difference]: Finished difference Result 31872 states and 42931 transitions. [2019-08-05 10:10:41,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:10:41,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-08-05 10:10:41,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:41,078 INFO L225 Difference]: With dead ends: 31872 [2019-08-05 10:10:41,078 INFO L226 Difference]: Without dead ends: 31824 [2019-08-05 10:10:41,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 170 SyntacticMatches, 1 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:10:41,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31824 states. [2019-08-05 10:10:41,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31824 to 29962. [2019-08-05 10:10:41,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29962 states. [2019-08-05 10:10:41,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29962 states to 29962 states and 40395 transitions. [2019-08-05 10:10:41,431 INFO L78 Accepts]: Start accepts. Automaton has 29962 states and 40395 transitions. Word has length 173 [2019-08-05 10:10:41,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:41,432 INFO L475 AbstractCegarLoop]: Abstraction has 29962 states and 40395 transitions. [2019-08-05 10:10:41,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:10:41,432 INFO L276 IsEmpty]: Start isEmpty. Operand 29962 states and 40395 transitions. [2019-08-05 10:10:41,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-08-05 10:10:41,436 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:41,436 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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:10:41,436 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:41,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:41,437 INFO L82 PathProgramCache]: Analyzing trace with hash 369991458, now seen corresponding path program 1 times [2019-08-05 10:10:41,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:41,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:41,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:10:41,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:41,603 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,603 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,604 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,604 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,604 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,605 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,605 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,605 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,606 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,606 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,606 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,723 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,724 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,724 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,724 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,725 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,725 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,726 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,726 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,727 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,727 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,728 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,774 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,777 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,777 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,778 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,778 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,779 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,779 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,780 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,780 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,781 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,782 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,992 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,993 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,994 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,995 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,995 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,996 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,997 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,998 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:41,998 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:42,002 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:43,336 WARN L188 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 58 DAG size of output: 5 [2019-08-05 10:10:43,481 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:43,482 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:43,482 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:43,482 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:43,483 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:43,484 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:43,485 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:43,485 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:43,486 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:43,486 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:43,487 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:43,605 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-08-05 10:10:43,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:43,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:10:43,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:10:43,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:10:43,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:10:43,606 INFO L87 Difference]: Start difference. First operand 29962 states and 40395 transitions. Second operand 8 states. [2019-08-05 10:10:44,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:44,033 INFO L93 Difference]: Finished difference Result 34159 states and 45568 transitions. [2019-08-05 10:10:44,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:10:44,033 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 174 [2019-08-05 10:10:44,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:44,063 INFO L225 Difference]: With dead ends: 34159 [2019-08-05 10:10:44,063 INFO L226 Difference]: Without dead ends: 34159 [2019-08-05 10:10:44,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 164 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:10:44,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34159 states. [2019-08-05 10:10:45,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34159 to 33905. [2019-08-05 10:10:45,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33905 states. [2019-08-05 10:10:45,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33905 states to 33905 states and 45314 transitions. [2019-08-05 10:10:45,183 INFO L78 Accepts]: Start accepts. Automaton has 33905 states and 45314 transitions. Word has length 174 [2019-08-05 10:10:45,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:45,183 INFO L475 AbstractCegarLoop]: Abstraction has 33905 states and 45314 transitions. [2019-08-05 10:10:45,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:10:45,184 INFO L276 IsEmpty]: Start isEmpty. Operand 33905 states and 45314 transitions. [2019-08-05 10:10:45,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-08-05 10:10:45,187 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:45,187 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:45,187 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:45,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:45,188 INFO L82 PathProgramCache]: Analyzing trace with hash 570429234, now seen corresponding path program 1 times [2019-08-05 10:10:45,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:45,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:10:45,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:45,833 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 194 proven. 70 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-08-05 10:10:45,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:45,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:10:45,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:10:45,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:10:45,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:10:45,835 INFO L87 Difference]: Start difference. First operand 33905 states and 45314 transitions. Second operand 8 states. [2019-08-05 10:10:46,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:46,406 INFO L93 Difference]: Finished difference Result 63378 states and 85380 transitions. [2019-08-05 10:10:46,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:10:46,406 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 175 [2019-08-05 10:10:46,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:46,464 INFO L225 Difference]: With dead ends: 63378 [2019-08-05 10:10:46,464 INFO L226 Difference]: Without dead ends: 63288 [2019-08-05 10:10:46,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:10:46,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63288 states. [2019-08-05 10:10:46,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63288 to 47156. [2019-08-05 10:10:46,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47156 states. [2019-08-05 10:10:46,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47156 states to 47156 states and 64161 transitions. [2019-08-05 10:10:46,883 INFO L78 Accepts]: Start accepts. Automaton has 47156 states and 64161 transitions. Word has length 175 [2019-08-05 10:10:46,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:46,884 INFO L475 AbstractCegarLoop]: Abstraction has 47156 states and 64161 transitions. [2019-08-05 10:10:46,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:10:46,884 INFO L276 IsEmpty]: Start isEmpty. Operand 47156 states and 64161 transitions. [2019-08-05 10:10:46,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-08-05 10:10:46,887 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:46,887 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 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:10:46,888 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:46,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:46,888 INFO L82 PathProgramCache]: Analyzing trace with hash -758038053, now seen corresponding path program 1 times [2019-08-05 10:10:46,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:46,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:46,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:10:46,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:47,106 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:10:47,109 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,110 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,110 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,111 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,111 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,112 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,112 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,113 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,113 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,114 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,114 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,826 WARN L188 SmtUtils]: Spent 658.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 11 [2019-08-05 10:10:47,862 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,863 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,863 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,863 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,864 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,864 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,864 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,865 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,865 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,866 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,103 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 5 [2019-08-05 10:10:48,173 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,173 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,174 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,175 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,175 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,176 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,176 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,177 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,178 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,179 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,179 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,397 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 9 [2019-08-05 10:10:48,449 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,449 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,450 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,450 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,450 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,451 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,451 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,451 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,452 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,452 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,453 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,890 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-08-05 10:10:49,143 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-08-05 10:10:49,381 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-08-05 10:10:49,633 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-08-05 10:10:49,836 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-08-05 10:10:50,029 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-08-05 10:10:50,237 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-08-05 10:10:50,425 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-08-05 10:10:50,569 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-08-05 10:10:50,570 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:10:50,645 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,645 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,645 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,646 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,806 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 4 proven. 282 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 10:10:50,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:50,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:10:50,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:10:50,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:10:50,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:10:50,807 INFO L87 Difference]: Start difference. First operand 47156 states and 64161 transitions. Second operand 23 states. [2019-08-05 10:10:51,462 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 27 [2019-08-05 10:10:51,661 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-08-05 10:10:53,187 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-08-05 10:10:54,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:54,120 INFO L93 Difference]: Finished difference Result 58363 states and 78277 transitions. [2019-08-05 10:10:54,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:10:54,121 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 177 [2019-08-05 10:10:54,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:54,174 INFO L225 Difference]: With dead ends: 58363 [2019-08-05 10:10:54,174 INFO L226 Difference]: Without dead ends: 58363 [2019-08-05 10:10:54,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:10:54,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58363 states. [2019-08-05 10:10:54,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58363 to 54535. [2019-08-05 10:10:54,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54535 states. [2019-08-05 10:10:54,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54535 states to 54535 states and 73601 transitions. [2019-08-05 10:10:54,615 INFO L78 Accepts]: Start accepts. Automaton has 54535 states and 73601 transitions. Word has length 177 [2019-08-05 10:10:54,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:54,616 INFO L475 AbstractCegarLoop]: Abstraction has 54535 states and 73601 transitions. [2019-08-05 10:10:54,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:10:54,616 INFO L276 IsEmpty]: Start isEmpty. Operand 54535 states and 73601 transitions. [2019-08-05 10:10:54,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-08-05 10:10:54,619 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:54,619 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:54,620 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:54,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:54,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1753462791, now seen corresponding path program 1 times [2019-08-05 10:10:54,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:54,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:10:54,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:54,825 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:10:54,826 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:54,827 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:54,827 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:54,828 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:54,828 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:54,829 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:54,829 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:54,830 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:54,831 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:54,831 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:54,832 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:55,059 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 11 [2019-08-05 10:10:55,122 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:55,122 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:55,123 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:55,123 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:55,124 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:55,124 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:55,125 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:55,125 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:55,126 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:55,126 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:55,274 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 8 [2019-08-05 10:10:55,287 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:55,288 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:55,288 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:55,289 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:55,289 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:55,289 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:55,290 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:55,290 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:55,290 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:55,291 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:55,291 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:55,465 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:55,465 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:55,466 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:55,466 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:55,466 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:55,467 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:55,467 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:55,468 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:55,468 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:55,468 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:55,469 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:55,806 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 83 [2019-08-05 10:10:56,158 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2019-08-05 10:10:56,445 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2019-08-05 10:10:56,719 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-08-05 10:10:56,964 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-08-05 10:10:57,179 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-08-05 10:10:57,438 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-08-05 10:10:57,671 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-08-05 10:10:57,835 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-08-05 10:10:58,130 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:58,131 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:58,131 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:58,131 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:58,132 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:58,132 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:58,304 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:10:58,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:58,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:10:58,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:10:58,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:10:58,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:10:58,305 INFO L87 Difference]: Start difference. First operand 54535 states and 73601 transitions. Second operand 21 states. [2019-08-05 10:10:59,025 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-08-05 10:10:59,474 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 32 [2019-08-05 10:10:59,934 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2019-08-05 10:11:01,913 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-08-05 10:11:02,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:02,051 INFO L93 Difference]: Finished difference Result 113096 states and 154767 transitions. [2019-08-05 10:11:02,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:11:02,051 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 178 [2019-08-05 10:11:02,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:02,167 INFO L225 Difference]: With dead ends: 113096 [2019-08-05 10:11:02,167 INFO L226 Difference]: Without dead ends: 112736 [2019-08-05 10:11:02,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=448, Invalid=958, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:11:02,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112736 states. [2019-08-05 10:11:04,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112736 to 96327. [2019-08-05 10:11:04,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96327 states. [2019-08-05 10:11:04,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96327 states to 96327 states and 133572 transitions. [2019-08-05 10:11:04,204 INFO L78 Accepts]: Start accepts. Automaton has 96327 states and 133572 transitions. Word has length 178 [2019-08-05 10:11:04,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:04,205 INFO L475 AbstractCegarLoop]: Abstraction has 96327 states and 133572 transitions. [2019-08-05 10:11:04,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:11:04,205 INFO L276 IsEmpty]: Start isEmpty. Operand 96327 states and 133572 transitions. [2019-08-05 10:11:04,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-08-05 10:11:04,210 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:04,211 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:11:04,211 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:04,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:04,211 INFO L82 PathProgramCache]: Analyzing trace with hash -275131603, now seen corresponding path program 1 times [2019-08-05 10:11:04,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:04,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:11:04,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:04,301 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-08-05 10:11:04,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:04,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:11:04,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:11:04,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:11:04,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:11:04,302 INFO L87 Difference]: Start difference. First operand 96327 states and 133572 transitions. Second operand 3 states. [2019-08-05 10:11:04,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:04,545 INFO L93 Difference]: Finished difference Result 95069 states and 126139 transitions. [2019-08-05 10:11:04,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:11:04,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-08-05 10:11:04,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:04,637 INFO L225 Difference]: With dead ends: 95069 [2019-08-05 10:11:04,637 INFO L226 Difference]: Without dead ends: 94961 [2019-08-05 10:11:04,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 191 SyntacticMatches, 1 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:11:04,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94961 states. [2019-08-05 10:11:06,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94961 to 82776. [2019-08-05 10:11:06,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82776 states. [2019-08-05 10:11:07,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82776 states to 82776 states and 110950 transitions. [2019-08-05 10:11:07,014 INFO L78 Accepts]: Start accepts. Automaton has 82776 states and 110950 transitions. Word has length 194 [2019-08-05 10:11:07,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:07,014 INFO L475 AbstractCegarLoop]: Abstraction has 82776 states and 110950 transitions. [2019-08-05 10:11:07,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:11:07,014 INFO L276 IsEmpty]: Start isEmpty. Operand 82776 states and 110950 transitions. [2019-08-05 10:11:07,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-08-05 10:11:07,019 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:07,019 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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:11:07,019 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:07,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:07,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1621474027, now seen corresponding path program 1 times [2019-08-05 10:11:07,022 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:07,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:11:07,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:07,227 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 142 proven. 187 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-08-05 10:11:07,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:11:07,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:11:07,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:11:07,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:11:07,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:11:07,229 INFO L87 Difference]: Start difference. First operand 82776 states and 110950 transitions. Second operand 6 states. [2019-08-05 10:11:08,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:08,086 INFO L93 Difference]: Finished difference Result 121007 states and 162480 transitions. [2019-08-05 10:11:08,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:11:08,087 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 195 [2019-08-05 10:11:08,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:08,210 INFO L225 Difference]: With dead ends: 121007 [2019-08-05 10:11:08,210 INFO L226 Difference]: Without dead ends: 121007 [2019-08-05 10:11:08,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:11:08,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121007 states. [2019-08-05 10:11:09,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121007 to 80963. [2019-08-05 10:11:09,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80963 states. [2019-08-05 10:11:09,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80963 states to 80963 states and 108836 transitions. [2019-08-05 10:11:09,480 INFO L78 Accepts]: Start accepts. Automaton has 80963 states and 108836 transitions. Word has length 195 [2019-08-05 10:11:09,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:09,481 INFO L475 AbstractCegarLoop]: Abstraction has 80963 states and 108836 transitions. [2019-08-05 10:11:09,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:11:09,481 INFO L276 IsEmpty]: Start isEmpty. Operand 80963 states and 108836 transitions. [2019-08-05 10:11:09,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-08-05 10:11:09,488 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:09,488 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:11:09,488 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:09,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:09,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1319648849, now seen corresponding path program 1 times [2019-08-05 10:11:09,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:09,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:11:09,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:09,656 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 210 proven. 128 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-08-05 10:11:09,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:11:09,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:11:09,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:11:09,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:11:09,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:11:09,657 INFO L87 Difference]: Start difference. First operand 80963 states and 108836 transitions. Second operand 8 states. [2019-08-05 10:11:10,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:10,387 INFO L93 Difference]: Finished difference Result 132802 states and 175058 transitions. [2019-08-05 10:11:10,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:11:10,387 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 196 [2019-08-05 10:11:10,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:10,519 INFO L225 Difference]: With dead ends: 132802 [2019-08-05 10:11:10,519 INFO L226 Difference]: Without dead ends: 132541 [2019-08-05 10:11:10,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:11:10,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132541 states. [2019-08-05 10:11:14,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132541 to 123203. [2019-08-05 10:11:14,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123203 states. [2019-08-05 10:11:14,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123203 states to 123203 states and 162773 transitions. [2019-08-05 10:11:14,336 INFO L78 Accepts]: Start accepts. Automaton has 123203 states and 162773 transitions. Word has length 196 [2019-08-05 10:11:14,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:14,337 INFO L475 AbstractCegarLoop]: Abstraction has 123203 states and 162773 transitions. [2019-08-05 10:11:14,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:11:14,337 INFO L276 IsEmpty]: Start isEmpty. Operand 123203 states and 162773 transitions. [2019-08-05 10:11:14,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-08-05 10:11:14,342 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:14,342 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 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:11:14,342 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:14,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:14,343 INFO L82 PathProgramCache]: Analyzing trace with hash 2127775696, now seen corresponding path program 1 times [2019-08-05 10:11:14,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:14,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:11:14,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:14,462 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-08-05 10:11:14,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:14,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:11:14,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:11:14,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:11:14,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:11:14,463 INFO L87 Difference]: Start difference. First operand 123203 states and 162773 transitions. Second operand 3 states. [2019-08-05 10:11:14,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:14,924 INFO L93 Difference]: Finished difference Result 161584 states and 212187 transitions. [2019-08-05 10:11:14,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:11:14,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-08-05 10:11:14,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:15,096 INFO L225 Difference]: With dead ends: 161584 [2019-08-05 10:11:15,096 INFO L226 Difference]: Without dead ends: 159978 [2019-08-05 10:11:15,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 197 SyntacticMatches, 1 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:11:15,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159978 states. [2019-08-05 10:11:16,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159978 to 159976. [2019-08-05 10:11:16,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159976 states. [2019-08-05 10:11:16,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159976 states to 159976 states and 209775 transitions. [2019-08-05 10:11:16,873 INFO L78 Accepts]: Start accepts. Automaton has 159976 states and 209775 transitions. Word has length 200 [2019-08-05 10:11:16,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:16,873 INFO L475 AbstractCegarLoop]: Abstraction has 159976 states and 209775 transitions. [2019-08-05 10:11:16,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:11:16,874 INFO L276 IsEmpty]: Start isEmpty. Operand 159976 states and 209775 transitions. [2019-08-05 10:11:16,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-08-05 10:11:16,877 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:16,877 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 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:11:16,878 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:16,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:16,878 INFO L82 PathProgramCache]: Analyzing trace with hash -67160481, now seen corresponding path program 1 times [2019-08-05 10:11:16,881 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:16,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:16,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:11:16,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:17,092 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:17,092 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:17,093 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:17,093 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:17,094 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:17,094 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:17,095 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:17,095 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:17,096 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:17,097 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:17,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:17,557 WARN L188 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 9 [2019-08-05 10:11:18,033 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 9 [2019-08-05 10:11:18,085 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:18,085 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:18,086 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:18,088 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:18,089 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:18,089 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:18,090 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:18,091 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:18,093 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:18,094 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:18,239 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:18,240 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:18,240 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:18,241 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:18,241 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:18,242 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:18,243 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:18,243 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:18,243 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:18,244 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:18,244 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:18,331 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:18,332 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:18,332 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:18,332 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:18,333 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:18,333 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:18,333 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:18,334 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:18,334 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:18,334 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:18,335 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:18,697 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-08-05 10:11:18,961 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-08-05 10:11:19,202 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-08-05 10:11:19,421 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-08-05 10:11:19,628 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-08-05 10:11:19,815 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-08-05 10:11:19,983 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-08-05 10:11:20,142 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-08-05 10:11:20,300 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-08-05 10:11:20,301 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:11:20,373 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:20,373 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:20,374 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:20,374 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:20,448 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:20,449 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:20,449 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:20,450 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:20,450 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:20,451 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:20,451 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:20,452 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:20,452 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:20,453 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:20,453 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:20,862 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 20 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:11:20,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:11:20,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:11:20,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:11:20,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:11:20,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=652, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:11:20,864 INFO L87 Difference]: Start difference. First operand 159976 states and 209775 transitions. Second operand 30 states. [2019-08-05 10:11:21,711 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-08-05 10:11:24,142 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-08-05 10:11:24,925 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-08-05 10:11:25,155 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-08-05 10:11:25,767 WARN L188 SmtUtils]: Spent 562.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-08-05 10:11:27,335 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-08-05 10:11:28,017 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-08-05 10:11:28,349 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-08-05 10:11:28,540 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-08-05 10:11:28,689 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-08-05 10:11:28,945 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-08-05 10:11:29,288 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-08-05 10:11:29,667 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-08-05 10:11:30,088 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-08-05 10:11:32,296 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-08-05 10:11:32,549 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-08-05 10:11:32,941 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-08-05 10:11:33,301 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-08-05 10:11:36,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:36,258 INFO L93 Difference]: Finished difference Result 881905 states and 1179725 transitions. [2019-08-05 10:11:36,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:11:36,259 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 203 [2019-08-05 10:11:36,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:37,599 INFO L225 Difference]: With dead ends: 881905 [2019-08-05 10:11:37,600 INFO L226 Difference]: Without dead ends: 878241 [2019-08-05 10:11:37,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4018 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=2667, Invalid=7839, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:11:38,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878241 states. [2019-08-05 10:11:51,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878241 to 601305. [2019-08-05 10:11:51,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601305 states. [2019-08-05 10:12:00,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601305 states to 601305 states and 824708 transitions. [2019-08-05 10:12:00,162 INFO L78 Accepts]: Start accepts. Automaton has 601305 states and 824708 transitions. Word has length 203 [2019-08-05 10:12:00,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:00,163 INFO L475 AbstractCegarLoop]: Abstraction has 601305 states and 824708 transitions. [2019-08-05 10:12:00,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:12:00,163 INFO L276 IsEmpty]: Start isEmpty. Operand 601305 states and 824708 transitions. [2019-08-05 10:12:00,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-08-05 10:12:00,168 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:00,169 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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:12:00,169 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:00,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:00,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1638698119, now seen corresponding path program 1 times [2019-08-05 10:12:00,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:00,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:00,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:12:00,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:00,343 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,343 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,343 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,344 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,344 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,345 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,345 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,346 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,346 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,346 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,347 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,450 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,451 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,451 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,451 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,452 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,452 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,453 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,453 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,453 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,454 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,454 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,492 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,493 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,493 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,494 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,494 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,494 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,495 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,495 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,495 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,496 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,496 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,657 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,658 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,659 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,659 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,660 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,661 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,661 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,662 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,662 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,663 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,970 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 11 [2019-08-05 10:12:01,044 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:01,045 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:01,045 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:01,046 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:01,046 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:01,046 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:01,046 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:01,047 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:01,047 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:01,048 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:01,048 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:01,122 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:01,122 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:01,123 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:01,124 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:01,124 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:01,125 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:01,125 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:01,126 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:01,326 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 31 proven. 378 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-08-05 10:12:01,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:01,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:12:01,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:12:01,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:12:01,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:12:01,327 INFO L87 Difference]: Start difference. First operand 601305 states and 824708 transitions. Second operand 16 states. [2019-08-05 10:12:05,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:05,652 INFO L93 Difference]: Finished difference Result 602781 states and 826305 transitions. [2019-08-05 10:12:05,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:12:05,653 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 204 [2019-08-05 10:12:05,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:06,483 INFO L225 Difference]: With dead ends: 602781 [2019-08-05 10:12:06,483 INFO L226 Difference]: Without dead ends: 602781 [2019-08-05 10:12:06,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 187 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=179, Invalid=751, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:12:06,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602781 states. [2019-08-05 10:12:20,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602781 to 601502. [2019-08-05 10:12:20,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601502 states. [2019-08-05 10:12:21,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601502 states to 601502 states and 824928 transitions. [2019-08-05 10:12:21,735 INFO L78 Accepts]: Start accepts. Automaton has 601502 states and 824928 transitions. Word has length 204 [2019-08-05 10:12:21,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:21,736 INFO L475 AbstractCegarLoop]: Abstraction has 601502 states and 824928 transitions. [2019-08-05 10:12:21,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:12:21,736 INFO L276 IsEmpty]: Start isEmpty. Operand 601502 states and 824928 transitions. [2019-08-05 10:12:21,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-08-05 10:12:21,741 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:21,741 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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:12:21,741 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:21,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:21,741 INFO L82 PathProgramCache]: Analyzing trace with hash -733642234, now seen corresponding path program 1 times [2019-08-05 10:12:21,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:21,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:12:21,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:21,919 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:21,919 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:21,919 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:21,920 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:21,920 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:21,920 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:21,920 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:21,921 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:21,921 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:21,921 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:21,922 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,029 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,029 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,029 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,030 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,030 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,030 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,031 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,031 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,031 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,110 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,111 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,112 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,112 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,112 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,113 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,113 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,114 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,114 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,115 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,115 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,189 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,190 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,190 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,190 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,191 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,191 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,192 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,192 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,193 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,193 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,374 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,374 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,375 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,375 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,375 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,375 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,376 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,376 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,377 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,377 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,378 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,438 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,439 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,440 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,440 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,441 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,441 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,441 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,441 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,442 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,442 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,443 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,626 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2019-08-05 10:12:30,146 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 0 proven. 314 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-08-05 10:12:30,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:30,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:12:30,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:12:30,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:12:30,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:12:30,148 INFO L87 Difference]: Start difference. First operand 601502 states and 824928 transitions. Second operand 19 states. [2019-08-05 10:12:35,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:35,551 INFO L93 Difference]: Finished difference Result 997196 states and 1342884 transitions. [2019-08-05 10:12:35,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:12:35,552 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 204 [2019-08-05 10:12:35,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:37,082 INFO L225 Difference]: With dead ends: 997196 [2019-08-05 10:12:37,083 INFO L226 Difference]: Without dead ends: 991220 [2019-08-05 10:12:37,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 182 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=361, Invalid=569, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:12:38,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991220 states. [2019-08-05 10:12:54,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991220 to 862682. [2019-08-05 10:12:54,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 862682 states. [2019-08-05 10:13:07,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862682 states to 862682 states and 1176419 transitions. [2019-08-05 10:13:07,247 INFO L78 Accepts]: Start accepts. Automaton has 862682 states and 1176419 transitions. Word has length 204 [2019-08-05 10:13:07,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:07,247 INFO L475 AbstractCegarLoop]: Abstraction has 862682 states and 1176419 transitions. [2019-08-05 10:13:07,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:13:07,247 INFO L276 IsEmpty]: Start isEmpty. Operand 862682 states and 1176419 transitions. [2019-08-05 10:13:07,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-08-05 10:13:07,252 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:07,252 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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:13:07,252 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:07,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:07,253 INFO L82 PathProgramCache]: Analyzing trace with hash -402574455, now seen corresponding path program 1 times [2019-08-05 10:13:07,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:07,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:13:07,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:07,368 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-08-05 10:13:07,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:07,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:13:07,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:13:07,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:13:07,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:13:07,369 INFO L87 Difference]: Start difference. First operand 862682 states and 1176419 transitions. Second operand 3 states. [2019-08-05 10:13:11,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:11,167 INFO L93 Difference]: Finished difference Result 849081 states and 1134808 transitions. [2019-08-05 10:13:11,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:13:11,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-08-05 10:13:11,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:12,462 INFO L225 Difference]: With dead ends: 849081 [2019-08-05 10:13:12,462 INFO L226 Difference]: Without dead ends: 826369 [2019-08-05 10:13:12,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 203 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 Received shutdown request... [2019-08-05 10:13:23,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826369 states. [2019-08-05 10:13:23,633 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:13:23,636 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:13:23,636 INFO L202 PluginConnector]: Adding new model u2b07_batman_intermittent_power_600.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:13:23 BoogieIcfgContainer [2019-08-05 10:13:23,636 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:13:23,638 INFO L168 Benchmark]: Toolchain (without parser) took 192344.87 ms. Allocated memory was 134.2 MB in the beginning and 4.7 GB in the end (delta: 4.6 GB). Free memory was 107.1 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 4.8 GB. Max. memory is 7.1 GB. [2019-08-05 10:13:23,639 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 134.2 MB. Free memory was 112.0 MB in the beginning and 111.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:13:23,640 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.34 ms. Allocated memory is still 134.2 MB. Free memory was 107.1 MB in the beginning and 104.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:13:23,640 INFO L168 Benchmark]: Boogie Preprocessor took 91.18 ms. Allocated memory is still 134.2 MB. Free memory was 104.8 MB in the beginning and 101.2 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:13:23,641 INFO L168 Benchmark]: RCFGBuilder took 4120.92 ms. Allocated memory was 134.2 MB in the beginning and 197.1 MB in the end (delta: 62.9 MB). Free memory was 101.2 MB in the beginning and 134.1 MB in the end (delta: -32.9 MB). Peak memory consumption was 85.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:13:23,641 INFO L168 Benchmark]: TraceAbstraction took 188078.37 ms. Allocated memory was 197.1 MB in the beginning and 4.7 GB in the end (delta: 4.5 GB). Free memory was 134.1 MB in the beginning and 2.7 GB in the end (delta: -2.5 GB). Peak memory consumption was 4.7 GB. Max. memory is 7.1 GB. [2019-08-05 10:13:23,645 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 134.2 MB. Free memory was 112.0 MB in the beginning and 111.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 50.34 ms. Allocated memory is still 134.2 MB. Free memory was 107.1 MB in the beginning and 104.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 91.18 ms. Allocated memory is still 134.2 MB. Free memory was 104.8 MB in the beginning and 101.2 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4120.92 ms. Allocated memory was 134.2 MB in the beginning and 197.1 MB in the end (delta: 62.9 MB). Free memory was 101.2 MB in the beginning and 134.1 MB in the end (delta: -32.9 MB). Peak memory consumption was 85.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 188078.37 ms. Allocated memory was 197.1 MB in the beginning and 4.7 GB in the end (delta: 4.5 GB). Free memory was 134.1 MB in the beginning and 2.7 GB in the end (delta: -2.5 GB). Peak memory consumption was 4.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 469]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 469). Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 706]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 706). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 2 error locations. TIMEOUT Result, 188.0s OverallTime, 35 OverallIterations, 6 TraceHistogramMax, 57.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6483 SDtfs, 16807 SDslu, 19323 SDs, 0 SdLazy, 9449 SolverSat, 1950 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4363 GetRequests, 3976 SyntacticMatches, 30 SemanticMatches, 357 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5371 ImplicationChecksByTransitivity, 33.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=862682occurred in iteration=34, 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: 95.0s AutomataMinimizationTime, 35 MinimizatonAttempts, 509101 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 34.1s InterpolantComputationTime, 4226 NumberOfCodeBlocks, 4226 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 4191 ConstructedInterpolants, 0 QuantifiedInterpolants, 4129729 SizeOfPredicates, 145 NumberOfNonLiveVariables, 12189 ConjunctsInSsa, 364 ConjunctsInUnsatCore, 35 InterpolantComputations, 19 PerfectInterpolantSequences, 3881/6589 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown