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_800.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:09:20,614 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:09:20,616 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:09:20,628 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:09:20,628 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:09:20,629 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:09:20,631 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:09:20,632 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:09:20,634 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:09:20,635 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:09:20,636 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:09:20,636 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:09:20,637 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:09:20,638 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:09:20,639 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:09:20,640 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:09:20,641 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:09:20,641 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:09:20,643 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:09:20,646 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:09:20,647 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:09:20,648 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:09:20,649 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:09:20,650 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:09:20,658 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:09:20,658 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:09:20,659 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:09:20,663 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:09:20,663 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:09:20,664 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:09:20,665 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:09:20,668 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:09:20,668 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:09:20,669 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:09:20,670 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:09:20,670 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:09:20,671 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:09:20,674 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:09:20,674 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:09:20,675 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:09:20,677 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:09:20,715 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:09:20,726 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:09:20,729 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:09:20,730 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:09:20,730 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:09:20,731 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_800.bpl [2019-08-05 10:09:20,731 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/PricedTimedautomataBSearch/u2b07_batman_intermittent_power_800.bpl' [2019-08-05 10:09:20,823 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:09:20,825 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:09:20,826 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:09:20,826 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:09:20,826 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:09:20,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "u2b07_batman_intermittent_power_800.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:20" (1/1) ... [2019-08-05 10:09:20,878 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "u2b07_batman_intermittent_power_800.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:20" (1/1) ... [2019-08-05 10:09:20,896 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:09:20,896 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:09:20,896 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:09:20,899 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:09:20,899 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:09:20,899 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:09:20,900 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:09:20,910 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_800.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:20" (1/1) ... [2019-08-05 10:09:20,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_800.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:20" (1/1) ... [2019-08-05 10:09:20,923 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_800.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:20" (1/1) ... [2019-08-05 10:09:20,931 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_800.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:20" (1/1) ... [2019-08-05 10:09:20,965 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_800.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:20" (1/1) ... [2019-08-05 10:09:20,981 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_800.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:20" (1/1) ... [2019-08-05 10:09:20,997 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_800.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:20" (1/1) ... [2019-08-05 10:09:21,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:09:21,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:09:21,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:09:21,007 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:09:21,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "u2b07_batman_intermittent_power_800.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:20" (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:09:21,084 INFO L130 BoogieDeclarations]: Found specification of procedure perform_resets [2019-08-05 10:09:21,084 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_time [2019-08-05 10:09:21,084 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_channelBusy [2019-08-05 10:09:21,084 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_APP_LZ_1$t0 [2019-08-05 10:09:21,085 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_ENV_1$t [2019-08-05 10:09:21,085 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:09:21,085 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:09:21,085 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:09:21,086 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_queue [2019-08-05 10:09:21,086 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_MAC_1$t0 [2019-08-05 10:09:21,086 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_MAC_1$t [2019-08-05 10:09:21,086 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_ENV_1$t0 [2019-08-05 10:09:21,086 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_MEDIUM_1$sendCount [2019-08-05 10:09:21,087 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_MEDIUM_1$t0 [2019-08-05 10:09:21,087 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_APP_RX_1$t0 [2019-08-05 10:09:21,386 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-08-05 10:09:25,428 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:09:25,429 INFO L283 CfgBuilder]: Removed 32 assume(true) statements. [2019-08-05 10:09:25,430 INFO L202 PluginConnector]: Adding new model u2b07_batman_intermittent_power_800.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:09:25 BoogieIcfgContainer [2019-08-05 10:09:25,430 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:09:25,432 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:09:25,432 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:09:25,435 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:09:25,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "u2b07_batman_intermittent_power_800.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:09:20" (1/2) ... [2019-08-05 10:09:25,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a74a73 and model type u2b07_batman_intermittent_power_800.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:09:25, skipping insertion in model container [2019-08-05 10:09:25,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "u2b07_batman_intermittent_power_800.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:09:25" (2/2) ... [2019-08-05 10:09:25,438 INFO L109 eAbstractionObserver]: Analyzing ICFG u2b07_batman_intermittent_power_800.bpl [2019-08-05 10:09:25,446 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:09:25,454 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 10:09:25,470 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 10:09:25,496 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:09:25,497 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:09:25,497 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:09:25,497 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:09:25,497 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:09:25,498 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:09:25,498 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:09:25,498 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:09:25,498 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:09:25,516 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2019-08-05 10:09:25,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:09:25,525 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:25,525 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:09:25,528 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:25,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:25,534 INFO L82 PathProgramCache]: Analyzing trace with hash 21207, now seen corresponding path program 1 times [2019-08-05 10:09:25,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:25,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:25,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:25,712 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:09:25,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:25,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:09:25,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:25,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:25,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:25,732 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 3 states. [2019-08-05 10:09:25,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:25,835 INFO L93 Difference]: Finished difference Result 79 states and 153 transitions. [2019-08-05 10:09:25,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:25,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:09:25,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:25,859 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:09:25,860 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:09:25,864 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:09:25,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:09:25,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:09:25,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:09:25,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 135 transitions. [2019-08-05 10:09:25,924 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 135 transitions. Word has length 2 [2019-08-05 10:09:25,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:25,924 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 135 transitions. [2019-08-05 10:09:25,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:25,925 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 135 transitions. [2019-08-05 10:09:25,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:09:25,925 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:25,925 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:25,926 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:25,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:25,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1256322736, now seen corresponding path program 1 times [2019-08-05 10:09:25,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:26,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:26,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:26,081 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:09:26,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:26,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:09:26,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:26,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:26,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:26,084 INFO L87 Difference]: Start difference. First operand 77 states and 135 transitions. Second operand 3 states. [2019-08-05 10:09:26,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:26,725 INFO L93 Difference]: Finished difference Result 142 states and 235 transitions. [2019-08-05 10:09:26,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:26,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-08-05 10:09:26,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:26,728 INFO L225 Difference]: With dead ends: 142 [2019-08-05 10:09:26,729 INFO L226 Difference]: Without dead ends: 140 [2019-08-05 10:09:26,730 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:09:26,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-08-05 10:09:26,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2019-08-05 10:09:26,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 10:09:26,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 232 transitions. [2019-08-05 10:09:26,745 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 232 transitions. Word has length 8 [2019-08-05 10:09:26,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:26,746 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 232 transitions. [2019-08-05 10:09:26,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:26,746 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 232 transitions. [2019-08-05 10:09:26,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:09:26,747 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:26,747 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:09:26,748 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:26,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:26,748 INFO L82 PathProgramCache]: Analyzing trace with hash -858023310, now seen corresponding path program 1 times [2019-08-05 10:09:26,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:26,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:26,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:26,859 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:09:26,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:26,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:09:26,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:26,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:26,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:26,863 INFO L87 Difference]: Start difference. First operand 137 states and 232 transitions. Second operand 3 states. [2019-08-05 10:09:26,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:26,919 INFO L93 Difference]: Finished difference Result 272 states and 458 transitions. [2019-08-05 10:09:26,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:26,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-08-05 10:09:26,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:26,924 INFO L225 Difference]: With dead ends: 272 [2019-08-05 10:09:26,924 INFO L226 Difference]: Without dead ends: 270 [2019-08-05 10:09:26,925 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:09:26,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-08-05 10:09:26,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 262. [2019-08-05 10:09:26,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-08-05 10:09:26,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 450 transitions. [2019-08-05 10:09:26,947 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 450 transitions. Word has length 20 [2019-08-05 10:09:26,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:26,948 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 450 transitions. [2019-08-05 10:09:26,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:26,948 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 450 transitions. [2019-08-05 10:09:26,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:09:26,949 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:26,949 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:09:26,949 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:26,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:26,949 INFO L82 PathProgramCache]: Analyzing trace with hash -777560288, now seen corresponding path program 1 times [2019-08-05 10:09:26,957 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:26,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:26,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:27,027 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:09:27,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:27,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:09:27,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:27,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:27,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:27,029 INFO L87 Difference]: Start difference. First operand 262 states and 450 transitions. Second operand 3 states. [2019-08-05 10:09:27,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:27,055 INFO L93 Difference]: Finished difference Result 518 states and 886 transitions. [2019-08-05 10:09:27,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:27,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-08-05 10:09:27,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:27,064 INFO L225 Difference]: With dead ends: 518 [2019-08-05 10:09:27,065 INFO L226 Difference]: Without dead ends: 518 [2019-08-05 10:09:27,065 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:09:27,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-08-05 10:09:27,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 512. [2019-08-05 10:09:27,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-08-05 10:09:27,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 882 transitions. [2019-08-05 10:09:27,095 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 882 transitions. Word has length 21 [2019-08-05 10:09:27,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:27,095 INFO L475 AbstractCegarLoop]: Abstraction has 512 states and 882 transitions. [2019-08-05 10:09:27,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:27,096 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 882 transitions. [2019-08-05 10:09:27,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:09:27,097 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:27,097 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:09:27,097 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:27,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:27,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1667072215, now seen corresponding path program 1 times [2019-08-05 10:09:27,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:27,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:27,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:27,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:27,201 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:09:27,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:27,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:09:27,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:27,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:27,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:27,205 INFO L87 Difference]: Start difference. First operand 512 states and 882 transitions. Second operand 3 states. [2019-08-05 10:09:27,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:27,385 INFO L93 Difference]: Finished difference Result 1006 states and 1666 transitions. [2019-08-05 10:09:27,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:27,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-08-05 10:09:27,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:27,393 INFO L225 Difference]: With dead ends: 1006 [2019-08-05 10:09:27,394 INFO L226 Difference]: Without dead ends: 982 [2019-08-05 10:09:27,394 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:09:27,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2019-08-05 10:09:27,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 972. [2019-08-05 10:09:27,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-08-05 10:09:27,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1634 transitions. [2019-08-05 10:09:27,424 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1634 transitions. Word has length 22 [2019-08-05 10:09:27,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:27,424 INFO L475 AbstractCegarLoop]: Abstraction has 972 states and 1634 transitions. [2019-08-05 10:09:27,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:27,424 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1634 transitions. [2019-08-05 10:09:27,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:09:27,425 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:27,426 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:09:27,426 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:27,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:27,427 INFO L82 PathProgramCache]: Analyzing trace with hash -2110740859, now seen corresponding path program 1 times [2019-08-05 10:09:27,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:27,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:27,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:27,476 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:09:27,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:27,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:09:27,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:27,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:27,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:27,478 INFO L87 Difference]: Start difference. First operand 972 states and 1634 transitions. Second operand 3 states. [2019-08-05 10:09:27,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:27,789 INFO L93 Difference]: Finished difference Result 1798 states and 2850 transitions. [2019-08-05 10:09:27,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:27,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-08-05 10:09:27,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:27,804 INFO L225 Difference]: With dead ends: 1798 [2019-08-05 10:09:27,804 INFO L226 Difference]: Without dead ends: 1798 [2019-08-05 10:09:27,805 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:09:27,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2019-08-05 10:09:27,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 1780. [2019-08-05 10:09:27,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1780 states. [2019-08-05 10:09:27,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2834 transitions. [2019-08-05 10:09:27,847 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2834 transitions. Word has length 27 [2019-08-05 10:09:27,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:27,847 INFO L475 AbstractCegarLoop]: Abstraction has 1780 states and 2834 transitions. [2019-08-05 10:09:27,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:27,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2834 transitions. [2019-08-05 10:09:27,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:09:27,848 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:27,849 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:09:27,849 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:27,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:27,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1946526065, now seen corresponding path program 1 times [2019-08-05 10:09:27,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:27,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:27,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:09:27,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:28,056 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,059 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,060 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,061 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,063 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,064 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,064 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,065 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,066 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,067 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:28,406 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 5 [2019-08-05 10:09:28,767 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 5 [2019-08-05 10:09:28,797 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:09:28,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:28,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:09:28,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:09:28,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:09:28,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:09:28,799 INFO L87 Difference]: Start difference. First operand 1780 states and 2834 transitions. Second operand 5 states. [2019-08-05 10:09:29,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:29,856 INFO L93 Difference]: Finished difference Result 1829 states and 2887 transitions. [2019-08-05 10:09:29,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:09:29,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-08-05 10:09:29,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:29,866 INFO L225 Difference]: With dead ends: 1829 [2019-08-05 10:09:29,866 INFO L226 Difference]: Without dead ends: 1829 [2019-08-05 10:09:29,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:09:29,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2019-08-05 10:09:29,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1829. [2019-08-05 10:09:29,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1829 states. [2019-08-05 10:09:29,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2887 transitions. [2019-08-05 10:09:29,905 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2887 transitions. Word has length 35 [2019-08-05 10:09:29,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:29,906 INFO L475 AbstractCegarLoop]: Abstraction has 1829 states and 2887 transitions. [2019-08-05 10:09:29,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:09:29,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2887 transitions. [2019-08-05 10:09:29,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:09:29,909 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:29,911 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:09:29,912 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:29,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:29,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1941441835, now seen corresponding path program 1 times [2019-08-05 10:09:29,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:29,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:29,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:30,011 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:09:30,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:30,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:09:30,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:30,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:30,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:30,013 INFO L87 Difference]: Start difference. First operand 1829 states and 2887 transitions. Second operand 3 states. [2019-08-05 10:09:30,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:30,310 INFO L93 Difference]: Finished difference Result 2663 states and 4063 transitions. [2019-08-05 10:09:30,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:30,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-08-05 10:09:30,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:30,323 INFO L225 Difference]: With dead ends: 2663 [2019-08-05 10:09:30,324 INFO L226 Difference]: Without dead ends: 2631 [2019-08-05 10:09:30,324 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:09:30,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2631 states. [2019-08-05 10:09:30,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2631 to 2629. [2019-08-05 10:09:30,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2629 states. [2019-08-05 10:09:30,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 4031 transitions. [2019-08-05 10:09:30,401 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 4031 transitions. Word has length 60 [2019-08-05 10:09:30,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:30,403 INFO L475 AbstractCegarLoop]: Abstraction has 2629 states and 4031 transitions. [2019-08-05 10:09:30,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:30,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 4031 transitions. [2019-08-05 10:09:30,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:09:30,405 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:30,406 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:09:30,406 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:30,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:30,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1650973313, now seen corresponding path program 1 times [2019-08-05 10:09:30,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:30,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:30,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:30,515 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:09:30,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:30,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:09:30,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:30,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:30,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:30,518 INFO L87 Difference]: Start difference. First operand 2629 states and 4031 transitions. Second operand 3 states. [2019-08-05 10:09:30,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:30,668 INFO L93 Difference]: Finished difference Result 3895 states and 5791 transitions. [2019-08-05 10:09:30,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:30,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-08-05 10:09:30,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:30,686 INFO L225 Difference]: With dead ends: 3895 [2019-08-05 10:09:30,686 INFO L226 Difference]: Without dead ends: 3895 [2019-08-05 10:09:30,686 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:09:30,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3895 states. [2019-08-05 10:09:30,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3895 to 3893. [2019-08-05 10:09:30,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3893 states. [2019-08-05 10:09:30,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3893 states to 3893 states and 5791 transitions. [2019-08-05 10:09:30,758 INFO L78 Accepts]: Start accepts. Automaton has 3893 states and 5791 transitions. Word has length 63 [2019-08-05 10:09:30,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:30,758 INFO L475 AbstractCegarLoop]: Abstraction has 3893 states and 5791 transitions. [2019-08-05 10:09:30,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:30,758 INFO L276 IsEmpty]: Start isEmpty. Operand 3893 states and 5791 transitions. [2019-08-05 10:09:30,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:09:30,760 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:30,760 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:09:30,760 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:30,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:30,761 INFO L82 PathProgramCache]: Analyzing trace with hash 919830319, now seen corresponding path program 1 times [2019-08-05 10:09:30,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:30,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:30,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:30,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:30,851 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:09:30,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:30,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:09:30,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:30,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:30,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:30,853 INFO L87 Difference]: Start difference. First operand 3893 states and 5791 transitions. Second operand 3 states. [2019-08-05 10:09:31,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:31,190 INFO L93 Difference]: Finished difference Result 3819 states and 5559 transitions. [2019-08-05 10:09:31,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:31,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-08-05 10:09:31,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:31,202 INFO L225 Difference]: With dead ends: 3819 [2019-08-05 10:09:31,202 INFO L226 Difference]: Without dead ends: 3745 [2019-08-05 10:09:31,203 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:09:31,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3745 states. [2019-08-05 10:09:31,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3745 to 3721. [2019-08-05 10:09:31,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3721 states. [2019-08-05 10:09:31,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3721 states to 3721 states and 5461 transitions. [2019-08-05 10:09:31,262 INFO L78 Accepts]: Start accepts. Automaton has 3721 states and 5461 transitions. Word has length 68 [2019-08-05 10:09:31,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:31,263 INFO L475 AbstractCegarLoop]: Abstraction has 3721 states and 5461 transitions. [2019-08-05 10:09:31,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:31,263 INFO L276 IsEmpty]: Start isEmpty. Operand 3721 states and 5461 transitions. [2019-08-05 10:09:31,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:09:31,264 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:31,265 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:09:31,265 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:31,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:31,265 INFO L82 PathProgramCache]: Analyzing trace with hash 373368093, now seen corresponding path program 1 times [2019-08-05 10:09:31,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:31,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:09:31,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:31,531 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:09:31,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:31,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:09:31,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:09:31,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:09:31,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:09:31,533 INFO L87 Difference]: Start difference. First operand 3721 states and 5461 transitions. Second operand 5 states. [2019-08-05 10:09:32,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:32,254 INFO L93 Difference]: Finished difference Result 4653 states and 6755 transitions. [2019-08-05 10:09:32,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:09:32,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-08-05 10:09:32,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:32,278 INFO L225 Difference]: With dead ends: 4653 [2019-08-05 10:09:32,278 INFO L226 Difference]: Without dead ends: 4649 [2019-08-05 10:09:32,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:09:32,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4649 states. [2019-08-05 10:09:32,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4649 to 4517. [2019-08-05 10:09:32,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4517 states. [2019-08-05 10:09:32,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4517 states to 4517 states and 6562 transitions. [2019-08-05 10:09:32,362 INFO L78 Accepts]: Start accepts. Automaton has 4517 states and 6562 transitions. Word has length 70 [2019-08-05 10:09:32,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:32,362 INFO L475 AbstractCegarLoop]: Abstraction has 4517 states and 6562 transitions. [2019-08-05 10:09:32,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:09:32,363 INFO L276 IsEmpty]: Start isEmpty. Operand 4517 states and 6562 transitions. [2019-08-05 10:09:32,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:09:32,364 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:32,364 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:09:32,365 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:32,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:32,365 INFO L82 PathProgramCache]: Analyzing trace with hash -30411294, now seen corresponding path program 1 times [2019-08-05 10:09:32,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:32,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:09:32,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:32,522 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 10:09:32,525 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:32,526 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:32,527 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:32,528 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:32,529 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:32,529 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:32,530 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:32,531 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:32,531 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:32,532 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:32,533 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:32,993 WARN L188 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 9 [2019-08-05 10:09:33,718 WARN L188 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 9 [2019-08-05 10:09:33,726 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:33,728 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:33,729 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:33,730 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:33,732 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:33,733 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:33,734 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:33,735 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:33,736 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:33,737 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:34,426 WARN L188 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 5 [2019-08-05 10:09:34,453 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:09:34,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:34,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:09:34,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:09:34,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:09:34,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:09:34,454 INFO L87 Difference]: Start difference. First operand 4517 states and 6562 transitions. Second operand 6 states. [2019-08-05 10:09:34,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:34,856 INFO L93 Difference]: Finished difference Result 4755 states and 6848 transitions. [2019-08-05 10:09:34,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:09:34,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-08-05 10:09:34,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:34,884 INFO L225 Difference]: With dead ends: 4755 [2019-08-05 10:09:34,885 INFO L226 Difference]: Without dead ends: 4755 [2019-08-05 10:09:34,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:09:34,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4755 states. [2019-08-05 10:09:34,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4755 to 4732. [2019-08-05 10:09:34,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4732 states. [2019-08-05 10:09:34,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4732 states to 4732 states and 6824 transitions. [2019-08-05 10:09:34,960 INFO L78 Accepts]: Start accepts. Automaton has 4732 states and 6824 transitions. Word has length 70 [2019-08-05 10:09:34,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:34,960 INFO L475 AbstractCegarLoop]: Abstraction has 4732 states and 6824 transitions. [2019-08-05 10:09:34,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:09:34,960 INFO L276 IsEmpty]: Start isEmpty. Operand 4732 states and 6824 transitions. [2019-08-05 10:09:34,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:09:34,961 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:34,961 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:09:34,961 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:34,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:34,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1143179452, now seen corresponding path program 1 times [2019-08-05 10:09:34,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:34,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:09:34,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:35,151 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:09:35,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:35,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:09:35,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:09:35,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:09:35,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:09:35,153 INFO L87 Difference]: Start difference. First operand 4732 states and 6824 transitions. Second operand 5 states. [2019-08-05 10:09:35,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:35,668 INFO L93 Difference]: Finished difference Result 4812 states and 6942 transitions. [2019-08-05 10:09:35,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:09:35,669 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-08-05 10:09:35,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:35,683 INFO L225 Difference]: With dead ends: 4812 [2019-08-05 10:09:35,684 INFO L226 Difference]: Without dead ends: 4800 [2019-08-05 10:09:35,684 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:09:35,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4800 states. [2019-08-05 10:09:35,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4800 to 4665. [2019-08-05 10:09:35,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-08-05 10:09:35,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 6738 transitions. [2019-08-05 10:09:35,798 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 6738 transitions. Word has length 71 [2019-08-05 10:09:35,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:35,798 INFO L475 AbstractCegarLoop]: Abstraction has 4665 states and 6738 transitions. [2019-08-05 10:09:35,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:09:35,799 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 6738 transitions. [2019-08-05 10:09:35,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 10:09:35,800 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:35,800 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:09:35,801 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:35,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:35,801 INFO L82 PathProgramCache]: Analyzing trace with hash 2074252044, now seen corresponding path program 1 times [2019-08-05 10:09:35,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:35,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:35,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:09:35,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:35,907 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,908 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,909 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,909 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,910 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,911 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,911 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,912 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,913 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,914 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:35,915 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,070 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,071 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,072 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,073 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,074 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,074 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,075 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,076 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,077 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,078 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,208 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,209 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,210 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,210 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,211 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,212 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,212 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,213 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,213 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,214 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,215 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,316 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:09:36,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:36,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:09:36,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:09:36,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:09:36,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:09:36,318 INFO L87 Difference]: Start difference. First operand 4665 states and 6738 transitions. Second operand 7 states. [2019-08-05 10:09:36,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:36,665 INFO L93 Difference]: Finished difference Result 4905 states and 7026 transitions. [2019-08-05 10:09:36,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:09:36,666 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2019-08-05 10:09:36,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:36,676 INFO L225 Difference]: With dead ends: 4905 [2019-08-05 10:09:36,676 INFO L226 Difference]: Without dead ends: 4905 [2019-08-05 10:09:36,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:09:36,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2019-08-05 10:09:36,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4902. [2019-08-05 10:09:36,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4902 states. [2019-08-05 10:09:36,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4902 states to 4902 states and 7023 transitions. [2019-08-05 10:09:36,733 INFO L78 Accepts]: Start accepts. Automaton has 4902 states and 7023 transitions. Word has length 105 [2019-08-05 10:09:36,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:36,733 INFO L475 AbstractCegarLoop]: Abstraction has 4902 states and 7023 transitions. [2019-08-05 10:09:36,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:09:36,733 INFO L276 IsEmpty]: Start isEmpty. Operand 4902 states and 7023 transitions. [2019-08-05 10:09:36,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 10:09:36,734 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:36,734 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:09:36,735 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:36,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:36,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1809599206, now seen corresponding path program 1 times [2019-08-05 10:09:36,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:36,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:09:36,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:36,876 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,876 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,877 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,878 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,879 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,883 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,883 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,884 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,885 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,885 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:36,886 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:37,076 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:37,077 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:37,078 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:37,079 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:37,079 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:37,080 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:37,080 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:37,081 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:37,082 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:37,082 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:37,083 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:37,231 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:37,232 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:37,233 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:37,234 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:37,234 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:37,235 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:37,236 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:37,236 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:37,237 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:37,238 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:37,962 WARN L188 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 5 [2019-08-05 10:09:37,983 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:09:37,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:37,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:09:37,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:09:37,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:09:37,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:09:37,985 INFO L87 Difference]: Start difference. First operand 4902 states and 7023 transitions. Second operand 5 states. [2019-08-05 10:09:38,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:38,178 INFO L93 Difference]: Finished difference Result 5173 states and 7346 transitions. [2019-08-05 10:09:38,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:09:38,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-08-05 10:09:38,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:38,188 INFO L225 Difference]: With dead ends: 5173 [2019-08-05 10:09:38,189 INFO L226 Difference]: Without dead ends: 5173 [2019-08-05 10:09:38,189 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:09:38,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5173 states. [2019-08-05 10:09:38,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5173 to 5155. [2019-08-05 10:09:38,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5155 states. [2019-08-05 10:09:38,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5155 states to 5155 states and 7328 transitions. [2019-08-05 10:09:38,246 INFO L78 Accepts]: Start accepts. Automaton has 5155 states and 7328 transitions. Word has length 107 [2019-08-05 10:09:38,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:38,247 INFO L475 AbstractCegarLoop]: Abstraction has 5155 states and 7328 transitions. [2019-08-05 10:09:38,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:09:38,247 INFO L276 IsEmpty]: Start isEmpty. Operand 5155 states and 7328 transitions. [2019-08-05 10:09:38,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-08-05 10:09:38,249 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:38,249 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:09:38,250 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:38,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:38,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1148551150, now seen corresponding path program 1 times [2019-08-05 10:09:38,255 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:38,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:09:38,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:38,435 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:09:38,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:38,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:09:38,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:09:38,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:09:38,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:09:38,437 INFO L87 Difference]: Start difference. First operand 5155 states and 7328 transitions. Second operand 4 states. [2019-08-05 10:09:38,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:38,945 INFO L93 Difference]: Finished difference Result 11604 states and 16347 transitions. [2019-08-05 10:09:38,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:09:38,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-08-05 10:09:38,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:38,970 INFO L225 Difference]: With dead ends: 11604 [2019-08-05 10:09:38,970 INFO L226 Difference]: Without dead ends: 11556 [2019-08-05 10:09:38,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:09:38,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11556 states. [2019-08-05 10:09:39,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11556 to 10967. [2019-08-05 10:09:39,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10967 states. [2019-08-05 10:09:39,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10967 states to 10967 states and 15524 transitions. [2019-08-05 10:09:39,219 INFO L78 Accepts]: Start accepts. Automaton has 10967 states and 15524 transitions. Word has length 130 [2019-08-05 10:09:39,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:39,219 INFO L475 AbstractCegarLoop]: Abstraction has 10967 states and 15524 transitions. [2019-08-05 10:09:39,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:09:39,220 INFO L276 IsEmpty]: Start isEmpty. Operand 10967 states and 15524 transitions. [2019-08-05 10:09:39,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-08-05 10:09:39,222 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:39,222 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:09:39,222 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:39,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:39,223 INFO L82 PathProgramCache]: Analyzing trace with hash -2126953540, now seen corresponding path program 1 times [2019-08-05 10:09:39,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:39,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:39,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:39,329 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:09:39,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:39,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:09:39,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:39,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:39,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:39,330 INFO L87 Difference]: Start difference. First operand 10967 states and 15524 transitions. Second operand 3 states. [2019-08-05 10:09:39,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:39,859 INFO L93 Difference]: Finished difference Result 15551 states and 21862 transitions. [2019-08-05 10:09:39,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:39,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-08-05 10:09:39,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:39,889 INFO L225 Difference]: With dead ends: 15551 [2019-08-05 10:09:39,889 INFO L226 Difference]: Without dead ends: 15455 [2019-08-05 10:09:39,889 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:09:39,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15455 states. [2019-08-05 10:09:40,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15455 to 15373. [2019-08-05 10:09:40,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15373 states. [2019-08-05 10:09:40,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15373 states to 15373 states and 21682 transitions. [2019-08-05 10:09:40,080 INFO L78 Accepts]: Start accepts. Automaton has 15373 states and 21682 transitions. Word has length 134 [2019-08-05 10:09:40,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:40,081 INFO L475 AbstractCegarLoop]: Abstraction has 15373 states and 21682 transitions. [2019-08-05 10:09:40,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:40,081 INFO L276 IsEmpty]: Start isEmpty. Operand 15373 states and 21682 transitions. [2019-08-05 10:09:40,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-08-05 10:09:40,083 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:40,083 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:09:40,083 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:40,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:40,084 INFO L82 PathProgramCache]: Analyzing trace with hash 887643078, now seen corresponding path program 1 times [2019-08-05 10:09:40,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:40,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:40,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:40,185 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:09:40,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:40,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:09:40,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:40,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:40,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:40,188 INFO L87 Difference]: Start difference. First operand 15373 states and 21682 transitions. Second operand 3 states. [2019-08-05 10:09:40,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:40,521 INFO L93 Difference]: Finished difference Result 20487 states and 28307 transitions. [2019-08-05 10:09:40,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:40,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-08-05 10:09:40,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:40,963 INFO L225 Difference]: With dead ends: 20487 [2019-08-05 10:09:40,963 INFO L226 Difference]: Without dead ends: 20487 [2019-08-05 10:09:40,963 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:09:40,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20487 states. [2019-08-05 10:09:41,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20487 to 20051. [2019-08-05 10:09:41,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20051 states. [2019-08-05 10:09:41,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20051 states to 20051 states and 27873 transitions. [2019-08-05 10:09:41,220 INFO L78 Accepts]: Start accepts. Automaton has 20051 states and 27873 transitions. Word has length 138 [2019-08-05 10:09:41,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:41,221 INFO L475 AbstractCegarLoop]: Abstraction has 20051 states and 27873 transitions. [2019-08-05 10:09:41,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:41,221 INFO L276 IsEmpty]: Start isEmpty. Operand 20051 states and 27873 transitions. [2019-08-05 10:09:41,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-08-05 10:09:41,224 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:41,224 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:09:41,224 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:41,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:41,225 INFO L82 PathProgramCache]: Analyzing trace with hash 11293620, now seen corresponding path program 1 times [2019-08-05 10:09:41,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:41,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:41,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:09:41,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:41,395 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:41,396 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:41,396 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:41,397 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:41,397 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:41,398 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:41,399 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:41,400 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:41,401 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:41,402 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:41,402 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:41,614 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:41,615 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:41,617 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:41,618 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:41,619 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:41,619 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:41,620 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:41,621 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:41,621 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:41,622 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:41,821 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 5 [2019-08-05 10:09:41,848 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:41,849 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:41,849 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:41,850 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:41,850 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:41,851 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:41,851 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:41,852 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:41,852 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:41,853 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:41,853 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:42,042 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 9 [2019-08-05 10:09:42,048 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:42,049 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:42,049 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:42,050 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:42,050 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:42,051 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:42,051 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:42,052 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:42,053 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:42,053 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:42,054 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:42,537 WARN L188 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-08-05 10:09:43,117 WARN L188 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-08-05 10:09:43,357 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-08-05 10:09:43,589 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-08-05 10:09:43,810 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-08-05 10:09:44,024 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-08-05 10:09:44,205 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-08-05 10:09:44,397 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-08-05 10:09:44,559 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-08-05 10:09:44,561 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:09:44,694 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:09:44,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:44,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:09:44,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:09:44,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:09:44,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:09:44,696 INFO L87 Difference]: Start difference. First operand 20051 states and 27873 transitions. Second operand 20 states. [2019-08-05 10:09:45,973 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-08-05 10:09:46,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:46,625 INFO L93 Difference]: Finished difference Result 21935 states and 30075 transitions. [2019-08-05 10:09:46,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:09:46,626 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 139 [2019-08-05 10:09:46,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:46,653 INFO L225 Difference]: With dead ends: 21935 [2019-08-05 10:09:46,654 INFO L226 Difference]: Without dead ends: 21935 [2019-08-05 10:09:46,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=306, Invalid=624, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:09:46,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21935 states. [2019-08-05 10:09:46,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21935 to 21838. [2019-08-05 10:09:46,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21838 states. [2019-08-05 10:09:46,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21838 states to 21838 states and 29978 transitions. [2019-08-05 10:09:46,990 INFO L78 Accepts]: Start accepts. Automaton has 21838 states and 29978 transitions. Word has length 139 [2019-08-05 10:09:46,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:46,991 INFO L475 AbstractCegarLoop]: Abstraction has 21838 states and 29978 transitions. [2019-08-05 10:09:46,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:09:46,991 INFO L276 IsEmpty]: Start isEmpty. Operand 21838 states and 29978 transitions. [2019-08-05 10:09:46,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-08-05 10:09:46,994 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:46,995 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:09:46,995 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:46,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:46,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1823249627, now seen corresponding path program 1 times [2019-08-05 10:09:47,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:47,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:09:47,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:47,186 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:09:47,187 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:47,188 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:47,188 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:47,189 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:47,189 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:47,190 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:47,191 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:47,191 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:47,192 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:47,192 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:47,193 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:47,686 WARN L188 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 11 [2019-08-05 10:09:48,461 WARN L188 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 11 [2019-08-05 10:09:48,478 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:48,479 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:48,480 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:48,481 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:48,482 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:48,483 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:48,484 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:48,485 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:48,486 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:48,488 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:48,489 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:48,573 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:48,573 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:48,574 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:48,574 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:48,575 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:48,576 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:48,576 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:48,577 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:48,578 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:48,578 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:48,579 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:48,813 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:48,814 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:48,815 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:48,816 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:48,816 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:48,817 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:48,818 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:48,818 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:48,819 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:48,820 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:49,309 WARN L188 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 5 [2019-08-05 10:09:49,466 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:09:49,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:49,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:09:49,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:09:49,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:09:49,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:09:49,468 INFO L87 Difference]: Start difference. First operand 21838 states and 29978 transitions. Second operand 7 states. [2019-08-05 10:09:49,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:49,884 INFO L93 Difference]: Finished difference Result 23920 states and 32548 transitions. [2019-08-05 10:09:49,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:09:49,885 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-08-05 10:09:49,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:49,905 INFO L225 Difference]: With dead ends: 23920 [2019-08-05 10:09:49,906 INFO L226 Difference]: Without dead ends: 23920 [2019-08-05 10:09:49,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 135 SyntacticMatches, 2 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:09:49,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23920 states. [2019-08-05 10:09:50,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23920 to 23546. [2019-08-05 10:09:50,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23546 states. [2019-08-05 10:09:50,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23546 states to 23546 states and 32116 transitions. [2019-08-05 10:09:50,139 INFO L78 Accepts]: Start accepts. Automaton has 23546 states and 32116 transitions. Word has length 143 [2019-08-05 10:09:50,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:50,139 INFO L475 AbstractCegarLoop]: Abstraction has 23546 states and 32116 transitions. [2019-08-05 10:09:50,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:09:50,139 INFO L276 IsEmpty]: Start isEmpty. Operand 23546 states and 32116 transitions. [2019-08-05 10:09:50,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-08-05 10:09:50,141 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:50,142 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:09:50,142 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:50,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:50,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1330469809, now seen corresponding path program 1 times [2019-08-05 10:09:50,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:50,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:09:50,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:50,423 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:09:50,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:50,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:09:50,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:09:50,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:09:50,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:09:50,425 INFO L87 Difference]: Start difference. First operand 23546 states and 32116 transitions. Second operand 5 states. [2019-08-05 10:09:50,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:50,633 INFO L93 Difference]: Finished difference Result 24324 states and 33161 transitions. [2019-08-05 10:09:50,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:09:50,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2019-08-05 10:09:50,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:50,655 INFO L225 Difference]: With dead ends: 24324 [2019-08-05 10:09:50,655 INFO L226 Difference]: Without dead ends: 24317 [2019-08-05 10:09:50,656 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:09:50,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24317 states. [2019-08-05 10:09:50,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24317 to 24035. [2019-08-05 10:09:50,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24035 states. [2019-08-05 10:09:50,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24035 states to 24035 states and 32686 transitions. [2019-08-05 10:09:50,974 INFO L78 Accepts]: Start accepts. Automaton has 24035 states and 32686 transitions. Word has length 143 [2019-08-05 10:09:50,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:50,975 INFO L475 AbstractCegarLoop]: Abstraction has 24035 states and 32686 transitions. [2019-08-05 10:09:50,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:09:50,975 INFO L276 IsEmpty]: Start isEmpty. Operand 24035 states and 32686 transitions. [2019-08-05 10:09:50,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-08-05 10:09:50,980 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:50,980 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:09:50,981 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:50,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:50,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1674424068, now seen corresponding path program 1 times [2019-08-05 10:09:50,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:51,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:51,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:51,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:51,079 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:09:51,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:51,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:09:51,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:51,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:51,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:51,081 INFO L87 Difference]: Start difference. First operand 24035 states and 32686 transitions. Second operand 3 states. [2019-08-05 10:09:51,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:51,824 INFO L93 Difference]: Finished difference Result 28005 states and 37776 transitions. [2019-08-05 10:09:51,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:51,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-08-05 10:09:51,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:51,854 INFO L225 Difference]: With dead ends: 28005 [2019-08-05 10:09:51,854 INFO L226 Difference]: Without dead ends: 27932 [2019-08-05 10:09:51,855 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:09:51,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27932 states. [2019-08-05 10:09:52,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27932 to 27882. [2019-08-05 10:09:52,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27882 states. [2019-08-05 10:09:52,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27882 states to 27882 states and 37631 transitions. [2019-08-05 10:09:52,084 INFO L78 Accepts]: Start accepts. Automaton has 27882 states and 37631 transitions. Word has length 171 [2019-08-05 10:09:52,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:52,084 INFO L475 AbstractCegarLoop]: Abstraction has 27882 states and 37631 transitions. [2019-08-05 10:09:52,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:52,084 INFO L276 IsEmpty]: Start isEmpty. Operand 27882 states and 37631 transitions. [2019-08-05 10:09:52,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-08-05 10:09:52,090 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:52,091 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:09:52,091 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:52,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:52,091 INFO L82 PathProgramCache]: Analyzing trace with hash -110644143, now seen corresponding path program 1 times [2019-08-05 10:09:52,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:52,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:09:52,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:52,201 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:09:52,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:52,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:09:52,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:52,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:52,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:52,203 INFO L87 Difference]: Start difference. First operand 27882 states and 37631 transitions. Second operand 3 states. [2019-08-05 10:09:52,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:52,465 INFO L93 Difference]: Finished difference Result 31872 states and 42931 transitions. [2019-08-05 10:09:52,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:52,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-08-05 10:09:52,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:52,496 INFO L225 Difference]: With dead ends: 31872 [2019-08-05 10:09:52,497 INFO L226 Difference]: Without dead ends: 31824 [2019-08-05 10:09:52,497 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:09:52,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31824 states. [2019-08-05 10:09:52,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31824 to 29962. [2019-08-05 10:09:52,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29962 states. [2019-08-05 10:09:52,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29962 states to 29962 states and 40395 transitions. [2019-08-05 10:09:52,868 INFO L78 Accepts]: Start accepts. Automaton has 29962 states and 40395 transitions. Word has length 173 [2019-08-05 10:09:52,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:52,869 INFO L475 AbstractCegarLoop]: Abstraction has 29962 states and 40395 transitions. [2019-08-05 10:09:52,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:52,869 INFO L276 IsEmpty]: Start isEmpty. Operand 29962 states and 40395 transitions. [2019-08-05 10:09:52,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-08-05 10:09:52,872 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:52,872 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:09:52,873 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:52,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:52,873 INFO L82 PathProgramCache]: Analyzing trace with hash 369991458, now seen corresponding path program 1 times [2019-08-05 10:09:52,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:52,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:09:52,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:53,062 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:09:53,064 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:53,065 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:53,066 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:53,066 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:53,067 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:53,068 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:53,068 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:53,069 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:53,070 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:53,071 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:53,072 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:53,586 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 11 [2019-08-05 10:09:54,186 WARN L188 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 11 [2019-08-05 10:09:54,192 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:54,192 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:54,193 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:54,193 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:54,194 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:54,194 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:54,195 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:54,195 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:54,196 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:54,197 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:54,197 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:54,235 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:54,236 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:54,236 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:54,237 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:54,238 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:54,238 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:54,239 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:54,240 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:54,240 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:54,241 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:54,242 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:54,401 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:54,402 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:54,402 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:54,402 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:54,402 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:54,403 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:54,404 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:54,404 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:54,405 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:54,405 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:55,759 WARN L188 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 58 DAG size of output: 5 [2019-08-05 10:09:55,828 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:55,829 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:55,829 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:55,830 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:55,830 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:55,831 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:55,831 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:55,831 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:55,832 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:55,832 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:55,832 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:56,054 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:09:56,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:56,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:09:56,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:09:56,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:09:56,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:09:56,056 INFO L87 Difference]: Start difference. First operand 29962 states and 40395 transitions. Second operand 8 states. [2019-08-05 10:09:56,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:56,502 INFO L93 Difference]: Finished difference Result 34159 states and 45568 transitions. [2019-08-05 10:09:56,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:09:56,502 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 174 [2019-08-05 10:09:56,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:56,533 INFO L225 Difference]: With dead ends: 34159 [2019-08-05 10:09:56,533 INFO L226 Difference]: Without dead ends: 34159 [2019-08-05 10:09:56,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 164 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:09:56,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34159 states. [2019-08-05 10:09:57,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34159 to 33905. [2019-08-05 10:09:57,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33905 states. [2019-08-05 10:09:57,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33905 states to 33905 states and 45314 transitions. [2019-08-05 10:09:57,616 INFO L78 Accepts]: Start accepts. Automaton has 33905 states and 45314 transitions. Word has length 174 [2019-08-05 10:09:57,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:57,616 INFO L475 AbstractCegarLoop]: Abstraction has 33905 states and 45314 transitions. [2019-08-05 10:09:57,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:09:57,616 INFO L276 IsEmpty]: Start isEmpty. Operand 33905 states and 45314 transitions. [2019-08-05 10:09:57,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-08-05 10:09:57,621 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:57,621 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:09:57,621 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:57,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:57,622 INFO L82 PathProgramCache]: Analyzing trace with hash 570429234, now seen corresponding path program 1 times [2019-08-05 10:09:57,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:57,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:57,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:09:57,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:57,947 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:09:57,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:57,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:09:57,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:09:57,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:09:57,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:09:57,948 INFO L87 Difference]: Start difference. First operand 33905 states and 45314 transitions. Second operand 8 states. [2019-08-05 10:09:58,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:58,501 INFO L93 Difference]: Finished difference Result 63378 states and 85380 transitions. [2019-08-05 10:09:58,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:09:58,501 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 175 [2019-08-05 10:09:58,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:58,566 INFO L225 Difference]: With dead ends: 63378 [2019-08-05 10:09:58,566 INFO L226 Difference]: Without dead ends: 63288 [2019-08-05 10:09:58,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:09:58,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63288 states. [2019-08-05 10:09:59,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63288 to 47156. [2019-08-05 10:09:59,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47156 states. [2019-08-05 10:09:59,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47156 states to 47156 states and 64161 transitions. [2019-08-05 10:09:59,056 INFO L78 Accepts]: Start accepts. Automaton has 47156 states and 64161 transitions. Word has length 175 [2019-08-05 10:09:59,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:59,056 INFO L475 AbstractCegarLoop]: Abstraction has 47156 states and 64161 transitions. [2019-08-05 10:09:59,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:09:59,057 INFO L276 IsEmpty]: Start isEmpty. Operand 47156 states and 64161 transitions. [2019-08-05 10:09:59,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-08-05 10:09:59,061 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:59,061 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:09:59,061 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:59,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:59,062 INFO L82 PathProgramCache]: Analyzing trace with hash -758038053, now seen corresponding path program 1 times [2019-08-05 10:09:59,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:59,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:09:59,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:59,280 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:09:59,282 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,283 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,283 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,284 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,284 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,285 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,285 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,285 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,286 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,286 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,287 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,473 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 11 [2019-08-05 10:09:59,513 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,514 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,514 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,515 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,515 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,516 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,517 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,517 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,517 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,518 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,768 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 5 [2019-08-05 10:09:59,789 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,790 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,790 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,791 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,791 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,791 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,792 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,792 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,792 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,793 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,794 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,935 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,935 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,935 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,936 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,936 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,936 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,937 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,937 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,937 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,938 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:59,938 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:00,331 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-08-05 10:10:00,586 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-08-05 10:10:00,841 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-08-05 10:10:01,176 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-08-05 10:10:01,716 WARN L188 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-08-05 10:10:01,910 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:02,143 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-08-05 10:10:02,352 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-08-05 10:10:02,506 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-08-05 10:10:02,507 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:10:02,588 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:02,589 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:02,589 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:02,590 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:02,721 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:02,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:02,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:10:02,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:10:02,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:10:02,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:10:02,723 INFO L87 Difference]: Start difference. First operand 47156 states and 64161 transitions. Second operand 23 states. [2019-08-05 10:10:02,933 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 23 [2019-08-05 10:10:03,176 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 25 [2019-08-05 10:10:03,417 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 27 [2019-08-05 10:10:03,623 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:05,061 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-08-05 10:10:05,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:05,987 INFO L93 Difference]: Finished difference Result 58363 states and 78277 transitions. [2019-08-05 10:10:05,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:10:05,988 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 177 [2019-08-05 10:10:05,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:06,048 INFO L225 Difference]: With dead ends: 58363 [2019-08-05 10:10:06,048 INFO L226 Difference]: Without dead ends: 58363 [2019-08-05 10:10:06,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:10:06,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58363 states. [2019-08-05 10:10:06,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58363 to 54535. [2019-08-05 10:10:06,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54535 states. [2019-08-05 10:10:06,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54535 states to 54535 states and 73601 transitions. [2019-08-05 10:10:06,543 INFO L78 Accepts]: Start accepts. Automaton has 54535 states and 73601 transitions. Word has length 177 [2019-08-05 10:10:06,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:06,544 INFO L475 AbstractCegarLoop]: Abstraction has 54535 states and 73601 transitions. [2019-08-05 10:10:06,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:10:06,544 INFO L276 IsEmpty]: Start isEmpty. Operand 54535 states and 73601 transitions. [2019-08-05 10:10:06,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-08-05 10:10:06,549 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:06,549 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:06,549 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:06,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:06,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1753462791, now seen corresponding path program 1 times [2019-08-05 10:10:06,553 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:06,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:06,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:10:06,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:06,679 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:06,680 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:06,680 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:06,680 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:06,680 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:06,681 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:06,681 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:06,681 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:06,682 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:06,682 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:06,682 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:06,847 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:06,848 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:06,848 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:06,849 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:06,849 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:06,849 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:06,850 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:06,851 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:06,851 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:06,852 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,016 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,017 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,017 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,018 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,018 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,019 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,019 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,019 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,020 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,020 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,020 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,104 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,104 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,105 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,105 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,105 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,106 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,106 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,106 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,107 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,107 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,108 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:07,254 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 11 [2019-08-05 10:10:07,610 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-08-05 10:10:07,876 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-08-05 10:10:08,139 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-08-05 10:10:08,377 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-08-05 10:10:08,602 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-08-05 10:10:08,798 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-08-05 10:10:08,987 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-08-05 10:10:09,156 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-08-05 10:10:09,563 WARN L188 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-08-05 10:10:09,617 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:09,617 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:09,618 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:09,618 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:09,618 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:09,619 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:09,753 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 20 proven. 292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:10:09,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:09,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:10:09,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:10:09,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:10:09,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:10:09,755 INFO L87 Difference]: Start difference. First operand 54535 states and 73601 transitions. Second operand 22 states. [2019-08-05 10:10:11,091 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-08-05 10:10:11,321 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-08-05 10:10:12,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:12,227 INFO L93 Difference]: Finished difference Result 57305 states and 76887 transitions. [2019-08-05 10:10:12,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:10:12,232 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 178 [2019-08-05 10:10:12,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:12,292 INFO L225 Difference]: With dead ends: 57305 [2019-08-05 10:10:12,292 INFO L226 Difference]: Without dead ends: 57305 [2019-08-05 10:10:12,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=377, Invalid=883, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:10:12,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57305 states. [2019-08-05 10:10:12,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57305 to 55550. [2019-08-05 10:10:12,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55550 states. [2019-08-05 10:10:12,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55550 states to 55550 states and 74818 transitions. [2019-08-05 10:10:12,768 INFO L78 Accepts]: Start accepts. Automaton has 55550 states and 74818 transitions. Word has length 178 [2019-08-05 10:10:12,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:12,768 INFO L475 AbstractCegarLoop]: Abstraction has 55550 states and 74818 transitions. [2019-08-05 10:10:12,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:10:12,768 INFO L276 IsEmpty]: Start isEmpty. Operand 55550 states and 74818 transitions. [2019-08-05 10:10:13,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-08-05 10:10:13,871 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:13,871 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:10:13,872 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:13,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:13,872 INFO L82 PathProgramCache]: Analyzing trace with hash -275131603, now seen corresponding path program 1 times [2019-08-05 10:10:13,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:13,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:13,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:10:13,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:13,984 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:10:13,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:13,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:10:13,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:10:13,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:10:13,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:13,986 INFO L87 Difference]: Start difference. First operand 55550 states and 74818 transitions. Second operand 3 states. [2019-08-05 10:10:14,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:14,190 INFO L93 Difference]: Finished difference Result 54534 states and 70764 transitions. [2019-08-05 10:10:14,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:10:14,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-08-05 10:10:14,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:14,242 INFO L225 Difference]: With dead ends: 54534 [2019-08-05 10:10:14,242 INFO L226 Difference]: Without dead ends: 54414 [2019-08-05 10:10:14,242 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:10:14,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54414 states. [2019-08-05 10:10:14,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54414 to 47565. [2019-08-05 10:10:14,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47565 states. [2019-08-05 10:10:14,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47565 states to 47565 states and 62175 transitions. [2019-08-05 10:10:14,649 INFO L78 Accepts]: Start accepts. Automaton has 47565 states and 62175 transitions. Word has length 194 [2019-08-05 10:10:14,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:14,649 INFO L475 AbstractCegarLoop]: Abstraction has 47565 states and 62175 transitions. [2019-08-05 10:10:14,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:10:14,650 INFO L276 IsEmpty]: Start isEmpty. Operand 47565 states and 62175 transitions. [2019-08-05 10:10:14,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-08-05 10:10:14,654 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:14,655 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:10:14,655 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:14,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:14,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1621474027, now seen corresponding path program 1 times [2019-08-05 10:10:14,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:14,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:14,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:10:14,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:14,820 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:10:14,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:14,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:10:14,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:10:14,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:10:14,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:10:14,822 INFO L87 Difference]: Start difference. First operand 47565 states and 62175 transitions. Second operand 6 states. [2019-08-05 10:10:15,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:15,362 INFO L93 Difference]: Finished difference Result 66827 states and 88079 transitions. [2019-08-05 10:10:15,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:10:15,363 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 195 [2019-08-05 10:10:15,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:15,429 INFO L225 Difference]: With dead ends: 66827 [2019-08-05 10:10:15,430 INFO L226 Difference]: Without dead ends: 66827 [2019-08-05 10:10:15,430 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:10:15,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66827 states. [2019-08-05 10:10:15,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66827 to 44927. [2019-08-05 10:10:15,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44927 states. [2019-08-05 10:10:15,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44927 states to 44927 states and 59012 transitions. [2019-08-05 10:10:15,910 INFO L78 Accepts]: Start accepts. Automaton has 44927 states and 59012 transitions. Word has length 195 [2019-08-05 10:10:15,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:15,911 INFO L475 AbstractCegarLoop]: Abstraction has 44927 states and 59012 transitions. [2019-08-05 10:10:15,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:10:15,911 INFO L276 IsEmpty]: Start isEmpty. Operand 44927 states and 59012 transitions. [2019-08-05 10:10:15,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-08-05 10:10:15,919 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:15,919 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:10:15,919 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:15,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:15,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1319648849, now seen corresponding path program 1 times [2019-08-05 10:10:16,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:16,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:10:16,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:16,416 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:10:16,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:16,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:10:16,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:10:16,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:10:16,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:10:16,417 INFO L87 Difference]: Start difference. First operand 44927 states and 59012 transitions. Second operand 8 states. [2019-08-05 10:10:17,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:17,053 INFO L93 Difference]: Finished difference Result 75763 states and 98574 transitions. [2019-08-05 10:10:17,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:10:17,053 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 196 [2019-08-05 10:10:17,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:17,126 INFO L225 Difference]: With dead ends: 75763 [2019-08-05 10:10:17,127 INFO L226 Difference]: Without dead ends: 75625 [2019-08-05 10:10:17,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:10:17,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75625 states. [2019-08-05 10:10:17,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75625 to 68588. [2019-08-05 10:10:17,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68588 states. [2019-08-05 10:10:17,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68588 states to 68588 states and 89202 transitions. [2019-08-05 10:10:17,776 INFO L78 Accepts]: Start accepts. Automaton has 68588 states and 89202 transitions. Word has length 196 [2019-08-05 10:10:17,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:17,777 INFO L475 AbstractCegarLoop]: Abstraction has 68588 states and 89202 transitions. [2019-08-05 10:10:17,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:10:17,777 INFO L276 IsEmpty]: Start isEmpty. Operand 68588 states and 89202 transitions. [2019-08-05 10:10:17,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-08-05 10:10:17,782 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:17,782 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:10:17,782 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:17,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:17,783 INFO L82 PathProgramCache]: Analyzing trace with hash 2127775696, now seen corresponding path program 1 times [2019-08-05 10:10:17,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:17,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:10:17,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:17,893 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:10:17,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:17,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:10:17,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:10:17,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:10:17,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:17,894 INFO L87 Difference]: Start difference. First operand 68588 states and 89202 transitions. Second operand 3 states. [2019-08-05 10:10:18,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:18,120 INFO L93 Difference]: Finished difference Result 88546 states and 114684 transitions. [2019-08-05 10:10:18,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:10:18,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-08-05 10:10:18,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:18,207 INFO L225 Difference]: With dead ends: 88546 [2019-08-05 10:10:18,207 INFO L226 Difference]: Without dead ends: 87546 [2019-08-05 10:10:18,208 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:10:18,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87546 states. [2019-08-05 10:10:19,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87546 to 87544. [2019-08-05 10:10:19,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87544 states. [2019-08-05 10:10:19,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87544 states to 87544 states and 113300 transitions. [2019-08-05 10:10:19,193 INFO L78 Accepts]: Start accepts. Automaton has 87544 states and 113300 transitions. Word has length 200 [2019-08-05 10:10:19,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:19,193 INFO L475 AbstractCegarLoop]: Abstraction has 87544 states and 113300 transitions. [2019-08-05 10:10:19,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:10:19,193 INFO L276 IsEmpty]: Start isEmpty. Operand 87544 states and 113300 transitions. [2019-08-05 10:10:19,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-08-05 10:10:19,197 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:19,197 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:10:19,197 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:19,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:19,198 INFO L82 PathProgramCache]: Analyzing trace with hash -67160481, now seen corresponding path program 1 times [2019-08-05 10:10:19,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:19,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:19,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:10:19,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:19,409 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:19,409 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:19,409 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:19,410 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:19,410 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:19,411 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:19,411 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:19,412 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:19,412 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:19,413 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:19,413 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:19,827 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 9 [2019-08-05 10:10:20,362 WARN L188 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 9 [2019-08-05 10:10:20,387 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:20,388 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:20,388 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:20,389 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:20,389 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:20,389 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:20,390 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:20,390 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:20,391 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:20,391 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:20,522 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:20,523 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:20,523 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:20,524 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:20,525 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:20,525 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:20,525 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:20,526 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:20,526 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:20,526 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:20,527 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:20,614 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:20,615 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:20,615 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:20,615 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:20,616 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:20,616 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:20,616 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:20,617 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:20,617 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:20,617 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:20,618 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:20,984 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-08-05 10:10:21,249 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-08-05 10:10:21,558 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-08-05 10:10:21,809 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-08-05 10:10:22,007 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-08-05 10:10:22,198 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-08-05 10:10:22,386 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-08-05 10:10:22,544 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-08-05 10:10:22,685 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-08-05 10:10:22,685 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:10:22,763 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,763 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,764 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,765 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,850 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,851 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,851 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,851 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,852 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,853 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,854 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,854 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,855 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,858 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:22,859 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:23,264 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:10:23,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:23,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:10:23,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:10:23,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:10:23,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=652, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:10:23,266 INFO L87 Difference]: Start difference. First operand 87544 states and 113300 transitions. Second operand 30 states. [2019-08-05 10:10:24,368 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-08-05 10:10:27,561 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-08-05 10:10:28,691 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-08-05 10:10:29,147 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-08-05 10:10:30,773 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-08-05 10:10:31,493 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-08-05 10:10:31,772 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-08-05 10:10:31,986 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-08-05 10:10:32,151 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-08-05 10:10:32,781 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-08-05 10:10:33,227 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-08-05 10:10:33,404 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-08-05 10:10:37,589 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-08-05 10:10:37,857 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-08-05 10:10:38,234 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-08-05 10:10:38,543 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-08-05 10:10:39,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:39,719 INFO L93 Difference]: Finished difference Result 560683 states and 758394 transitions. [2019-08-05 10:10:39,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:10:39,720 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 203 [2019-08-05 10:10:39,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:40,549 INFO L225 Difference]: With dead ends: 560683 [2019-08-05 10:10:40,549 INFO L226 Difference]: Without dead ends: 556251 [2019-08-05 10:10:40,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4018 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=2667, Invalid=7839, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:10:40,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556251 states. [2019-08-05 10:10:48,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556251 to 413384. [2019-08-05 10:10:48,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413384 states. [2019-08-05 10:10:49,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413384 states to 413384 states and 572682 transitions. [2019-08-05 10:10:49,371 INFO L78 Accepts]: Start accepts. Automaton has 413384 states and 572682 transitions. Word has length 203 [2019-08-05 10:10:49,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:49,372 INFO L475 AbstractCegarLoop]: Abstraction has 413384 states and 572682 transitions. [2019-08-05 10:10:49,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:10:49,372 INFO L276 IsEmpty]: Start isEmpty. Operand 413384 states and 572682 transitions. [2019-08-05 10:10:49,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-08-05 10:10:49,376 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:49,376 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:10:49,376 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:49,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:49,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1638698119, now seen corresponding path program 1 times [2019-08-05 10:10:49,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:49,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:10:49,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:49,526 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:49,526 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:49,526 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:49,527 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:49,527 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:49,527 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:49,528 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:49,528 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:49,528 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:49,529 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:49,529 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:49,812 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:10:49,814 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:49,814 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:49,815 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:49,815 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:49,816 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:49,816 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:49,817 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:49,817 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:49,818 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:49,818 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:49,819 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,004 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,005 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,005 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,006 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,006 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,006 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,007 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,007 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,008 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,008 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,008 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,171 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,172 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,172 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,173 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,173 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,174 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,174 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,174 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,175 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,175 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,358 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,358 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,359 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,359 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,359 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,360 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,360 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,360 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,361 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,361 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,362 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,437 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,438 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,438 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,439 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,440 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,440 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,440 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,441 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,686 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:10:50,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:50,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:10:50,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:10:50,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:10:50,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:10:50,687 INFO L87 Difference]: Start difference. First operand 413384 states and 572682 transitions. Second operand 16 states. [2019-08-05 10:10:57,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:57,935 INFO L93 Difference]: Finished difference Result 414860 states and 574279 transitions. [2019-08-05 10:10:57,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:10:57,935 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 204 [2019-08-05 10:10:57,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:58,618 INFO L225 Difference]: With dead ends: 414860 [2019-08-05 10:10:58,618 INFO L226 Difference]: Without dead ends: 414860 [2019-08-05 10:10:58,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 187 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=179, Invalid=751, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:10:58,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414860 states. [2019-08-05 10:11:03,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414860 to 413581. [2019-08-05 10:11:03,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413581 states. [2019-08-05 10:11:10,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413581 states to 413581 states and 572902 transitions. [2019-08-05 10:11:10,406 INFO L78 Accepts]: Start accepts. Automaton has 413581 states and 572902 transitions. Word has length 204 [2019-08-05 10:11:10,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:10,407 INFO L475 AbstractCegarLoop]: Abstraction has 413581 states and 572902 transitions. [2019-08-05 10:11:10,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:11:10,407 INFO L276 IsEmpty]: Start isEmpty. Operand 413581 states and 572902 transitions. [2019-08-05 10:11:10,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-08-05 10:11:10,413 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:10,413 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:11:10,413 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:10,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:10,414 INFO L82 PathProgramCache]: Analyzing trace with hash -733642234, now seen corresponding path program 1 times [2019-08-05 10:11:10,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:10,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:11:10,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:10,581 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,581 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,581 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,582 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,582 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,583 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,583 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,583 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,584 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,584 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,584 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,691 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,691 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,692 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,692 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,692 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,693 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,693 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,693 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,694 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,694 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,695 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,704 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,705 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,705 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,705 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,706 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,706 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,706 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,707 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,707 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,708 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,708 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,721 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,722 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,722 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,723 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,723 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,723 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,724 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,724 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,724 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,725 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,827 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,827 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,828 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,828 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,829 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,829 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,830 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,830 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,831 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,831 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,832 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,908 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,909 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,910 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,911 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,911 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,912 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,912 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,912 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,913 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,913 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:10,914 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:11,106 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2019-08-05 10:11:11,770 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:11:11,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:11:11,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:11:11,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:11:11,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:11:11,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:11:11,772 INFO L87 Difference]: Start difference. First operand 413581 states and 572902 transitions. Second operand 19 states. [2019-08-05 10:11:22,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:22,564 INFO L93 Difference]: Finished difference Result 715237 states and 971408 transitions. [2019-08-05 10:11:22,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:11:22,565 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 204 [2019-08-05 10:11:22,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:23,699 INFO L225 Difference]: With dead ends: 715237 [2019-08-05 10:11:23,699 INFO L226 Difference]: Without dead ends: 709845 [2019-08-05 10:11:23,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 182 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=361, Invalid=569, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:11:24,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709845 states. [2019-08-05 10:11:39,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709845 to 617880. [2019-08-05 10:11:39,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617880 states. [2019-08-05 10:11:40,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617880 states to 617880 states and 851738 transitions. [2019-08-05 10:11:40,273 INFO L78 Accepts]: Start accepts. Automaton has 617880 states and 851738 transitions. Word has length 204 [2019-08-05 10:11:40,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:40,273 INFO L475 AbstractCegarLoop]: Abstraction has 617880 states and 851738 transitions. [2019-08-05 10:11:40,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:11:40,273 INFO L276 IsEmpty]: Start isEmpty. Operand 617880 states and 851738 transitions. [2019-08-05 10:11:40,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-08-05 10:11:40,279 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:40,279 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:11:40,279 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:40,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:40,280 INFO L82 PathProgramCache]: Analyzing trace with hash -402574455, now seen corresponding path program 1 times [2019-08-05 10:11:40,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:40,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:11:40,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:40,410 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:11:40,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:40,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:11:40,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:11:40,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:11:40,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:11:40,412 INFO L87 Difference]: Start difference. First operand 617880 states and 851738 transitions. Second operand 3 states. [2019-08-05 10:11:44,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:44,029 INFO L93 Difference]: Finished difference Result 614256 states and 831608 transitions. [2019-08-05 10:11:44,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:11:44,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-08-05 10:11:44,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:45,087 INFO L225 Difference]: With dead ends: 614256 [2019-08-05 10:11:45,087 INFO L226 Difference]: Without dead ends: 600340 [2019-08-05 10:11:45,088 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 [2019-08-05 10:11:45,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600340 states. [2019-08-05 10:12:00,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600340 to 576854. [2019-08-05 10:12:00,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576854 states. [2019-08-05 10:12:02,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576854 states to 576854 states and 782792 transitions. [2019-08-05 10:12:02,988 INFO L78 Accepts]: Start accepts. Automaton has 576854 states and 782792 transitions. Word has length 206 [2019-08-05 10:12:02,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:02,988 INFO L475 AbstractCegarLoop]: Abstraction has 576854 states and 782792 transitions. [2019-08-05 10:12:02,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:02,988 INFO L276 IsEmpty]: Start isEmpty. Operand 576854 states and 782792 transitions. [2019-08-05 10:12:02,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-08-05 10:12:02,991 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:02,991 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, 6, 5, 5, 5, 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, 1, 1, 1] [2019-08-05 10:12:02,992 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:02,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:02,992 INFO L82 PathProgramCache]: Analyzing trace with hash -947645514, now seen corresponding path program 1 times [2019-08-05 10:12:02,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:03,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:12:03,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:03,167 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-08-05 10:12:03,248 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 191 proven. 149 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-08-05 10:12:03,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:03,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:12:03,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:12:03,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:12:03,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:12:03,249 INFO L87 Difference]: Start difference. First operand 576854 states and 782792 transitions. Second operand 6 states. [2019-08-05 10:12:11,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:11,221 INFO L93 Difference]: Finished difference Result 573497 states and 778805 transitions. [2019-08-05 10:12:11,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:12:11,221 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 208 [2019-08-05 10:12:11,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:12,066 INFO L225 Difference]: With dead ends: 573497 [2019-08-05 10:12:12,066 INFO L226 Difference]: Without dead ends: 573137 [2019-08-05 10:12:12,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:12:12,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573137 states. [2019-08-05 10:12:23,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573137 to 573110. [2019-08-05 10:12:23,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573110 states. [2019-08-05 10:12:25,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573110 states to 573110 states and 778415 transitions. [2019-08-05 10:12:25,773 INFO L78 Accepts]: Start accepts. Automaton has 573110 states and 778415 transitions. Word has length 208 [2019-08-05 10:12:25,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:25,773 INFO L475 AbstractCegarLoop]: Abstraction has 573110 states and 778415 transitions. [2019-08-05 10:12:25,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:12:25,773 INFO L276 IsEmpty]: Start isEmpty. Operand 573110 states and 778415 transitions. [2019-08-05 10:12:25,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-08-05 10:12:25,777 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:25,777 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, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:25,778 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:25,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:25,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1925586360, now seen corresponding path program 1 times [2019-08-05 10:12:25,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:25,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:12:25,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:25,964 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,964 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,965 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,965 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,965 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,966 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,966 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,967 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,967 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,968 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,968 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,063 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,063 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,064 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,064 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,065 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,065 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,066 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,066 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,067 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,067 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,240 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,241 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,242 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,242 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,242 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,243 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,243 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,243 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,244 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,244 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,244 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,326 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,327 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,328 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,328 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,328 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,329 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,329 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,330 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,330 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,331 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,331 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,723 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-08-05 10:12:26,984 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-08-05 10:12:27,228 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-08-05 10:12:27,455 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-08-05 10:12:27,663 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-08-05 10:12:27,848 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-08-05 10:12:28,019 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-08-05 10:12:28,173 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-08-05 10:12:28,312 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-08-05 10:12:28,364 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:28,364 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:28,364 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:28,365 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:28,365 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:28,365 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:28,408 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:28,408 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:28,408 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:28,409 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:28,409 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:28,410 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:28,411 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:28,411 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:28,412 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:28,412 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:28,585 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 34 proven. 448 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:28,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:28,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:12:28,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:12:28,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:12:28,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:12:28,587 INFO L87 Difference]: Start difference. First operand 573110 states and 778415 transitions. Second operand 23 states. [2019-08-05 10:12:29,441 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-08-05 10:12:34,410 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2019-08-05 10:12:34,555 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-08-05 10:12:34,946 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 Received shutdown request... [2019-08-05 10:12:35,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:12:35,190 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:12:35,195 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:12:35,197 INFO L202 PluginConnector]: Adding new model u2b07_batman_intermittent_power_800.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:12:35 BoogieIcfgContainer [2019-08-05 10:12:35,198 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:12:35,199 INFO L168 Benchmark]: Toolchain (without parser) took 194374.20 ms. Allocated memory was 133.7 MB in the beginning and 3.7 GB in the end (delta: 3.6 GB). Free memory was 107.6 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 999.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:12:35,200 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 133.7 MB. Free memory was 112.5 MB in the beginning and 112.2 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:12:35,202 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.92 ms. Allocated memory is still 133.7 MB. Free memory was 107.6 MB in the beginning and 105.3 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:12:35,203 INFO L168 Benchmark]: Boogie Preprocessor took 107.38 ms. Allocated memory is still 133.7 MB. Free memory was 105.3 MB in the beginning and 101.7 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:12:35,205 INFO L168 Benchmark]: RCFGBuilder took 4423.35 ms. Allocated memory was 133.7 MB in the beginning and 196.6 MB in the end (delta: 62.9 MB). Free memory was 101.7 MB in the beginning and 136.6 MB in the end (delta: -34.9 MB). Peak memory consumption was 87.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:12:35,205 INFO L168 Benchmark]: TraceAbstraction took 189765.96 ms. Allocated memory was 196.6 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 136.6 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 965.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:12:35,215 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 133.7 MB. Free memory was 112.5 MB in the beginning and 112.2 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 72.92 ms. Allocated memory is still 133.7 MB. Free memory was 107.6 MB in the beginning and 105.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 107.38 ms. Allocated memory is still 133.7 MB. Free memory was 105.3 MB in the beginning and 101.7 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4423.35 ms. Allocated memory was 133.7 MB in the beginning and 196.6 MB in the end (delta: 62.9 MB). Free memory was 101.7 MB in the beginning and 136.6 MB in the end (delta: -34.9 MB). Peak memory consumption was 87.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 189765.96 ms. Allocated memory was 196.6 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 136.6 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 965.5 MB. 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 BasicCegarLoop was constructing difference of abstraction (573110states) and FLOYD_HOARE automaton (currently 19 states, 23 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 37 known predicates. - TimeoutResultAtElement [Line: 706]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 706). Cancelled while BasicCegarLoop was constructing difference of abstraction (573110states) and FLOYD_HOARE automaton (currently 19 states, 23 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 37 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 2 error locations. TIMEOUT Result, 189.7s OverallTime, 37 OverallIterations, 6 TraceHistogramMax, 77.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6642 SDtfs, 17538 SDslu, 22624 SDs, 0 SdLazy, 10975 SolverSat, 1909 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4800 GetRequests, 4371 SyntacticMatches, 32 SemanticMatches, 396 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5756 ImplicationChecksByTransitivity, 37.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=617880occurred 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: 76.8s AutomataMinimizationTime, 36 MinimizatonAttempts, 321537 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 32.5s InterpolantComputationTime, 4651 NumberOfCodeBlocks, 4651 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 4614 ConstructedInterpolants, 0 QuantifiedInterpolants, 4886368 SizeOfPredicates, 168 NumberOfNonLiveVariables, 13279 ConjunctsInSsa, 419 ConjunctsInUnsatCore, 37 InterpolantComputations, 19 PerfectInterpolantSequences, 4241/7526 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown