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/PricedTimedAutomata/u2b08_batman_intermittent_power_1slot_SAFE.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:12:34,754 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:12:34,756 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:12:34,768 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:12:34,768 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:12:34,769 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:12:34,771 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:12:34,774 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:12:34,776 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:12:34,777 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:12:34,779 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:12:34,779 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:12:34,779 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:12:34,780 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:12:34,782 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:12:34,783 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:12:34,784 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:12:34,785 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:12:34,787 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:12:34,789 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:12:34,791 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:12:34,792 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:12:34,794 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:12:34,794 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:12:34,797 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:12:34,797 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:12:34,798 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:12:34,799 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:12:34,799 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:12:34,800 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:12:34,801 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:12:34,801 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:12:34,802 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:12:34,803 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:12:34,805 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:12:34,805 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:12:34,806 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:12:34,806 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:12:34,806 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:12:34,807 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:12:34,808 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:12:34,839 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:12:34,852 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:12:34,855 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:12:34,857 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:12:34,858 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:12:34,858 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/PricedTimedAutomata/u2b08_batman_intermittent_power_1slot_SAFE.bpl [2019-08-05 10:12:34,859 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/PricedTimedAutomata/u2b08_batman_intermittent_power_1slot_SAFE.bpl' [2019-08-05 10:12:34,935 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:12:34,936 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:12:34,937 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:12:34,937 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:12:34,937 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:12:34,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "u2b08_batman_intermittent_power_1slot_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:34" (1/1) ... [2019-08-05 10:12:34,975 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "u2b08_batman_intermittent_power_1slot_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:34" (1/1) ... [2019-08-05 10:12:34,983 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:12:34,983 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:12:34,983 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:12:34,987 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:12:34,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:12:34,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:12:34,988 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:12:35,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "u2b08_batman_intermittent_power_1slot_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:34" (1/1) ... [2019-08-05 10:12:35,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "u2b08_batman_intermittent_power_1slot_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:34" (1/1) ... [2019-08-05 10:12:35,009 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "u2b08_batman_intermittent_power_1slot_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:34" (1/1) ... [2019-08-05 10:12:35,011 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "u2b08_batman_intermittent_power_1slot_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:34" (1/1) ... [2019-08-05 10:12:35,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "u2b08_batman_intermittent_power_1slot_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:34" (1/1) ... [2019-08-05 10:12:35,046 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "u2b08_batman_intermittent_power_1slot_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:34" (1/1) ... [2019-08-05 10:12:35,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "u2b08_batman_intermittent_power_1slot_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:34" (1/1) ... [2019-08-05 10:12:35,082 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:12:35,086 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:12:35,087 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:12:35,087 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:12:35,088 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "u2b08_batman_intermittent_power_1slot_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:34" (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:12:35,160 INFO L130 BoogieDeclarations]: Found specification of procedure perform_resets [2019-08-05 10:12:35,160 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_time [2019-08-05 10:12:35,160 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_channelBusy [2019-08-05 10:12:35,161 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_ENV_1$t0 [2019-08-05 10:12:35,161 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_MEDIUM_1$sendCount [2019-08-05 10:12:35,161 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_MEDIUM_1$t0 [2019-08-05 10:12:35,161 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_ENV_1$t [2019-08-05 10:12:35,162 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:12:35,162 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:12:35,162 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:12:35,162 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_queue [2019-08-05 10:12:35,162 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_MAC_1$t0 [2019-08-05 10:12:35,163 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_MAC_1$t [2019-08-05 10:12:35,425 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-08-05 10:12:39,079 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:12:39,079 INFO L283 CfgBuilder]: Removed 29 assume(true) statements. [2019-08-05 10:12:39,080 INFO L202 PluginConnector]: Adding new model u2b08_batman_intermittent_power_1slot_SAFE.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:12:39 BoogieIcfgContainer [2019-08-05 10:12:39,081 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:12:39,082 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:12:39,083 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:12:39,085 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:12:39,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "u2b08_batman_intermittent_power_1slot_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:34" (1/2) ... [2019-08-05 10:12:39,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@267cbe91 and model type u2b08_batman_intermittent_power_1slot_SAFE.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:12:39, skipping insertion in model container [2019-08-05 10:12:39,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "u2b08_batman_intermittent_power_1slot_SAFE.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:12:39" (2/2) ... [2019-08-05 10:12:39,089 INFO L109 eAbstractionObserver]: Analyzing ICFG u2b08_batman_intermittent_power_1slot_SAFE.bpl [2019-08-05 10:12:39,098 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:12:39,109 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 10:12:39,125 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 10:12:39,150 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:12:39,151 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:12:39,151 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:12:39,152 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:12:39,152 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:12:39,152 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:12:39,153 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:12:39,154 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:12:39,154 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:12:39,169 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2019-08-05 10:12:39,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:12:39,178 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:39,178 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:12:39,180 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:39,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:39,185 INFO L82 PathProgramCache]: Analyzing trace with hash 19068, now seen corresponding path program 1 times [2019-08-05 10:12:39,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:39,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:39,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:39,366 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:12:39,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:39,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:12:39,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:39,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:39,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:39,386 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 3 states. [2019-08-05 10:12:39,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:39,492 INFO L93 Difference]: Finished difference Result 69 states and 131 transitions. [2019-08-05 10:12:39,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:39,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:12:39,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:39,515 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:12:39,515 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:12:39,518 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:12:39,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:12:39,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:12:39,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:12:39,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 121 transitions. [2019-08-05 10:12:39,566 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 121 transitions. Word has length 2 [2019-08-05 10:12:39,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:39,567 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 121 transitions. [2019-08-05 10:12:39,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:39,567 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 121 transitions. [2019-08-05 10:12:39,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:12:39,568 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:39,568 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:12:39,569 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:39,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:39,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1051522771, now seen corresponding path program 1 times [2019-08-05 10:12:39,606 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:39,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:39,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:39,711 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:12:39,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:39,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:12:39,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:39,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:39,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:39,720 INFO L87 Difference]: Start difference. First operand 67 states and 121 transitions. Second operand 3 states. [2019-08-05 10:12:40,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:40,202 INFO L93 Difference]: Finished difference Result 121 states and 205 transitions. [2019-08-05 10:12:40,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:40,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-08-05 10:12:40,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:40,205 INFO L225 Difference]: With dead ends: 121 [2019-08-05 10:12:40,205 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 10:12:40,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:12:40,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 10:12:40,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2019-08-05 10:12:40,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 10:12:40,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 204 transitions. [2019-08-05 10:12:40,225 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 204 transitions. Word has length 6 [2019-08-05 10:12:40,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:40,225 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 204 transitions. [2019-08-05 10:12:40,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:40,225 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 204 transitions. [2019-08-05 10:12:40,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:12:40,226 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:40,226 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:40,227 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:40,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:40,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1269290875, now seen corresponding path program 1 times [2019-08-05 10:12:40,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:40,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:40,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:40,338 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:12:40,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:40,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:12:40,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:40,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:40,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:40,340 INFO L87 Difference]: Start difference. First operand 118 states and 204 transitions. Second operand 3 states. [2019-08-05 10:12:40,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:40,531 INFO L93 Difference]: Finished difference Result 230 states and 382 transitions. [2019-08-05 10:12:40,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:40,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-08-05 10:12:40,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:40,535 INFO L225 Difference]: With dead ends: 230 [2019-08-05 10:12:40,535 INFO L226 Difference]: Without dead ends: 224 [2019-08-05 10:12:40,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 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:12:40,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-08-05 10:12:40,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 220. [2019-08-05 10:12:40,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-08-05 10:12:40,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 374 transitions. [2019-08-05 10:12:40,558 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 374 transitions. Word has length 19 [2019-08-05 10:12:40,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:40,559 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 374 transitions. [2019-08-05 10:12:40,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:40,559 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 374 transitions. [2019-08-05 10:12:40,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:12:40,560 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:40,560 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:40,560 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:40,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:40,561 INFO L82 PathProgramCache]: Analyzing trace with hash 122097530, now seen corresponding path program 1 times [2019-08-05 10:12:40,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:40,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:40,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:40,628 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:12:40,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:40,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:12:40,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:40,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:40,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:40,630 INFO L87 Difference]: Start difference. First operand 220 states and 374 transitions. Second operand 3 states. [2019-08-05 10:12:40,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:40,774 INFO L93 Difference]: Finished difference Result 402 states and 638 transitions. [2019-08-05 10:12:40,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:40,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-08-05 10:12:40,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:40,779 INFO L225 Difference]: With dead ends: 402 [2019-08-05 10:12:40,780 INFO L226 Difference]: Without dead ends: 402 [2019-08-05 10:12:40,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 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:12:40,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-08-05 10:12:40,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 396. [2019-08-05 10:12:40,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-08-05 10:12:40,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 634 transitions. [2019-08-05 10:12:40,806 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 634 transitions. Word has length 24 [2019-08-05 10:12:40,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:40,806 INFO L475 AbstractCegarLoop]: Abstraction has 396 states and 634 transitions. [2019-08-05 10:12:40,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:40,807 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 634 transitions. [2019-08-05 10:12:40,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:12:40,808 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:40,808 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] [2019-08-05 10:12:40,808 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:40,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:40,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1533280950, now seen corresponding path program 1 times [2019-08-05 10:12:40,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:40,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:12:40,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:40,984 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:40,985 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:40,986 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:40,987 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:40,988 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:40,989 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:40,990 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:40,991 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:40,992 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:40,993 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:41,265 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:12:41,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:41,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:12:41,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:12:41,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:12:41,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:12:41,267 INFO L87 Difference]: Start difference. First operand 396 states and 634 transitions. Second operand 5 states. [2019-08-05 10:12:41,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:41,393 INFO L93 Difference]: Finished difference Result 436 states and 676 transitions. [2019-08-05 10:12:41,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:12:41,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-08-05 10:12:41,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:41,399 INFO L225 Difference]: With dead ends: 436 [2019-08-05 10:12:41,399 INFO L226 Difference]: Without dead ends: 436 [2019-08-05 10:12:41,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 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:12:41,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-08-05 10:12:41,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2019-08-05 10:12:41,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-08-05 10:12:41,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 676 transitions. [2019-08-05 10:12:41,442 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 676 transitions. Word has length 33 [2019-08-05 10:12:41,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:41,443 INFO L475 AbstractCegarLoop]: Abstraction has 436 states and 676 transitions. [2019-08-05 10:12:41,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:12:41,443 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 676 transitions. [2019-08-05 10:12:41,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:12:41,444 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:41,445 INFO L399 BasicCegarLoop]: trace histogram [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:12:41,445 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:41,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:41,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1664810407, now seen corresponding path program 1 times [2019-08-05 10:12:41,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:41,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:41,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:41,520 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:41,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:41,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:12:41,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:41,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:41,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:41,522 INFO L87 Difference]: Start difference. First operand 436 states and 676 transitions. Second operand 3 states. [2019-08-05 10:12:41,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:41,833 INFO L93 Difference]: Finished difference Result 614 states and 924 transitions. [2019-08-05 10:12:41,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:41,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-08-05 10:12:41,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:41,838 INFO L225 Difference]: With dead ends: 614 [2019-08-05 10:12:41,839 INFO L226 Difference]: Without dead ends: 614 [2019-08-05 10:12:41,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 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:12:41,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-08-05 10:12:41,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 612. [2019-08-05 10:12:41,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-08-05 10:12:41,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 924 transitions. [2019-08-05 10:12:41,860 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 924 transitions. Word has length 54 [2019-08-05 10:12:41,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:41,861 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 924 transitions. [2019-08-05 10:12:41,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:41,862 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 924 transitions. [2019-08-05 10:12:41,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:12:41,867 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:41,867 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:41,868 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:41,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:41,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1430263716, now seen corresponding path program 1 times [2019-08-05 10:12:41,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:41,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:41,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:41,999 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:41,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:41,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:12:42,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:42,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:42,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:42,000 INFO L87 Difference]: Start difference. First operand 612 states and 924 transitions. Second operand 3 states. [2019-08-05 10:12:42,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:42,399 INFO L93 Difference]: Finished difference Result 892 states and 1304 transitions. [2019-08-05 10:12:42,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:42,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-08-05 10:12:42,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:42,409 INFO L225 Difference]: With dead ends: 892 [2019-08-05 10:12:42,409 INFO L226 Difference]: Without dead ends: 892 [2019-08-05 10:12:42,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 55 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:12:42,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2019-08-05 10:12:42,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 890. [2019-08-05 10:12:42,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2019-08-05 10:12:42,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1304 transitions. [2019-08-05 10:12:42,428 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1304 transitions. Word has length 58 [2019-08-05 10:12:42,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:42,429 INFO L475 AbstractCegarLoop]: Abstraction has 890 states and 1304 transitions. [2019-08-05 10:12:42,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:42,429 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1304 transitions. [2019-08-05 10:12:42,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:12:42,430 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:42,431 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:42,431 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:42,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:42,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1683091716, now seen corresponding path program 1 times [2019-08-05 10:12:42,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:42,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:42,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:42,489 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:42,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:42,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:12:42,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:42,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:42,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:42,491 INFO L87 Difference]: Start difference. First operand 890 states and 1304 transitions. Second operand 3 states. [2019-08-05 10:12:42,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:42,563 INFO L93 Difference]: Finished difference Result 873 states and 1265 transitions. [2019-08-05 10:12:42,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:42,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-08-05 10:12:42,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:42,577 INFO L225 Difference]: With dead ends: 873 [2019-08-05 10:12:42,577 INFO L226 Difference]: Without dead ends: 863 [2019-08-05 10:12:42,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 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:12:42,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2019-08-05 10:12:42,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 863. [2019-08-05 10:12:42,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2019-08-05 10:12:42,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1255 transitions. [2019-08-05 10:12:42,597 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1255 transitions. Word has length 64 [2019-08-05 10:12:42,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:42,597 INFO L475 AbstractCegarLoop]: Abstraction has 863 states and 1255 transitions. [2019-08-05 10:12:42,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:42,598 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1255 transitions. [2019-08-05 10:12:42,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:12:42,599 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:42,599 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:42,600 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:42,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:42,600 INFO L82 PathProgramCache]: Analyzing trace with hash 145318395, now seen corresponding path program 1 times [2019-08-05 10:12:42,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:42,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:12:42,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:42,766 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:42,767 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:42,768 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:42,769 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:42,770 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:42,771 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:42,771 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:42,772 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:42,773 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:42,775 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:43,123 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 5 [2019-08-05 10:12:43,734 WARN L188 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 5 [2019-08-05 10:12:43,865 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:43,866 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:43,867 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:43,868 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:43,869 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:43,870 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:43,872 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:43,872 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:43,873 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:43,874 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:43,875 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:44,203 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 5 [2019-08-05 10:12:44,407 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-08-05 10:12:44,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:44,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:12:44,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:12:44,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:12:44,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:12:44,409 INFO L87 Difference]: Start difference. First operand 863 states and 1255 transitions. Second operand 6 states. [2019-08-05 10:12:45,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:45,311 INFO L93 Difference]: Finished difference Result 899 states and 1292 transitions. [2019-08-05 10:12:45,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:12:45,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-08-05 10:12:45,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:45,317 INFO L225 Difference]: With dead ends: 899 [2019-08-05 10:12:45,318 INFO L226 Difference]: Without dead ends: 899 [2019-08-05 10:12:45,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:12:45,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-08-05 10:12:45,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 899. [2019-08-05 10:12:45,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2019-08-05 10:12:45,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1292 transitions. [2019-08-05 10:12:45,336 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1292 transitions. Word has length 66 [2019-08-05 10:12:45,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:45,336 INFO L475 AbstractCegarLoop]: Abstraction has 899 states and 1292 transitions. [2019-08-05 10:12:45,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:12:45,336 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1292 transitions. [2019-08-05 10:12:45,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:12:45,341 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:45,342 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:45,342 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:45,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:45,342 INFO L82 PathProgramCache]: Analyzing trace with hash -2066776048, now seen corresponding path program 1 times [2019-08-05 10:12:45,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:45,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:12:45,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:45,513 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:45,513 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:45,514 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:45,516 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:45,517 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:45,518 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:45,519 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:45,519 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:45,520 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:45,522 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:45,522 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:45,785 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 9 [2019-08-05 10:12:45,854 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:45,855 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:45,856 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:45,857 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:45,858 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:45,858 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:45,859 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:45,860 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:45,861 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:45,862 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:46,031 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:46,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:46,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:12:46,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:12:46,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:12:46,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:12:46,033 INFO L87 Difference]: Start difference. First operand 899 states and 1292 transitions. Second operand 6 states. [2019-08-05 10:12:46,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:46,242 INFO L93 Difference]: Finished difference Result 992 states and 1406 transitions. [2019-08-05 10:12:46,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:12:46,249 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-08-05 10:12:46,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:46,254 INFO L225 Difference]: With dead ends: 992 [2019-08-05 10:12:46,255 INFO L226 Difference]: Without dead ends: 992 [2019-08-05 10:12:46,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:12:46,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2019-08-05 10:12:46,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 989. [2019-08-05 10:12:46,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 989 states. [2019-08-05 10:12:46,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1403 transitions. [2019-08-05 10:12:46,273 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1403 transitions. Word has length 66 [2019-08-05 10:12:46,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:46,273 INFO L475 AbstractCegarLoop]: Abstraction has 989 states and 1403 transitions. [2019-08-05 10:12:46,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:12:46,274 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1403 transitions. [2019-08-05 10:12:46,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:12:46,275 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:46,275 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:12:46,275 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:46,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:46,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1757702536, now seen corresponding path program 1 times [2019-08-05 10:12:46,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:46,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:46,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:12:46,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:46,387 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 69 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:46,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:46,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:12:46,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:12:46,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:12:46,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:12:46,389 INFO L87 Difference]: Start difference. First operand 989 states and 1403 transitions. Second operand 4 states. [2019-08-05 10:12:46,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:46,832 INFO L93 Difference]: Finished difference Result 2336 states and 3296 transitions. [2019-08-05 10:12:46,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:12:46,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-08-05 10:12:46,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:46,844 INFO L225 Difference]: With dead ends: 2336 [2019-08-05 10:12:46,844 INFO L226 Difference]: Without dead ends: 2336 [2019-08-05 10:12:46,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:12:46,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2019-08-05 10:12:46,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 2021. [2019-08-05 10:12:46,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2021 states. [2019-08-05 10:12:46,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2021 states to 2021 states and 2869 transitions. [2019-08-05 10:12:46,891 INFO L78 Accepts]: Start accepts. Automaton has 2021 states and 2869 transitions. Word has length 88 [2019-08-05 10:12:46,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:46,892 INFO L475 AbstractCegarLoop]: Abstraction has 2021 states and 2869 transitions. [2019-08-05 10:12:46,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:12:46,892 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 2869 transitions. [2019-08-05 10:12:46,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 10:12:46,893 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:46,893 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-08-05 10:12:46,894 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:46,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:46,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1364453069, now seen corresponding path program 1 times [2019-08-05 10:12:46,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:46,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:46,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:47,006 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-08-05 10:12:47,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:47,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:12:47,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:47,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:47,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:47,009 INFO L87 Difference]: Start difference. First operand 2021 states and 2869 transitions. Second operand 3 states. [2019-08-05 10:12:47,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:47,492 INFO L93 Difference]: Finished difference Result 2912 states and 4106 transitions. [2019-08-05 10:12:47,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:47,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-08-05 10:12:47,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:47,506 INFO L225 Difference]: With dead ends: 2912 [2019-08-05 10:12:47,507 INFO L226 Difference]: Without dead ends: 2888 [2019-08-05 10:12:47,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 91 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:12:47,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2019-08-05 10:12:47,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 2866. [2019-08-05 10:12:47,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2866 states. [2019-08-05 10:12:47,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2866 states to 2866 states and 4061 transitions. [2019-08-05 10:12:47,566 INFO L78 Accepts]: Start accepts. Automaton has 2866 states and 4061 transitions. Word has length 94 [2019-08-05 10:12:47,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:47,567 INFO L475 AbstractCegarLoop]: Abstraction has 2866 states and 4061 transitions. [2019-08-05 10:12:47,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:47,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2866 states and 4061 transitions. [2019-08-05 10:12:47,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:12:47,568 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:47,568 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:47,568 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:47,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:47,569 INFO L82 PathProgramCache]: Analyzing trace with hash 406786751, now seen corresponding path program 1 times [2019-08-05 10:12:47,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:47,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:12:47,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:47,717 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:47,718 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:47,719 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:47,721 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:47,722 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:47,723 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:47,724 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:47,725 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:47,726 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:47,727 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:48,200 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 8 [2019-08-05 10:12:48,882 WARN L188 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 8 [2019-08-05 10:12:49,052 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:12:49,054 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:49,055 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:49,059 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:49,059 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:49,060 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:49,061 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:49,061 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:49,062 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:49,063 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:49,064 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:49,065 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:49,647 WARN L188 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 8 [2019-08-05 10:12:49,776 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:49,776 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:49,777 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:49,782 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:49,784 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:49,785 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:49,786 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:49,787 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:49,788 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:49,789 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:49,790 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:50,554 WARN L188 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 80 [2019-08-05 10:12:51,056 WARN L188 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2019-08-05 10:12:51,585 WARN L188 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-08-05 10:12:51,981 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-08-05 10:12:52,236 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2019-08-05 10:12:52,457 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-08-05 10:12:52,671 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-08-05 10:12:52,978 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-08-05 10:12:53,124 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-08-05 10:12:53,191 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-08-05 10:12:53,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:53,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:12:53,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:12:53,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:12:53,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=123, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:12:53,195 INFO L87 Difference]: Start difference. First operand 2866 states and 4061 transitions. Second operand 15 states. [2019-08-05 10:12:53,511 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-08-05 10:12:54,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:54,409 INFO L93 Difference]: Finished difference Result 6823 states and 9348 transitions. [2019-08-05 10:12:54,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:12:54,416 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 98 [2019-08-05 10:12:54,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:54,443 INFO L225 Difference]: With dead ends: 6823 [2019-08-05 10:12:54,443 INFO L226 Difference]: Without dead ends: 6791 [2019-08-05 10:12:54,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=117, Invalid=155, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:12:54,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6791 states. [2019-08-05 10:12:54,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6791 to 5952. [2019-08-05 10:12:54,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5952 states. [2019-08-05 10:12:54,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5952 states to 5952 states and 8246 transitions. [2019-08-05 10:12:54,594 INFO L78 Accepts]: Start accepts. Automaton has 5952 states and 8246 transitions. Word has length 98 [2019-08-05 10:12:54,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:54,595 INFO L475 AbstractCegarLoop]: Abstraction has 5952 states and 8246 transitions. [2019-08-05 10:12:54,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:12:54,596 INFO L276 IsEmpty]: Start isEmpty. Operand 5952 states and 8246 transitions. [2019-08-05 10:12:54,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:12:54,598 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:54,598 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-08-05 10:12:54,598 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:54,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:54,599 INFO L82 PathProgramCache]: Analyzing trace with hash 421997565, now seen corresponding path program 1 times [2019-08-05 10:12:54,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:54,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:54,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:54,716 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-08-05 10:12:54,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:54,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:12:54,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:54,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:54,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:54,719 INFO L87 Difference]: Start difference. First operand 5952 states and 8246 transitions. Second operand 3 states. [2019-08-05 10:12:55,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:55,077 INFO L93 Difference]: Finished difference Result 7807 states and 10568 transitions. [2019-08-05 10:12:55,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:55,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-08-05 10:12:55,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:55,103 INFO L225 Difference]: With dead ends: 7807 [2019-08-05 10:12:55,104 INFO L226 Difference]: Without dead ends: 7807 [2019-08-05 10:12:55,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 95 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:12:55,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7807 states. [2019-08-05 10:12:55,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7807 to 7546. [2019-08-05 10:12:55,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7546 states. [2019-08-05 10:12:55,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7546 states to 7546 states and 10309 transitions. [2019-08-05 10:12:55,223 INFO L78 Accepts]: Start accepts. Automaton has 7546 states and 10309 transitions. Word has length 98 [2019-08-05 10:12:55,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:55,223 INFO L475 AbstractCegarLoop]: Abstraction has 7546 states and 10309 transitions. [2019-08-05 10:12:55,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:55,223 INFO L276 IsEmpty]: Start isEmpty. Operand 7546 states and 10309 transitions. [2019-08-05 10:12:55,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 10:12:55,225 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:55,225 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, 2, 2, 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:12:55,225 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:55,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:55,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1379499634, now seen corresponding path program 1 times [2019-08-05 10:12:55,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:55,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:12:55,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:55,341 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:55,343 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:55,344 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:55,344 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:55,345 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:55,345 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:55,346 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:55,347 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:55,347 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:55,348 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:55,350 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:55,512 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:55,512 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:55,513 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:55,513 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:55,514 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:55,515 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:55,515 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:55,516 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:55,517 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:55,517 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:55,518 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:55,678 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:55,679 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:55,680 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:55,681 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:55,681 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:55,682 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:55,682 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:55,683 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:55,684 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:55,684 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:55,808 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-08-05 10:12:55,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:55,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:12:55,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:12:55,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:12:55,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:12:55,809 INFO L87 Difference]: Start difference. First operand 7546 states and 10309 transitions. Second operand 7 states. [2019-08-05 10:12:56,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:56,214 INFO L93 Difference]: Finished difference Result 8038 states and 10909 transitions. [2019-08-05 10:12:56,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:12:56,215 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2019-08-05 10:12:56,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:56,231 INFO L225 Difference]: With dead ends: 8038 [2019-08-05 10:12:56,231 INFO L226 Difference]: Without dead ends: 8038 [2019-08-05 10:12:56,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:12:56,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8038 states. [2019-08-05 10:12:56,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8038 to 8015. [2019-08-05 10:12:56,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8015 states. [2019-08-05 10:12:56,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8015 states to 8015 states and 10886 transitions. [2019-08-05 10:12:56,341 INFO L78 Accepts]: Start accepts. Automaton has 8015 states and 10886 transitions. Word has length 104 [2019-08-05 10:12:56,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:56,341 INFO L475 AbstractCegarLoop]: Abstraction has 8015 states and 10886 transitions. [2019-08-05 10:12:56,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:12:56,341 INFO L276 IsEmpty]: Start isEmpty. Operand 8015 states and 10886 transitions. [2019-08-05 10:12:56,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 10:12:56,343 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:56,343 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, 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:12:56,343 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:56,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:56,344 INFO L82 PathProgramCache]: Analyzing trace with hash 307160173, now seen corresponding path program 1 times [2019-08-05 10:12:56,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:56,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:12:56,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:56,609 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-08-05 10:12:56,759 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-08-05 10:12:56,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:56,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:12:56,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:12:56,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:12:56,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:12:56,761 INFO L87 Difference]: Start difference. First operand 8015 states and 10886 transitions. Second operand 5 states. [2019-08-05 10:12:57,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:57,147 INFO L93 Difference]: Finished difference Result 8014 states and 10782 transitions. [2019-08-05 10:12:57,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:12:57,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-08-05 10:12:57,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:57,165 INFO L225 Difference]: With dead ends: 8014 [2019-08-05 10:12:57,165 INFO L226 Difference]: Without dead ends: 8014 [2019-08-05 10:12:57,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:12:57,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8014 states. [2019-08-05 10:12:57,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8014 to 7648. [2019-08-05 10:12:57,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7648 states. [2019-08-05 10:12:57,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7648 states to 7648 states and 10334 transitions. [2019-08-05 10:12:57,271 INFO L78 Accepts]: Start accepts. Automaton has 7648 states and 10334 transitions. Word has length 109 [2019-08-05 10:12:57,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:57,272 INFO L475 AbstractCegarLoop]: Abstraction has 7648 states and 10334 transitions. [2019-08-05 10:12:57,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:12:57,272 INFO L276 IsEmpty]: Start isEmpty. Operand 7648 states and 10334 transitions. [2019-08-05 10:12:57,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-08-05 10:12:57,274 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:57,274 INFO L399 BasicCegarLoop]: trace histogram [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, 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:12:57,274 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:57,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:57,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1463990326, now seen corresponding path program 1 times [2019-08-05 10:12:57,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:57,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:57,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:57,371 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-08-05 10:12:57,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:57,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:12:57,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:57,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:57,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:57,373 INFO L87 Difference]: Start difference. First operand 7648 states and 10334 transitions. Second operand 3 states. [2019-08-05 10:12:57,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:57,604 INFO L93 Difference]: Finished difference Result 8542 states and 11459 transitions. [2019-08-05 10:12:57,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:57,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-08-05 10:12:57,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:57,619 INFO L225 Difference]: With dead ends: 8542 [2019-08-05 10:12:57,620 INFO L226 Difference]: Without dead ends: 8542 [2019-08-05 10:12:57,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 125 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:12:57,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8542 states. [2019-08-05 10:12:57,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8542 to 8541. [2019-08-05 10:12:57,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8541 states. [2019-08-05 10:12:57,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8541 states to 8541 states and 11459 transitions. [2019-08-05 10:12:57,773 INFO L78 Accepts]: Start accepts. Automaton has 8541 states and 11459 transitions. Word has length 128 [2019-08-05 10:12:57,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:57,773 INFO L475 AbstractCegarLoop]: Abstraction has 8541 states and 11459 transitions. [2019-08-05 10:12:57,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:57,774 INFO L276 IsEmpty]: Start isEmpty. Operand 8541 states and 11459 transitions. [2019-08-05 10:12:57,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-08-05 10:12:57,776 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:57,776 INFO L399 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:57,776 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:57,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:57,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1342186509, now seen corresponding path program 1 times [2019-08-05 10:12:57,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:57,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:57,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:57,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:57,878 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-08-05 10:12:57,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:57,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:12:57,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:57,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:57,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:57,880 INFO L87 Difference]: Start difference. First operand 8541 states and 11459 transitions. Second operand 3 states. [2019-08-05 10:12:58,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:58,034 INFO L93 Difference]: Finished difference Result 9369 states and 12518 transitions. [2019-08-05 10:12:58,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:58,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-08-05 10:12:58,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:58,052 INFO L225 Difference]: With dead ends: 9369 [2019-08-05 10:12:58,052 INFO L226 Difference]: Without dead ends: 9369 [2019-08-05 10:12:58,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 127 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:12:58,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9369 states. [2019-08-05 10:12:58,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9369 to 9007. [2019-08-05 10:12:58,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9007 states. [2019-08-05 10:12:58,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9007 states to 9007 states and 12051 transitions. [2019-08-05 10:12:58,161 INFO L78 Accepts]: Start accepts. Automaton has 9007 states and 12051 transitions. Word has length 130 [2019-08-05 10:12:58,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:58,161 INFO L475 AbstractCegarLoop]: Abstraction has 9007 states and 12051 transitions. [2019-08-05 10:12:58,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:58,162 INFO L276 IsEmpty]: Start isEmpty. Operand 9007 states and 12051 transitions. [2019-08-05 10:12:58,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-08-05 10:12:58,164 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:58,164 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, 3, 3, 3, 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] [2019-08-05 10:12:58,164 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:58,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:58,165 INFO L82 PathProgramCache]: Analyzing trace with hash -813703229, now seen corresponding path program 1 times [2019-08-05 10:12:58,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:58,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:12:58,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:58,508 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-08-05 10:12:58,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:58,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:12:58,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:12:58,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:12:58,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:12:58,510 INFO L87 Difference]: Start difference. First operand 9007 states and 12051 transitions. Second operand 6 states. [2019-08-05 10:12:58,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:58,892 INFO L93 Difference]: Finished difference Result 24734 states and 33089 transitions. [2019-08-05 10:12:58,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:12:58,892 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2019-08-05 10:12:58,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:58,907 INFO L225 Difference]: With dead ends: 24734 [2019-08-05 10:12:58,908 INFO L226 Difference]: Without dead ends: 8789 [2019-08-05 10:12:58,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:12:58,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8789 states. [2019-08-05 10:12:59,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8789 to 8770. [2019-08-05 10:12:59,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8770 states. [2019-08-05 10:12:59,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8770 states to 8770 states and 11724 transitions. [2019-08-05 10:12:59,392 INFO L78 Accepts]: Start accepts. Automaton has 8770 states and 11724 transitions. Word has length 133 [2019-08-05 10:12:59,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:59,393 INFO L475 AbstractCegarLoop]: Abstraction has 8770 states and 11724 transitions. [2019-08-05 10:12:59,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:12:59,393 INFO L276 IsEmpty]: Start isEmpty. Operand 8770 states and 11724 transitions. [2019-08-05 10:12:59,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-08-05 10:12:59,394 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:59,394 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:59,395 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:59,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:59,395 INFO L82 PathProgramCache]: Analyzing trace with hash 2133305053, now seen corresponding path program 1 times [2019-08-05 10:12:59,403 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:59,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:12:59,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:59,551 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:59,551 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:59,552 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:59,552 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:59,553 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:59,554 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:59,554 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:59,555 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:59,555 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:59,556 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:59,847 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:12:59,850 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:59,850 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:59,851 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:59,851 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:59,852 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:59,852 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:59,853 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:59,854 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:59,854 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:59,855 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:59,856 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:00,228 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 10 [2019-08-05 10:13:00,328 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:00,329 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:00,329 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:00,330 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:00,330 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:00,331 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:00,331 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:00,332 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:00,332 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:00,333 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:00,334 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:00,989 WARN L188 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 68 [2019-08-05 10:13:01,371 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2019-08-05 10:13:01,795 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-08-05 10:13:02,167 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-08-05 10:13:02,521 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-08-05 10:13:02,795 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-08-05 10:13:03,036 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-08-05 10:13:03,256 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-08-05 10:13:03,454 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-08-05 10:13:03,568 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:03,569 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:03,569 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:03,570 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:03,714 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 19 proven. 133 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-08-05 10:13:03,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:03,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:13:03,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:13:03,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:13:03,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:13:03,716 INFO L87 Difference]: Start difference. First operand 8770 states and 11724 transitions. Second operand 19 states. [2019-08-05 10:13:03,999 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-08-05 10:13:04,385 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 18 [2019-08-05 10:13:04,735 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-08-05 10:13:05,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:05,599 INFO L93 Difference]: Finished difference Result 8990 states and 11965 transitions. [2019-08-05 10:13:05,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:13:05,600 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 135 [2019-08-05 10:13:05,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:05,607 INFO L225 Difference]: With dead ends: 8990 [2019-08-05 10:13:05,607 INFO L226 Difference]: Without dead ends: 8990 [2019-08-05 10:13:05,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:13:05,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8990 states. [2019-08-05 10:13:05,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8990 to 8851. [2019-08-05 10:13:05,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8851 states. [2019-08-05 10:13:05,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8851 states to 8851 states and 11821 transitions. [2019-08-05 10:13:05,696 INFO L78 Accepts]: Start accepts. Automaton has 8851 states and 11821 transitions. Word has length 135 [2019-08-05 10:13:05,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:05,696 INFO L475 AbstractCegarLoop]: Abstraction has 8851 states and 11821 transitions. [2019-08-05 10:13:05,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:13:05,697 INFO L276 IsEmpty]: Start isEmpty. Operand 8851 states and 11821 transitions. [2019-08-05 10:13:05,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-08-05 10:13:05,699 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:05,699 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, 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, 1, 1, 1, 1, 1] [2019-08-05 10:13:05,699 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:05,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:05,700 INFO L82 PathProgramCache]: Analyzing trace with hash -535857345, now seen corresponding path program 1 times [2019-08-05 10:13:05,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:05,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:05,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:13:05,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:05,815 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-08-05 10:13:05,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:05,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:13:05,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:13:05,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:13:05,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:13:05,817 INFO L87 Difference]: Start difference. First operand 8851 states and 11821 transitions. Second operand 3 states. [2019-08-05 10:13:06,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:06,323 INFO L93 Difference]: Finished difference Result 11609 states and 15408 transitions. [2019-08-05 10:13:06,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:13:06,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-08-05 10:13:06,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:06,335 INFO L225 Difference]: With dead ends: 11609 [2019-08-05 10:13:06,336 INFO L226 Difference]: Without dead ends: 11513 [2019-08-05 10:13:06,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 154 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:13:06,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11513 states. [2019-08-05 10:13:06,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11513 to 11512. [2019-08-05 10:13:06,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11512 states. [2019-08-05 10:13:06,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11512 states to 11512 states and 15244 transitions. [2019-08-05 10:13:06,486 INFO L78 Accepts]: Start accepts. Automaton has 11512 states and 15244 transitions. Word has length 157 [2019-08-05 10:13:06,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:06,487 INFO L475 AbstractCegarLoop]: Abstraction has 11512 states and 15244 transitions. [2019-08-05 10:13:06,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:13:06,487 INFO L276 IsEmpty]: Start isEmpty. Operand 11512 states and 15244 transitions. [2019-08-05 10:13:06,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-08-05 10:13:06,489 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:06,490 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1] [2019-08-05 10:13:06,490 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:06,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:06,490 INFO L82 PathProgramCache]: Analyzing trace with hash -696156623, now seen corresponding path program 1 times [2019-08-05 10:13:06,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:06,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:13:06,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:06,695 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:13:06,699 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,700 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,700 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,701 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,702 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,703 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,703 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,704 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,704 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,705 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,876 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,877 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,877 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,877 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,878 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,878 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,879 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,879 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,880 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,881 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,881 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,155 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,156 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,156 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,157 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,157 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,157 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,158 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,158 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,159 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,159 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,159 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,816 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 68 [2019-08-05 10:13:08,185 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2019-08-05 10:13:08,536 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-08-05 10:13:08,856 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-08-05 10:13:09,187 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-08-05 10:13:09,465 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-08-05 10:13:09,706 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-08-05 10:13:09,923 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-08-05 10:13:10,118 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-08-05 10:13:10,213 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:10,213 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:10,214 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:10,215 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:10,607 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 10 [2019-08-05 10:13:10,631 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:10,634 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:10,635 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:10,635 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:10,636 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:10,636 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:10,637 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:10,637 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:10,638 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:10,639 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:10,639 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:10,868 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 18 [2019-08-05 10:13:11,145 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 19 proven. 225 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-08-05 10:13:11,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:11,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:13:11,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:13:11,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:13:11,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:13:11,147 INFO L87 Difference]: Start difference. First operand 11512 states and 15244 transitions. Second operand 24 states. [2019-08-05 10:13:11,396 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-08-05 10:13:12,060 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-08-05 10:13:13,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:13,611 INFO L93 Difference]: Finished difference Result 15083 states and 20240 transitions. [2019-08-05 10:13:13,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:13:13,614 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 160 [2019-08-05 10:13:13,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:13,615 INFO L225 Difference]: With dead ends: 15083 [2019-08-05 10:13:13,615 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:13:13,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=336, Invalid=924, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:13:13,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:13:13,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:13:13,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:13:13,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:13:13,617 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 160 [2019-08-05 10:13:13,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:13,617 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:13:13,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:13:13,618 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:13:13,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:13:13,623 INFO L202 PluginConnector]: Adding new model u2b08_batman_intermittent_power_1slot_SAFE.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:13:13 BoogieIcfgContainer [2019-08-05 10:13:13,623 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:13:13,625 INFO L168 Benchmark]: Toolchain (without parser) took 38688.82 ms. Allocated memory was 135.3 MB in the beginning and 678.4 MB in the end (delta: 543.2 MB). Free memory was 109.8 MB in the beginning and 164.2 MB in the end (delta: -54.4 MB). Peak memory consumption was 488.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:13:13,626 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 135.3 MB. Free memory was 114.0 MB in the beginning and 113.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:13:13,626 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.40 ms. Allocated memory is still 135.3 MB. Free memory was 109.8 MB in the beginning and 107.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:13:13,627 INFO L168 Benchmark]: Boogie Preprocessor took 94.87 ms. Allocated memory is still 135.3 MB. Free memory was 107.6 MB in the beginning and 104.4 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:13:13,628 INFO L168 Benchmark]: RCFGBuilder took 3994.53 ms. Allocated memory was 135.3 MB in the beginning and 198.2 MB in the end (delta: 62.9 MB). Free memory was 104.4 MB in the beginning and 174.1 MB in the end (delta: -69.7 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:13:13,629 INFO L168 Benchmark]: TraceAbstraction took 34540.82 ms. Allocated memory was 198.2 MB in the beginning and 678.4 MB in the end (delta: 480.2 MB). Free memory was 174.1 MB in the beginning and 164.2 MB in the end (delta: 9.9 MB). Peak memory consumption was 490.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:13:13,632 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.20 ms. Allocated memory is still 135.3 MB. Free memory was 114.0 MB in the beginning and 113.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 50.40 ms. Allocated memory is still 135.3 MB. Free memory was 109.8 MB in the beginning and 107.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 94.87 ms. Allocated memory is still 135.3 MB. Free memory was 107.6 MB in the beginning and 104.4 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3994.53 ms. Allocated memory was 135.3 MB in the beginning and 198.2 MB in the end (delta: 62.9 MB). Free memory was 104.4 MB in the beginning and 174.1 MB in the end (delta: -69.7 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 34540.82 ms. Allocated memory was 198.2 MB in the beginning and 678.4 MB in the end (delta: 480.2 MB). Free memory was 174.1 MB in the beginning and 164.2 MB in the end (delta: 9.9 MB). Peak memory consumption was 490.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 413]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 632]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 68 locations, 2 error locations. SAFE Result, 34.4s OverallTime, 22 OverallIterations, 5 TraceHistogramMax, 12.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3351 SDtfs, 4586 SDslu, 5106 SDs, 0 SdLazy, 3225 SolverSat, 661 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1835 GetRequests, 1699 SyntacticMatches, 17 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 16.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11512occurred in iteration=21, 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: 1.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 2368 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 19.3s InterpolantComputationTime, 1826 NumberOfCodeBlocks, 1826 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1804 ConstructedInterpolants, 0 QuantifiedInterpolants, 1606701 SizeOfPredicates, 64 NumberOfNonLiveVariables, 5170 ConjunctsInSsa, 179 ConjunctsInUnsatCore, 22 InterpolantComputations, 13 PerfectInterpolantSequences, 1111/1768 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...