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/gascake/GasCakeWithJohoFractions01FixedInput.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:16:37,694 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:16:37,698 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:16:37,713 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:16:37,713 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:16:37,715 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:16:37,717 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:16:37,720 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:16:37,723 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:16:37,725 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:16:37,726 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:16:37,726 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:16:37,727 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:16:37,728 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:16:37,731 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:16:37,732 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:16:37,733 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:16:37,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:16:37,743 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:16:37,746 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:16:37,752 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:16:37,754 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:16:37,755 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:16:37,758 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:16:37,760 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:16:37,760 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:16:37,760 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:16:37,761 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:16:37,763 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:16:37,766 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:16:37,766 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:16:37,767 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:16:37,768 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:16:37,769 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:16:37,771 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:16:37,771 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:16:37,772 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:16:37,772 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:16:37,774 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:16:37,775 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:16:37,776 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:16:37,829 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:16:37,846 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:16:37,850 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:16:37,852 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:16:37,852 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:16:37,853 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/gascake/GasCakeWithJohoFractions01FixedInput.bpl [2019-08-05 11:16:37,853 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/gascake/GasCakeWithJohoFractions01FixedInput.bpl' [2019-08-05 11:16:37,891 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:16:37,893 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:16:37,893 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:16:37,894 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:16:37,894 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:16:37,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "GasCakeWithJohoFractions01FixedInput.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:37" (1/1) ... [2019-08-05 11:16:37,921 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "GasCakeWithJohoFractions01FixedInput.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:37" (1/1) ... [2019-08-05 11:16:37,928 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:16:37,928 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:16:37,928 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:16:37,930 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:16:37,931 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:16:37,931 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:16:37,932 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:16:37,942 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GasCakeWithJohoFractions01FixedInput.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:37" (1/1) ... [2019-08-05 11:16:37,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GasCakeWithJohoFractions01FixedInput.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:37" (1/1) ... [2019-08-05 11:16:37,943 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GasCakeWithJohoFractions01FixedInput.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:37" (1/1) ... [2019-08-05 11:16:37,944 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GasCakeWithJohoFractions01FixedInput.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:37" (1/1) ... [2019-08-05 11:16:37,946 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GasCakeWithJohoFractions01FixedInput.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:37" (1/1) ... [2019-08-05 11:16:37,950 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GasCakeWithJohoFractions01FixedInput.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:37" (1/1) ... [2019-08-05 11:16:37,951 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GasCakeWithJohoFractions01FixedInput.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:37" (1/1) ... [2019-08-05 11:16:37,952 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:16:37,953 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:16:37,953 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:16:37,953 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:16:37,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GasCakeWithJohoFractions01FixedInput.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:37" (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 11:16:38,021 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:16:38,021 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:16:38,022 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:16:38,294 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:16:38,294 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 11:16:38,295 INFO L202 PluginConnector]: Adding new model GasCakeWithJohoFractions01FixedInput.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:16:38 BoogieIcfgContainer [2019-08-05 11:16:38,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:16:38,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:16:38,297 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:16:38,301 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:16:38,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GasCakeWithJohoFractions01FixedInput.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:37" (1/2) ... [2019-08-05 11:16:38,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a8cd62 and model type GasCakeWithJohoFractions01FixedInput.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:16:38, skipping insertion in model container [2019-08-05 11:16:38,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GasCakeWithJohoFractions01FixedInput.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:16:38" (2/2) ... [2019-08-05 11:16:38,305 INFO L109 eAbstractionObserver]: Analyzing ICFG GasCakeWithJohoFractions01FixedInput.bpl [2019-08-05 11:16:38,312 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:16:38,319 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 11:16:38,336 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 11:16:38,362 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:16:38,362 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:16:38,363 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:16:38,363 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:16:38,363 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:16:38,364 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:16:38,364 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:16:38,364 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:16:38,364 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:16:38,382 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-08-05 11:16:38,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:16:38,398 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:38,399 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:16:38,401 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:38,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:38,407 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2019-08-05 11:16:38,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:38,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:16:38,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:38,629 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 11:16:38,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:16:38,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:16:38,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:16:38,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:16:38,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:16:38,681 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 4 states. [2019-08-05 11:16:38,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:38,802 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:16:38,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:16:38,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-08-05 11:16:38,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:38,814 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:16:38,814 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:16:38,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:16:38,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:16:38,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 11:16:38,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:16:38,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 11:16:38,851 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 3 [2019-08-05 11:16:38,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:38,851 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 11:16:38,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:16:38,852 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 11:16:38,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:16:38,852 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:38,852 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:16:38,853 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:38,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:38,853 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2019-08-05 11:16:38,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:38,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:16:38,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:38,925 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 11:16:38,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:16:38,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:16:38,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:16:38,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:16:38,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:16:38,929 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 4 states. [2019-08-05 11:16:38,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:38,994 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 11:16:38,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:16:38,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 11:16:38,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:38,995 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:16:38,995 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:16:38,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:16:38,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:16:38,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-08-05 11:16:38,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:16:38,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 11:16:38,999 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 4 [2019-08-05 11:16:39,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:39,000 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 11:16:39,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:16:39,000 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 11:16:39,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:16:39,001 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:39,001 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 11:16:39,001 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:39,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:39,002 INFO L82 PathProgramCache]: Analyzing trace with hash 891384328, now seen corresponding path program 1 times [2019-08-05 11:16:39,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:39,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:16:39,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:39,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:39,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:39,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:16:39,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:16:39,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:16:39,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:16:39,142 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2019-08-05 11:16:39,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:39,332 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-08-05 11:16:39,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:16:39,336 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 11:16:39,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:39,336 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:16:39,336 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:16:39,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:16:39,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:16:39,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-08-05 11:16:39,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:16:39,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 11:16:39,340 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 6 [2019-08-05 11:16:39,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:39,340 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 11:16:39,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:16:39,341 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 11:16:39,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:16:39,341 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:39,341 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2019-08-05 11:16:39,342 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:39,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:39,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1863110430, now seen corresponding path program 1 times [2019-08-05 11:16:39,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:39,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:16:39,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:39,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:39,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:39,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:16:39,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:16:39,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:16:39,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:16:39,505 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 5 states. [2019-08-05 11:16:39,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:39,561 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 11:16:39,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:16:39,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-08-05 11:16:39,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:39,563 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:16:39,563 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:16:39,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:16:39,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:16:39,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-08-05 11:16:39,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:16:39,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 11:16:39,567 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 7 [2019-08-05 11:16:39,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:39,567 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 11:16:39,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:16:39,567 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 11:16:39,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:16:39,568 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:39,568 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1] [2019-08-05 11:16:39,568 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:39,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:39,569 INFO L82 PathProgramCache]: Analyzing trace with hash -552238112, now seen corresponding path program 2 times [2019-08-05 11:16:39,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:39,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:16:39,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:39,959 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:39,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:39,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:16:39,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:16:39,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:16:39,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:16:39,961 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 8 states. [2019-08-05 11:16:40,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:40,200 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-08-05 11:16:40,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:16:40,205 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-08-05 11:16:40,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:40,205 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:16:40,206 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:16:40,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:16:40,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:16:40,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-08-05 11:16:40,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:16:40,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 11:16:40,209 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 9 [2019-08-05 11:16:40,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:40,210 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 11:16:40,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:16:40,210 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 11:16:40,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:16:40,211 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:40,211 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1] [2019-08-05 11:16:40,211 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:40,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:40,212 INFO L82 PathProgramCache]: Analyzing trace with hash 60487750, now seen corresponding path program 2 times [2019-08-05 11:16:40,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:40,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:16:40,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:40,363 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:40,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:40,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:16:40,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:16:40,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:16:40,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:16:40,365 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 6 states. [2019-08-05 11:16:40,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:40,428 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 11:16:40,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:16:40,429 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-08-05 11:16:40,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:40,430 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:16:40,430 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:16:40,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:16:40,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:16:40,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-08-05 11:16:40,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:16:40,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 11:16:40,433 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 10 [2019-08-05 11:16:40,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:40,433 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 11:16:40,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:16:40,434 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 11:16:40,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:16:40,434 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:40,434 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1] [2019-08-05 11:16:40,435 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:40,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:40,435 INFO L82 PathProgramCache]: Analyzing trace with hash -2000813304, now seen corresponding path program 3 times [2019-08-05 11:16:40,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:40,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:40,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:16:40,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:40,890 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:40,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:40,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:16:40,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:16:40,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:16:40,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:16:40,894 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 10 states. [2019-08-05 11:16:41,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:41,163 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-08-05 11:16:41,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:16:41,164 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-08-05 11:16:41,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:41,165 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:16:41,165 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:16:41,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:16:41,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:16:41,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-08-05 11:16:41,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:16:41,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 11:16:41,169 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2019-08-05 11:16:41,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:41,170 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 11:16:41,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:16:41,170 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 11:16:41,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:16:41,170 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:41,171 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1] [2019-08-05 11:16:41,171 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:41,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:41,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1895670242, now seen corresponding path program 3 times [2019-08-05 11:16:41,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:41,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:16:41,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:41,362 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:41,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:41,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:16:41,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:16:41,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:16:41,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:16:41,364 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 7 states. [2019-08-05 11:16:41,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:41,416 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 11:16:41,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:16:41,417 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-08-05 11:16:41,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:41,418 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:16:41,418 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:16:41,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:16:41,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:16:41,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-08-05 11:16:41,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:16:41,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 11:16:41,423 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 13 [2019-08-05 11:16:41,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:41,424 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 11:16:41,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:16:41,424 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 11:16:41,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:16:41,424 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:41,425 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1] [2019-08-05 11:16:41,425 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:41,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:41,425 INFO L82 PathProgramCache]: Analyzing trace with hash -672967968, now seen corresponding path program 4 times [2019-08-05 11:16:41,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:41,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:16:41,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:41,694 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:41,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:41,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:16:41,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:16:41,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:16:41,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:16:41,696 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 12 states. [2019-08-05 11:16:42,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:42,039 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-08-05 11:16:42,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:16:42,040 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-08-05 11:16:42,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:42,041 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:16:42,042 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:16:42,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:16:42,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:16:42,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-08-05 11:16:42,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:16:42,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 11:16:42,046 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 15 [2019-08-05 11:16:42,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:42,046 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 11:16:42,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:16:42,046 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 11:16:42,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:16:42,047 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:42,047 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1] [2019-08-05 11:16:42,047 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:42,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:42,048 INFO L82 PathProgramCache]: Analyzing trace with hash 612829510, now seen corresponding path program 4 times [2019-08-05 11:16:42,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:42,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:42,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:16:42,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:42,219 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:42,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:42,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:16:42,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:16:42,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:16:42,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:16:42,221 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 8 states. [2019-08-05 11:16:42,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:42,277 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 11:16:42,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:16:42,278 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-08-05 11:16:42,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:42,279 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:16:42,279 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:16:42,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:16:42,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:16:42,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-08-05 11:16:42,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:16:42,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 11:16:42,283 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2019-08-05 11:16:42,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:42,284 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 11:16:42,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:16:42,284 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 11:16:42,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:16:42,284 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:42,285 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1] [2019-08-05 11:16:42,285 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:42,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:42,285 INFO L82 PathProgramCache]: Analyzing trace with hash 518640648, now seen corresponding path program 5 times [2019-08-05 11:16:42,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:42,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:42,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:16:42,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:42,561 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:42,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:42,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:16:42,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:16:42,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:16:42,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:16:42,563 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 14 states. [2019-08-05 11:16:42,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:42,974 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-08-05 11:16:42,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:16:42,974 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2019-08-05 11:16:42,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:42,975 INFO L225 Difference]: With dead ends: 25 [2019-08-05 11:16:42,976 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 11:16:42,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:16:42,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 11:16:42,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-08-05 11:16:42,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 11:16:42,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 11:16:42,980 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 18 [2019-08-05 11:16:42,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:42,981 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 11:16:42,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:16:42,981 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 11:16:42,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:16:42,981 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:42,982 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1] [2019-08-05 11:16:42,982 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:42,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:42,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1102009058, now seen corresponding path program 5 times [2019-08-05 11:16:42,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:43,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:16:43,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:43,235 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:43,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:43,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:16:43,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:16:43,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:16:43,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:16:43,237 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 9 states. [2019-08-05 11:16:43,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:43,307 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 11:16:43,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:16:43,308 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-08-05 11:16:43,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:43,309 INFO L225 Difference]: With dead ends: 25 [2019-08-05 11:16:43,309 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 11:16:43,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:16:43,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 11:16:43,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-08-05 11:16:43,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 11:16:43,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 11:16:43,313 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 19 [2019-08-05 11:16:43,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:43,314 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 11:16:43,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:16:43,314 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 11:16:43,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:16:43,315 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:43,315 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1] [2019-08-05 11:16:43,315 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:43,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:43,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1826218464, now seen corresponding path program 6 times [2019-08-05 11:16:43,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:43,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:16:43,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:43,683 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:43,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:43,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:16:43,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:16:43,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:16:43,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:16:43,685 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 16 states. [2019-08-05 11:16:43,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:43,979 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-08-05 11:16:43,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:16:43,981 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-08-05 11:16:43,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:43,982 INFO L225 Difference]: With dead ends: 28 [2019-08-05 11:16:43,982 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 11:16:43,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=204, Invalid=498, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:16:43,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 11:16:43,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-08-05 11:16:43,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 11:16:43,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 11:16:43,986 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 21 [2019-08-05 11:16:43,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:43,987 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 11:16:43,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:16:43,987 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 11:16:43,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:16:43,987 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:43,987 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1] [2019-08-05 11:16:43,988 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:43,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:43,988 INFO L82 PathProgramCache]: Analyzing trace with hash 778197574, now seen corresponding path program 6 times [2019-08-05 11:16:43,989 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:44,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:16:44,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:44,211 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:44,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:44,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:16:44,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:16:44,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:16:44,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:16:44,213 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 10 states. [2019-08-05 11:16:44,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:44,623 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 11:16:44,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:16:44,623 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-08-05 11:16:44,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:44,624 INFO L225 Difference]: With dead ends: 28 [2019-08-05 11:16:44,624 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 11:16:44,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:16:44,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 11:16:44,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-08-05 11:16:44,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 11:16:44,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 11:16:44,628 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 22 [2019-08-05 11:16:44,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:44,628 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 11:16:44,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:16:44,628 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 11:16:44,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 11:16:44,629 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:44,629 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1] [2019-08-05 11:16:44,629 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:44,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:44,630 INFO L82 PathProgramCache]: Analyzing trace with hash 523560200, now seen corresponding path program 7 times [2019-08-05 11:16:44,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:44,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:44,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:16:44,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:45,417 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:45,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:45,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:16:45,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:16:45,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:16:45,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:16:45,420 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 18 states. [2019-08-05 11:16:45,969 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2019-08-05 11:16:46,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:46,275 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-08-05 11:16:46,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:16:46,275 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-08-05 11:16:46,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:46,276 INFO L225 Difference]: With dead ends: 31 [2019-08-05 11:16:46,276 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 11:16:46,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=269, Invalid=661, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:16:46,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 11:16:46,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-08-05 11:16:46,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 11:16:46,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 11:16:46,281 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 24 [2019-08-05 11:16:46,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:46,281 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 11:16:46,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:16:46,281 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 11:16:46,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 11:16:46,282 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:46,282 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1] [2019-08-05 11:16:46,283 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:46,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:46,283 INFO L82 PathProgramCache]: Analyzing trace with hash -949502946, now seen corresponding path program 7 times [2019-08-05 11:16:46,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:46,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:16:46,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:46,590 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:46,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:46,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:16:46,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:16:46,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:16:46,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:16:46,592 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 11 states. [2019-08-05 11:16:46,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:46,675 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 11:16:46,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:16:46,675 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-08-05 11:16:46,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:46,676 INFO L225 Difference]: With dead ends: 31 [2019-08-05 11:16:46,676 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 11:16:46,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:16:46,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 11:16:46,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-08-05 11:16:46,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 11:16:46,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 11:16:46,681 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 25 [2019-08-05 11:16:46,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:46,681 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 11:16:46,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:16:46,681 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 11:16:46,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 11:16:46,682 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:46,682 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1] [2019-08-05 11:16:46,683 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:46,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:46,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1939263264, now seen corresponding path program 8 times [2019-08-05 11:16:46,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:46,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 11:16:46,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:47,134 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:47,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:47,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:16:47,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:16:47,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:16:47,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:16:47,136 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 20 states. [2019-08-05 11:16:47,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:47,662 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2019-08-05 11:16:47,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:16:47,663 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2019-08-05 11:16:47,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:47,663 INFO L225 Difference]: With dead ends: 34 [2019-08-05 11:16:47,663 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 11:16:47,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=343, Invalid=847, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:16:47,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 11:16:47,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-08-05 11:16:47,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 11:16:47,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 11:16:47,667 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 27 [2019-08-05 11:16:47,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:47,667 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 11:16:47,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:16:47,667 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 11:16:47,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 11:16:47,668 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:47,668 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1] [2019-08-05 11:16:47,668 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:47,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:47,669 INFO L82 PathProgramCache]: Analyzing trace with hash 12380998, now seen corresponding path program 8 times [2019-08-05 11:16:47,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:47,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:47,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 11:16:47,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:47,977 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:47,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:47,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:16:47,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:16:47,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:16:47,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:16:47,979 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 12 states. [2019-08-05 11:16:48,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:48,047 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 11:16:48,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:16:48,048 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-08-05 11:16:48,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:48,049 INFO L225 Difference]: With dead ends: 34 [2019-08-05 11:16:48,049 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 11:16:48,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:16:48,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 11:16:48,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-08-05 11:16:48,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 11:16:48,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 11:16:48,054 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 28 [2019-08-05 11:16:48,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:48,054 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 11:16:48,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:16:48,055 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 11:16:48,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 11:16:48,055 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:48,056 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1] [2019-08-05 11:16:48,056 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:48,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:48,056 INFO L82 PathProgramCache]: Analyzing trace with hash -986761720, now seen corresponding path program 9 times [2019-08-05 11:16:48,057 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:48,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:16:48,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:48,593 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:48,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:48,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:16:48,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:16:48,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:16:48,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=312, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:16:48,595 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 22 states. [2019-08-05 11:16:49,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:49,085 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2019-08-05 11:16:49,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:16:49,086 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-08-05 11:16:49,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:49,087 INFO L225 Difference]: With dead ends: 37 [2019-08-05 11:16:49,087 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 11:16:49,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=426, Invalid=1056, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:16:49,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 11:16:49,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-08-05 11:16:49,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 11:16:49,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 11:16:49,092 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 30 [2019-08-05 11:16:49,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:49,092 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 11:16:49,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:16:49,093 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 11:16:49,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 11:16:49,093 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:49,093 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1] [2019-08-05 11:16:49,094 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:49,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:49,094 INFO L82 PathProgramCache]: Analyzing trace with hash -524842210, now seen corresponding path program 9 times [2019-08-05 11:16:49,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:49,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:49,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:16:49,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:49,347 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:49,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:49,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:16:49,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:16:49,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:16:49,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:16:49,349 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 13 states. [2019-08-05 11:16:49,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:49,457 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 11:16:49,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:16:49,458 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2019-08-05 11:16:49,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:49,459 INFO L225 Difference]: With dead ends: 37 [2019-08-05 11:16:49,459 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 11:16:49,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:16:49,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 11:16:49,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-08-05 11:16:49,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 11:16:49,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 11:16:49,462 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 31 [2019-08-05 11:16:49,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:49,463 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 11:16:49,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:16:49,463 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 11:16:49,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:16:49,464 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:49,464 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1] [2019-08-05 11:16:49,464 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:49,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:49,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1862189088, now seen corresponding path program 10 times [2019-08-05 11:16:49,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:49,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:16:49,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:50,033 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:50,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:50,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:16:50,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:16:50,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:16:50,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=371, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:16:50,034 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 24 states. [2019-08-05 11:16:50,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:50,530 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2019-08-05 11:16:50,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:16:50,531 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 33 [2019-08-05 11:16:50,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:50,532 INFO L225 Difference]: With dead ends: 40 [2019-08-05 11:16:50,532 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 11:16:50,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=518, Invalid=1288, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:16:50,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 11:16:50,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-08-05 11:16:50,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 11:16:50,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 11:16:50,536 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 33 [2019-08-05 11:16:50,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:50,536 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 11:16:50,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:16:50,537 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 11:16:50,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 11:16:50,537 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:50,537 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 10, 1, 1] [2019-08-05 11:16:50,538 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:50,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:50,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1893286842, now seen corresponding path program 10 times [2019-08-05 11:16:50,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:50,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:16:50,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:50,852 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:50,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:50,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:16:50,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:16:50,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:16:50,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:16:50,854 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 14 states. [2019-08-05 11:16:50,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:50,964 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 11:16:50,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:16:50,964 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2019-08-05 11:16:50,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:50,965 INFO L225 Difference]: With dead ends: 40 [2019-08-05 11:16:50,965 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 11:16:50,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:16:50,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 11:16:50,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-08-05 11:16:50,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 11:16:50,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 11:16:50,969 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 34 [2019-08-05 11:16:50,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:50,969 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 11:16:50,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:16:50,969 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 11:16:50,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 11:16:50,970 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:50,970 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1] [2019-08-05 11:16:50,970 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:50,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:50,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1617479432, now seen corresponding path program 11 times [2019-08-05 11:16:50,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:50,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 11:16:50,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:51,565 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:51,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:51,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:16:51,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:16:51,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:16:51,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=435, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:16:51,567 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 26 states. [2019-08-05 11:16:52,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:52,270 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-08-05 11:16:52,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:16:52,270 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 36 [2019-08-05 11:16:52,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:52,271 INFO L225 Difference]: With dead ends: 43 [2019-08-05 11:16:52,271 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 11:16:52,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:16:52,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 11:16:52,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2019-08-05 11:16:52,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 11:16:52,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 11:16:52,276 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 36 [2019-08-05 11:16:52,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:52,276 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 11:16:52,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:16:52,276 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 11:16:52,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:16:52,277 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:52,277 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 1, 1] [2019-08-05 11:16:52,277 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:52,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:52,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1397745122, now seen corresponding path program 11 times [2019-08-05 11:16:52,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:52,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:52,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 11:16:52,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:52,636 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:52,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:52,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:16:52,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:16:52,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:16:52,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:16:52,637 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 15 states. [2019-08-05 11:16:52,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:52,807 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 11:16:52,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:16:52,807 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2019-08-05 11:16:52,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:52,808 INFO L225 Difference]: With dead ends: 43 [2019-08-05 11:16:52,808 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 11:16:52,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:16:52,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 11:16:52,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-08-05 11:16:52,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 11:16:52,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 11:16:52,811 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 37 [2019-08-05 11:16:52,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:52,812 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 11:16:52,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:16:52,812 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 11:16:52,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 11:16:52,813 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:52,813 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1] [2019-08-05 11:16:52,813 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:52,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:52,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1091702496, now seen corresponding path program 12 times [2019-08-05 11:16:52,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:52,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:16:52,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:53,269 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:53,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:53,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:16:53,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:16:53,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:16:53,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=504, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:16:53,271 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 28 states. [2019-08-05 11:16:53,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:53,976 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2019-08-05 11:16:53,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:16:53,976 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 39 [2019-08-05 11:16:53,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:53,977 INFO L225 Difference]: With dead ends: 46 [2019-08-05 11:16:53,977 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 11:16:53,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=729, Invalid=1821, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:16:53,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 11:16:53,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2019-08-05 11:16:53,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 11:16:53,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 11:16:53,980 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 39 [2019-08-05 11:16:53,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:53,981 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 11:16:53,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:16:53,981 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 11:16:53,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:16:53,981 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:53,981 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 1, 1] [2019-08-05 11:16:53,982 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:53,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:53,982 INFO L82 PathProgramCache]: Analyzing trace with hash -516960954, now seen corresponding path program 12 times [2019-08-05 11:16:53,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:54,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:16:54,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:54,289 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:54,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:54,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:16:54,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:16:54,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:16:54,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:16:54,290 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 16 states. [2019-08-05 11:16:54,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:54,432 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 11:16:54,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:16:54,433 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2019-08-05 11:16:54,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:54,434 INFO L225 Difference]: With dead ends: 46 [2019-08-05 11:16:54,434 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 11:16:54,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:16:54,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 11:16:54,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-08-05 11:16:54,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:16:54,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 11:16:54,438 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 40 [2019-08-05 11:16:54,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:54,439 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 11:16:54,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:16:54,439 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 11:16:54,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 11:16:54,439 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:54,440 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1] [2019-08-05 11:16:54,440 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:54,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:54,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1416730632, now seen corresponding path program 13 times [2019-08-05 11:16:54,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:54,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:16:54,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:55,850 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:55,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:55,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:16:55,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:16:55,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:16:55,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=578, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:16:55,853 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 30 states. [2019-08-05 11:16:56,781 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2019-08-05 11:16:57,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:57,398 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2019-08-05 11:16:57,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:16:57,399 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 42 [2019-08-05 11:16:57,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:57,400 INFO L225 Difference]: With dead ends: 49 [2019-08-05 11:16:57,400 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 11:16:57,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=848, Invalid=2122, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:16:57,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 11:16:57,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-08-05 11:16:57,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 11:16:57,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 11:16:57,404 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 42 [2019-08-05 11:16:57,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:57,405 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 11:16:57,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:16:57,405 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 11:16:57,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 11:16:57,405 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:57,405 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 13, 1, 1] [2019-08-05 11:16:57,406 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:57,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:57,406 INFO L82 PathProgramCache]: Analyzing trace with hash 968976670, now seen corresponding path program 13 times [2019-08-05 11:16:57,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:57,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:16:57,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:57,860 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:57,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:57,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:16:57,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:16:57,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:16:57,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:16:57,862 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 17 states. [2019-08-05 11:16:57,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:57,962 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 11:16:57,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:16:57,963 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 43 [2019-08-05 11:16:57,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:57,964 INFO L225 Difference]: With dead ends: 49 [2019-08-05 11:16:57,964 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 11:16:57,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:16:57,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 11:16:57,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-08-05 11:16:57,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 11:16:57,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 11:16:57,967 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 43 [2019-08-05 11:16:57,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:57,968 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 11:16:57,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:16:57,968 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 11:16:57,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:16:57,968 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:57,969 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1] [2019-08-05 11:16:57,969 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:57,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:57,969 INFO L82 PathProgramCache]: Analyzing trace with hash -821322272, now seen corresponding path program 14 times [2019-08-05 11:16:57,970 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:57,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 11:16:57,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:58,791 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:58,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:58,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:16:58,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:16:58,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:16:58,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=657, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:16:58,793 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 32 states. [2019-08-05 11:16:59,621 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2019-08-05 11:17:00,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:00,093 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2019-08-05 11:17:00,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:17:00,094 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 45 [2019-08-05 11:17:00,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:00,095 INFO L225 Difference]: With dead ends: 52 [2019-08-05 11:17:00,095 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 11:17:00,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=976, Invalid=2446, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:17:00,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 11:17:00,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2019-08-05 11:17:00,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 11:17:00,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 11:17:00,099 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 45 [2019-08-05 11:17:00,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:00,099 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 11:17:00,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:17:00,099 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 11:17:00,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 11:17:00,100 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:00,100 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 14, 1, 1] [2019-08-05 11:17:00,100 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:00,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:00,101 INFO L82 PathProgramCache]: Analyzing trace with hash 308813382, now seen corresponding path program 14 times [2019-08-05 11:17:00,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:00,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:00,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 11:17:00,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:00,727 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:00,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:00,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:17:00,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:17:00,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:17:00,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:17:00,728 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 18 states. [2019-08-05 11:17:00,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:00,868 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 11:17:00,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:17:00,869 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 46 [2019-08-05 11:17:00,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:00,869 INFO L225 Difference]: With dead ends: 52 [2019-08-05 11:17:00,870 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 11:17:00,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:17:00,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 11:17:00,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-08-05 11:17:00,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 11:17:00,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 11:17:00,873 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 46 [2019-08-05 11:17:00,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:00,873 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 11:17:00,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:17:00,873 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 11:17:00,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 11:17:00,874 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:00,874 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1] [2019-08-05 11:17:00,874 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:00,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:00,874 INFO L82 PathProgramCache]: Analyzing trace with hash 416917768, now seen corresponding path program 15 times [2019-08-05 11:17:00,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:00,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:00,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:17:00,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:02,046 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:02,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:02,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:17:02,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:17:02,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:17:02,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=741, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:17:02,048 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 34 states. [2019-08-05 11:17:02,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:02,978 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2019-08-05 11:17:02,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:17:02,979 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 48 [2019-08-05 11:17:02,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:02,979 INFO L225 Difference]: With dead ends: 55 [2019-08-05 11:17:02,980 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 11:17:02,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1113, Invalid=2793, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:17:02,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 11:17:02,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-08-05 11:17:02,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:17:02,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 11:17:02,984 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 48 [2019-08-05 11:17:02,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:02,984 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 11:17:02,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:17:02,984 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 11:17:02,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 11:17:02,985 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:02,985 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 15, 1, 1] [2019-08-05 11:17:02,985 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:02,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:02,986 INFO L82 PathProgramCache]: Analyzing trace with hash 39548958, now seen corresponding path program 15 times [2019-08-05 11:17:02,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:03,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:17:03,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:04,262 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:04,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:04,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:17:04,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:17:04,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:17:04,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:17:04,264 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 19 states. [2019-08-05 11:17:04,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:04,442 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 11:17:04,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:17:04,443 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2019-08-05 11:17:04,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:04,444 INFO L225 Difference]: With dead ends: 55 [2019-08-05 11:17:04,444 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 11:17:04,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:17:04,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 11:17:04,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-08-05 11:17:04,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 11:17:04,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 11:17:04,447 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 49 [2019-08-05 11:17:04,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:04,448 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 11:17:04,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:17:04,448 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 11:17:04,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 11:17:04,448 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:04,448 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 16, 1, 1] [2019-08-05 11:17:04,449 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:04,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:04,449 INFO L82 PathProgramCache]: Analyzing trace with hash -648155936, now seen corresponding path program 16 times [2019-08-05 11:17:04,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:04,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:17:04,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:05,097 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:05,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:05,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:17:05,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:17:05,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:17:05,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=430, Invalid=830, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:17:05,099 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 36 states. [2019-08-05 11:17:06,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:06,141 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2019-08-05 11:17:06,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:17:06,141 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 51 [2019-08-05 11:17:06,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:06,142 INFO L225 Difference]: With dead ends: 58 [2019-08-05 11:17:06,142 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 11:17:06,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1319 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1259, Invalid=3163, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:17:06,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 11:17:06,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2019-08-05 11:17:06,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 11:17:06,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 11:17:06,147 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 51 [2019-08-05 11:17:06,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:06,148 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 11:17:06,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:17:06,148 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 11:17:06,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 11:17:06,148 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:06,148 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 16, 1, 1] [2019-08-05 11:17:06,149 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:06,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:06,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1382002502, now seen corresponding path program 16 times [2019-08-05 11:17:06,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:06,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:17:06,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:06,852 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:06,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:06,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:17:06,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:17:06,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:17:06,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:17:06,854 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 20 states. [2019-08-05 11:17:06,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:06,967 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 11:17:06,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:17:06,967 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 52 [2019-08-05 11:17:06,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:06,968 INFO L225 Difference]: With dead ends: 58 [2019-08-05 11:17:06,968 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 11:17:06,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:17:06,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 11:17:06,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-08-05 11:17:06,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 11:17:06,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 11:17:06,972 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 52 [2019-08-05 11:17:06,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:06,972 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 11:17:06,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:17:06,972 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 11:17:06,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:17:06,973 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:06,973 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 17, 1, 1] [2019-08-05 11:17:06,973 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:06,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:06,974 INFO L82 PathProgramCache]: Analyzing trace with hash 959511048, now seen corresponding path program 17 times [2019-08-05 11:17:06,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:07,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:07,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 11:17:07,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:07,738 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:07,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:07,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:17:07,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:17:07,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:17:07,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=482, Invalid=924, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:17:07,739 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 38 states. [2019-08-05 11:17:08,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:08,959 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2019-08-05 11:17:08,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 11:17:08,959 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 54 [2019-08-05 11:17:08,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:08,960 INFO L225 Difference]: With dead ends: 61 [2019-08-05 11:17:08,960 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 11:17:08,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1495 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1414, Invalid=3556, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:17:08,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 11:17:08,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-08-05 11:17:08,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:17:08,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 11:17:08,965 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 54 [2019-08-05 11:17:08,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:08,965 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 11:17:08,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:17:08,966 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 11:17:08,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 11:17:08,966 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:08,966 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 1, 1] [2019-08-05 11:17:08,967 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:08,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:08,967 INFO L82 PathProgramCache]: Analyzing trace with hash -319928546, now seen corresponding path program 17 times [2019-08-05 11:17:08,968 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:09,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 11:17:09,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:09,809 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 0 proven. 459 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:09,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:09,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:17:09,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:17:09,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:17:09,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:17:09,811 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 21 states. [2019-08-05 11:17:09,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:09,925 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 11:17:09,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:17:09,925 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2019-08-05 11:17:09,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:09,926 INFO L225 Difference]: With dead ends: 61 [2019-08-05 11:17:09,926 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 11:17:09,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:17:09,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 11:17:09,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-08-05 11:17:09,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 11:17:09,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 11:17:09,930 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 55 [2019-08-05 11:17:09,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:09,930 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 11:17:09,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:17:09,930 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 11:17:09,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 11:17:09,930 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:09,931 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 18, 1, 1] [2019-08-05 11:17:09,931 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:09,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:09,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1786313696, now seen corresponding path program 18 times [2019-08-05 11:17:09,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:09,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 11:17:09,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:10,631 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:10,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:10,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 11:17:10,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 11:17:10,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 11:17:10,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=537, Invalid=1023, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:17:10,634 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 40 states. [2019-08-05 11:17:12,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:12,112 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2019-08-05 11:17:12,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 11:17:12,112 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 57 [2019-08-05 11:17:12,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:12,113 INFO L225 Difference]: With dead ends: 64 [2019-08-05 11:17:12,113 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 11:17:12,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1682 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1578, Invalid=3972, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:17:12,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 11:17:12,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-08-05 11:17:12,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 11:17:12,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 11:17:12,118 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 57 [2019-08-05 11:17:12,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:12,119 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 11:17:12,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 11:17:12,119 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 11:17:12,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 11:17:12,120 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:12,120 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 18, 1, 1] [2019-08-05 11:17:12,120 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:12,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:12,120 INFO L82 PathProgramCache]: Analyzing trace with hash -458850234, now seen corresponding path program 18 times [2019-08-05 11:17:12,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:12,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 11:17:12,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:13,157 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 0 proven. 513 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:13,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:13,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:17:13,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:17:13,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:17:13,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:17:13,159 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 22 states. [2019-08-05 11:17:13,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:13,270 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 11:17:13,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:17:13,270 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 58 [2019-08-05 11:17:13,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:13,271 INFO L225 Difference]: With dead ends: 64 [2019-08-05 11:17:13,271 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 11:17:13,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:17:13,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 11:17:13,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-08-05 11:17:13,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:17:13,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 11:17:13,274 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 58 [2019-08-05 11:17:13,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:13,275 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 11:17:13,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:17:13,275 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 11:17:13,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 11:17:13,275 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:13,275 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 19, 1, 1] [2019-08-05 11:17:13,276 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:13,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:13,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1426557704, now seen corresponding path program 19 times [2019-08-05 11:17:13,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:13,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 11:17:13,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:14,372 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:14,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:14,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 11:17:14,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 11:17:14,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 11:17:14,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=1127, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:17:14,374 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 42 states. [2019-08-05 11:17:15,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:15,749 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2019-08-05 11:17:15,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 11:17:15,750 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 60 [2019-08-05 11:17:15,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:15,751 INFO L225 Difference]: With dead ends: 67 [2019-08-05 11:17:15,751 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 11:17:15,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1880 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1751, Invalid=4411, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:17:15,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 11:17:15,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2019-08-05 11:17:15,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:17:15,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 11:17:15,756 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 60 [2019-08-05 11:17:15,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:15,756 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 11:17:15,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 11:17:15,756 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 11:17:15,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:17:15,757 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:15,757 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 19, 1, 1] [2019-08-05 11:17:15,757 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:15,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:15,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1273615902, now seen corresponding path program 19 times [2019-08-05 11:17:15,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:15,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 11:17:15,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:16,307 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:16,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:16,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:17:16,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:17:16,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:17:16,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:17:16,309 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 23 states. [2019-08-05 11:17:16,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:16,426 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 11:17:16,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:17:16,426 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 61 [2019-08-05 11:17:16,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:16,427 INFO L225 Difference]: With dead ends: 67 [2019-08-05 11:17:16,427 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 11:17:16,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:17:16,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 11:17:16,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-08-05 11:17:16,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 11:17:16,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 11:17:16,430 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 61 [2019-08-05 11:17:16,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:16,431 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 11:17:16,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:17:16,431 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 11:17:16,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 11:17:16,431 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:16,432 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 20, 1, 1] [2019-08-05 11:17:16,432 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:16,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:16,432 INFO L82 PathProgramCache]: Analyzing trace with hash -120796448, now seen corresponding path program 20 times [2019-08-05 11:17:16,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:16,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 11:17:16,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:17,409 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:17,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:17,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 11:17:17,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 11:17:17,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 11:17:17,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=656, Invalid=1236, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:17:17,411 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 44 states. [2019-08-05 11:17:18,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:18,847 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2019-08-05 11:17:18,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 11:17:18,847 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 63 [2019-08-05 11:17:18,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:18,848 INFO L225 Difference]: With dead ends: 70 [2019-08-05 11:17:18,848 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 11:17:18,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2089 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1933, Invalid=4873, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:17:18,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 11:17:18,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2019-08-05 11:17:18,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 11:17:18,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 11:17:18,852 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 63 [2019-08-05 11:17:18,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:18,852 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 11:17:18,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 11:17:18,853 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 11:17:18,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 11:17:18,853 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:18,853 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 20, 1, 1] [2019-08-05 11:17:18,853 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:18,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:18,854 INFO L82 PathProgramCache]: Analyzing trace with hash 550277446, now seen corresponding path program 20 times [2019-08-05 11:17:18,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:18,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 11:17:18,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:19,457 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:19,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:19,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:17:19,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:17:19,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:17:19,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:17:19,458 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 24 states. [2019-08-05 11:17:19,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:19,582 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 11:17:19,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:17:19,583 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 64 [2019-08-05 11:17:19,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:19,584 INFO L225 Difference]: With dead ends: 70 [2019-08-05 11:17:19,584 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 11:17:19,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:17:19,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 11:17:19,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-08-05 11:17:19,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:17:19,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 11:17:19,586 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 64 [2019-08-05 11:17:19,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:19,586 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 11:17:19,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:17:19,587 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 11:17:19,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 11:17:19,587 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:19,587 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 21, 1, 1] [2019-08-05 11:17:19,587 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:19,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:19,587 INFO L82 PathProgramCache]: Analyzing trace with hash 535649288, now seen corresponding path program 21 times [2019-08-05 11:17:19,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:19,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 11:17:19,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:20,377 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:20,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:20,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 11:17:20,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 11:17:20,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 11:17:20,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=720, Invalid=1350, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:17:20,379 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 46 states. [2019-08-05 11:17:22,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:22,154 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2019-08-05 11:17:22,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 11:17:22,154 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 66 [2019-08-05 11:17:22,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:22,155 INFO L225 Difference]: With dead ends: 73 [2019-08-05 11:17:22,155 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 11:17:22,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2309 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2124, Invalid=5358, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:17:22,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 11:17:22,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2019-08-05 11:17:22,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:17:22,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 11:17:22,160 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 66 [2019-08-05 11:17:22,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:22,160 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 11:17:22,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 11:17:22,160 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 11:17:22,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 11:17:22,161 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:22,161 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 21, 1, 1] [2019-08-05 11:17:22,161 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:22,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:22,161 INFO L82 PathProgramCache]: Analyzing trace with hash -574741218, now seen corresponding path program 21 times [2019-08-05 11:17:22,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:22,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 11:17:22,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:22,765 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 0 proven. 693 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:22,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:22,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:17:22,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:17:22,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:17:22,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:17:22,767 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 25 states. [2019-08-05 11:17:22,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:22,891 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 11:17:22,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:17:22,891 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 67 [2019-08-05 11:17:22,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:22,892 INFO L225 Difference]: With dead ends: 73 [2019-08-05 11:17:22,892 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 11:17:22,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:17:22,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 11:17:22,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-08-05 11:17:22,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 11:17:22,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 11:17:22,895 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 67 [2019-08-05 11:17:22,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:22,895 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 11:17:22,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:17:22,895 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 11:17:22,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:17:22,896 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:22,896 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1] [2019-08-05 11:17:22,896 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:22,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:22,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1724471776, now seen corresponding path program 22 times [2019-08-05 11:17:22,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:22,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 11:17:22,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:23,829 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:23,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:23,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 11:17:23,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 11:17:23,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 11:17:23,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=787, Invalid=1469, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:17:23,830 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 48 states. [2019-08-05 11:17:25,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:25,616 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2019-08-05 11:17:25,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 11:17:25,616 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 69 [2019-08-05 11:17:25,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:25,617 INFO L225 Difference]: With dead ends: 76 [2019-08-05 11:17:25,617 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 11:17:25,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2540 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2324, Invalid=5866, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:17:25,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 11:17:25,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2019-08-05 11:17:25,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 11:17:25,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 11:17:25,621 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 69 [2019-08-05 11:17:25,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:25,622 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 11:17:25,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 11:17:25,622 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 11:17:25,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 11:17:25,623 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:25,623 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 22, 1, 1] [2019-08-05 11:17:25,623 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:25,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:25,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1919017542, now seen corresponding path program 22 times [2019-08-05 11:17:25,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:25,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 11:17:25,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:26,320 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 759 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:26,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:26,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:17:26,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:17:26,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:17:26,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:17:26,321 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 26 states. [2019-08-05 11:17:26,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:26,453 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 11:17:26,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:17:26,454 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 70 [2019-08-05 11:17:26,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:26,455 INFO L225 Difference]: With dead ends: 76 [2019-08-05 11:17:26,455 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 11:17:26,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:17:26,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 11:17:26,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-08-05 11:17:26,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:17:26,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 11:17:26,458 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 70 [2019-08-05 11:17:26,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:26,458 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 11:17:26,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:17:26,459 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 11:17:26,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 11:17:26,459 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:26,459 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 23, 1, 1] [2019-08-05 11:17:26,459 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:26,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:26,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1634888968, now seen corresponding path program 23 times [2019-08-05 11:17:26,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:26,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 11:17:26,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:27,698 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:27,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:27,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 11:17:27,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 11:17:27,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 11:17:27,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=857, Invalid=1593, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:17:27,700 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 50 states. [2019-08-05 11:17:29,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:29,593 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2019-08-05 11:17:29,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 11:17:29,594 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 72 [2019-08-05 11:17:29,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:29,595 INFO L225 Difference]: With dead ends: 79 [2019-08-05 11:17:29,595 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 11:17:29,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2782 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2533, Invalid=6397, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:17:29,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 11:17:29,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2019-08-05 11:17:29,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:17:29,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 11:17:29,599 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 72 [2019-08-05 11:17:29,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:29,599 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 11:17:29,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 11:17:29,600 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 11:17:29,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 11:17:29,600 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:29,600 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 23, 1, 1] [2019-08-05 11:17:29,600 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:29,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:29,601 INFO L82 PathProgramCache]: Analyzing trace with hash -858049506, now seen corresponding path program 23 times [2019-08-05 11:17:29,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:29,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 11:17:29,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:30,590 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 0 proven. 828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:30,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:30,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:17:30,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:17:30,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:17:30,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:17:30,591 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 27 states. [2019-08-05 11:17:30,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:30,736 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 11:17:30,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:17:30,737 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 73 [2019-08-05 11:17:30,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:30,738 INFO L225 Difference]: With dead ends: 79 [2019-08-05 11:17:30,738 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 11:17:30,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:17:30,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 11:17:30,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-08-05 11:17:30,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 11:17:30,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 11:17:30,741 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 73 [2019-08-05 11:17:30,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:30,741 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 11:17:30,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:17:30,741 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 11:17:30,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 11:17:30,742 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:30,742 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 24, 1, 1] [2019-08-05 11:17:30,742 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:30,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:30,742 INFO L82 PathProgramCache]: Analyzing trace with hash 48146656, now seen corresponding path program 24 times [2019-08-05 11:17:30,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:30,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:30,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 11:17:30,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:31,830 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:31,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:31,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 11:17:31,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 11:17:31,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 11:17:31,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=930, Invalid=1722, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:17:31,832 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 52 states. [2019-08-05 11:17:34,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:34,139 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2019-08-05 11:17:34,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 11:17:34,139 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 75 [2019-08-05 11:17:34,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:34,139 INFO L225 Difference]: With dead ends: 82 [2019-08-05 11:17:34,140 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 11:17:34,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3035 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2751, Invalid=6951, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:17:34,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 11:17:34,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2019-08-05 11:17:34,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 11:17:34,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 11:17:34,144 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 75 [2019-08-05 11:17:34,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:34,145 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 11:17:34,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 11:17:34,145 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 11:17:34,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 11:17:34,145 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:34,145 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 24, 1, 1] [2019-08-05 11:17:34,146 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:34,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:34,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1492546374, now seen corresponding path program 24 times [2019-08-05 11:17:34,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:34,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 11:17:34,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:35,156 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:35,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:35,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:17:35,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:17:35,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:17:35,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:17:35,158 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 28 states. [2019-08-05 11:17:35,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:35,318 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 11:17:35,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:17:35,318 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 76 [2019-08-05 11:17:35,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:35,319 INFO L225 Difference]: With dead ends: 82 [2019-08-05 11:17:35,319 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 11:17:35,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:17:35,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 11:17:35,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-08-05 11:17:35,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:17:35,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 11:17:35,323 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 76 [2019-08-05 11:17:35,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:35,323 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 11:17:35,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:17:35,324 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 11:17:35,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 11:17:35,324 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:35,324 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 25, 1, 1] [2019-08-05 11:17:35,325 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:35,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:35,325 INFO L82 PathProgramCache]: Analyzing trace with hash -182010360, now seen corresponding path program 25 times [2019-08-05 11:17:35,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:35,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 11:17:35,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:36,458 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:36,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:36,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 11:17:36,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 11:17:36,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 11:17:36,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1006, Invalid=1856, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:17:36,460 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 54 states. [2019-08-05 11:17:38,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:38,898 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2019-08-05 11:17:38,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 11:17:38,899 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 78 [2019-08-05 11:17:38,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:38,900 INFO L225 Difference]: With dead ends: 85 [2019-08-05 11:17:38,900 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 11:17:38,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3299 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2978, Invalid=7528, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 11:17:38,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 11:17:38,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2019-08-05 11:17:38,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:17:38,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 11:17:38,903 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 78 [2019-08-05 11:17:38,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:38,904 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 11:17:38,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 11:17:38,904 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 11:17:38,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 11:17:38,904 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:38,904 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 25, 1, 1] [2019-08-05 11:17:38,905 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:38,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:38,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1347353826, now seen corresponding path program 25 times [2019-08-05 11:17:38,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:39,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 11:17:39,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:39,759 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 0 proven. 975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:39,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:39,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:17:39,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:17:39,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:17:39,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:17:39,760 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 29 states. [2019-08-05 11:17:39,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:39,919 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 11:17:39,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:17:39,919 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 79 [2019-08-05 11:17:39,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:39,920 INFO L225 Difference]: With dead ends: 85 [2019-08-05 11:17:39,920 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 11:17:39,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:17:39,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 11:17:39,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2019-08-05 11:17:39,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 11:17:39,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 11:17:39,923 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 79 [2019-08-05 11:17:39,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:39,923 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 11:17:39,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:17:39,924 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 11:17:39,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 11:17:39,924 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:39,924 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 26, 1, 1] [2019-08-05 11:17:39,924 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:39,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:39,924 INFO L82 PathProgramCache]: Analyzing trace with hash -2021869600, now seen corresponding path program 26 times [2019-08-05 11:17:39,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:40,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 11:17:40,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:41,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:41,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:41,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 11:17:41,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 11:17:41,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 11:17:41,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1085, Invalid=1995, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:17:41,116 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 56 states. [2019-08-05 11:17:43,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:43,661 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2019-08-05 11:17:43,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 11:17:43,662 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 81 [2019-08-05 11:17:43,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:43,663 INFO L225 Difference]: With dead ends: 88 [2019-08-05 11:17:43,663 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 11:17:43,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3574 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3214, Invalid=8128, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 11:17:43,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 11:17:43,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2019-08-05 11:17:43,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 11:17:43,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 11:17:43,666 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 81 [2019-08-05 11:17:43,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:43,666 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 11:17:43,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 11:17:43,667 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 11:17:43,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 11:17:43,667 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:43,667 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 26, 1, 1] [2019-08-05 11:17:43,667 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:43,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:43,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1746551878, now seen corresponding path program 26 times [2019-08-05 11:17:43,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:43,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 11:17:43,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:44,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 0 proven. 1053 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:44,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:44,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:17:44,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:17:44,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:17:44,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:17:44,676 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 30 states. [2019-08-05 11:17:44,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:44,837 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 11:17:44,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:17:44,837 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 82 [2019-08-05 11:17:44,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:44,838 INFO L225 Difference]: With dead ends: 88 [2019-08-05 11:17:44,838 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 11:17:44,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:17:44,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 11:17:44,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-08-05 11:17:44,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 11:17:44,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 11:17:44,841 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 82 [2019-08-05 11:17:44,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:44,842 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 11:17:44,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:17:44,842 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 11:17:44,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 11:17:44,842 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:44,842 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 27, 1, 1] [2019-08-05 11:17:44,842 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:44,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:44,843 INFO L82 PathProgramCache]: Analyzing trace with hash -895856888, now seen corresponding path program 27 times [2019-08-05 11:17:44,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:44,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 11:17:44,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:46,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:46,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:46,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 11:17:46,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 11:17:46,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 11:17:46,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1167, Invalid=2139, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:17:46,137 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 58 states. [2019-08-05 11:17:48,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:48,990 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2019-08-05 11:17:48,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 11:17:48,991 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 84 [2019-08-05 11:17:48,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:48,992 INFO L225 Difference]: With dead ends: 91 [2019-08-05 11:17:48,992 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 11:17:48,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3860 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3459, Invalid=8751, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 11:17:48,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 11:17:48,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2019-08-05 11:17:48,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 11:17:48,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 11:17:48,996 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 84 [2019-08-05 11:17:48,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:48,996 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 11:17:48,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 11:17:48,996 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 11:17:48,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:17:48,997 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:48,997 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 27, 1, 1] [2019-08-05 11:17:48,997 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:48,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:48,998 INFO L82 PathProgramCache]: Analyzing trace with hash -2001759714, now seen corresponding path program 27 times [2019-08-05 11:17:48,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:49,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 11:17:49,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:50,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:50,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:50,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:17:50,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:17:50,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:17:50,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:17:50,069 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 31 states. [2019-08-05 11:17:50,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:50,241 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-05 11:17:50,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:17:50,241 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 85 [2019-08-05 11:17:50,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:50,242 INFO L225 Difference]: With dead ends: 91 [2019-08-05 11:17:50,242 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 11:17:50,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:17:50,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 11:17:50,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2019-08-05 11:17:50,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 11:17:50,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 11:17:50,245 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 85 [2019-08-05 11:17:50,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:50,245 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 11:17:50,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:17:50,246 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 11:17:50,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 11:17:50,246 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:50,246 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 28, 1, 1] [2019-08-05 11:17:50,247 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:50,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:50,247 INFO L82 PathProgramCache]: Analyzing trace with hash 454264544, now seen corresponding path program 28 times [2019-08-05 11:17:50,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:50,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 11:17:50,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:51,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:51,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:51,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 11:17:51,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 11:17:51,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 11:17:51,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1252, Invalid=2288, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:17:51,884 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 60 states. [2019-08-05 11:17:54,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:54,907 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2019-08-05 11:17:54,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 11:17:54,907 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 87 [2019-08-05 11:17:54,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:54,908 INFO L225 Difference]: With dead ends: 94 [2019-08-05 11:17:54,908 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 11:17:54,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4157 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3713, Invalid=9397, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 11:17:54,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 11:17:54,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2019-08-05 11:17:54,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 11:17:54,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 11:17:54,913 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 87 [2019-08-05 11:17:54,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:54,913 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 11:17:54,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 11:17:54,913 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 11:17:54,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 11:17:54,914 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:54,914 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 28, 1, 1] [2019-08-05 11:17:54,914 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:54,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:54,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1197299014, now seen corresponding path program 28 times [2019-08-05 11:17:54,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:55,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 11:17:55,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:56,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 0 proven. 1218 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:56,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:56,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:17:56,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:17:56,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:17:56,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:17:56,082 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 32 states. [2019-08-05 11:17:56,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:56,254 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 11:17:56,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:17:56,254 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 88 [2019-08-05 11:17:56,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:56,255 INFO L225 Difference]: With dead ends: 94 [2019-08-05 11:17:56,256 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 11:17:56,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:17:56,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 11:17:56,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-08-05 11:17:56,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:17:56,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 11:17:56,259 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 88 [2019-08-05 11:17:56,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:56,260 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 11:17:56,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:17:56,260 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 11:17:56,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 11:17:56,261 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:56,261 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 29, 1, 1] [2019-08-05 11:17:56,261 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:56,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:56,261 INFO L82 PathProgramCache]: Analyzing trace with hash -446881784, now seen corresponding path program 29 times [2019-08-05 11:17:56,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:56,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 11:17:56,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:58,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:58,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:58,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 11:17:58,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 11:17:58,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 11:17:58,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1340, Invalid=2442, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:17:58,122 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 62 states. [2019-08-05 11:18:01,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:01,001 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2019-08-05 11:18:01,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 11:18:01,001 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 90 [2019-08-05 11:18:01,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:01,002 INFO L225 Difference]: With dead ends: 97 [2019-08-05 11:18:01,002 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 11:18:01,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4465 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=3976, Invalid=10066, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 11:18:01,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 11:18:01,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2019-08-05 11:18:01,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:18:01,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 11:18:01,006 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 90 [2019-08-05 11:18:01,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:01,006 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 11:18:01,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 11:18:01,006 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 11:18:01,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 11:18:01,007 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:01,007 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 29, 1, 1] [2019-08-05 11:18:01,007 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:01,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:01,007 INFO L82 PathProgramCache]: Analyzing trace with hash -968433378, now seen corresponding path program 29 times [2019-08-05 11:18:01,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:01,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 11:18:01,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:02,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 0 proven. 1305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:02,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:02,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:18:02,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:18:02,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:18:02,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:18:02,212 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 33 states. [2019-08-05 11:18:02,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:02,471 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-08-05 11:18:02,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:18:02,471 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 91 [2019-08-05 11:18:02,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:02,472 INFO L225 Difference]: With dead ends: 97 [2019-08-05 11:18:02,473 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 11:18:02,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:18:02,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 11:18:02,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2019-08-05 11:18:02,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 11:18:02,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-05 11:18:02,476 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 91 [2019-08-05 11:18:02,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:02,477 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-05 11:18:02,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:18:02,477 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-05 11:18:02,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:18:02,478 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:02,478 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 30, 1, 1] [2019-08-05 11:18:02,479 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:02,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:02,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1343428064, now seen corresponding path program 30 times [2019-08-05 11:18:02,480 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:02,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 11:18:02,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:06,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:06,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:06,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 11:18:06,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 11:18:06,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 11:18:06,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=2601, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:18:06,285 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 64 states. [2019-08-05 11:18:09,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:09,493 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2019-08-05 11:18:09,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 11:18:09,493 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 93 [2019-08-05 11:18:09,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:09,494 INFO L225 Difference]: With dead ends: 100 [2019-08-05 11:18:09,494 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 11:18:09,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4784 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=4248, Invalid=10758, Unknown=0, NotChecked=0, Total=15006 [2019-08-05 11:18:09,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 11:18:09,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2019-08-05 11:18:09,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 11:18:09,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-05 11:18:09,498 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 93 [2019-08-05 11:18:09,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:09,499 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-05 11:18:09,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 11:18:09,499 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-05 11:18:09,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 11:18:09,499 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:09,499 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 30, 1, 1] [2019-08-05 11:18:09,500 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:09,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:09,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1303402938, now seen corresponding path program 30 times [2019-08-05 11:18:09,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:09,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 11:18:09,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:11,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 0 proven. 1395 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:11,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:11,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:18:11,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:18:11,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:18:11,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:18:11,980 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 34 states. [2019-08-05 11:18:12,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:12,164 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 11:18:12,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:18:12,167 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 94 [2019-08-05 11:18:12,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:12,167 INFO L225 Difference]: With dead ends: 100 [2019-08-05 11:18:12,167 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 11:18:12,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:18:12,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 11:18:12,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2019-08-05 11:18:12,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:18:12,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-05 11:18:12,169 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 94 [2019-08-05 11:18:12,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:12,170 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-05 11:18:12,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:18:12,170 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-05 11:18:12,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 11:18:12,170 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:12,171 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 31, 1, 1] [2019-08-05 11:18:12,171 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:12,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:12,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1560228104, now seen corresponding path program 31 times [2019-08-05 11:18:12,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:12,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 11:18:12,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:14,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:14,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:14,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 11:18:14,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 11:18:14,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 11:18:14,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1525, Invalid=2765, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:18:14,375 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 66 states. [2019-08-05 11:18:17,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:17,734 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2019-08-05 11:18:17,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 11:18:17,735 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 96 [2019-08-05 11:18:17,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:17,736 INFO L225 Difference]: With dead ends: 103 [2019-08-05 11:18:17,736 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 11:18:17,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5114 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=4529, Invalid=11473, Unknown=0, NotChecked=0, Total=16002 [2019-08-05 11:18:17,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 11:18:17,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-08-05 11:18:17,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:18:17,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 11:18:17,739 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 96 [2019-08-05 11:18:17,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:17,740 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 11:18:17,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 11:18:17,740 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 11:18:17,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 11:18:17,740 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:17,740 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 31, 1, 1] [2019-08-05 11:18:17,741 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:17,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:17,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1122431006, now seen corresponding path program 31 times [2019-08-05 11:18:17,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:17,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 11:18:17,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:19,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 0 proven. 1488 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:19,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:19,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:18:19,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:18:19,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:18:19,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:18:19,286 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 35 states. [2019-08-05 11:18:19,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:19,486 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-08-05 11:18:19,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:18:19,487 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 97 [2019-08-05 11:18:19,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:19,488 INFO L225 Difference]: With dead ends: 103 [2019-08-05 11:18:19,488 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 11:18:19,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:18:19,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 11:18:19,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-08-05 11:18:19,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 11:18:19,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-08-05 11:18:19,491 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 97 [2019-08-05 11:18:19,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:19,491 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-08-05 11:18:19,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:18:19,491 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-08-05 11:18:19,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 11:18:19,491 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:19,492 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 32, 1, 1] [2019-08-05 11:18:19,492 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:19,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:19,492 INFO L82 PathProgramCache]: Analyzing trace with hash 619406560, now seen corresponding path program 32 times [2019-08-05 11:18:19,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:19,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 11:18:19,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:21,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:21,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:21,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 11:18:21,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 11:18:21,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 11:18:21,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1622, Invalid=2934, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:18:21,388 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 68 states. [2019-08-05 11:18:25,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:25,047 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2019-08-05 11:18:25,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 11:18:25,047 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 99 [2019-08-05 11:18:25,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:25,048 INFO L225 Difference]: With dead ends: 106 [2019-08-05 11:18:25,048 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 11:18:25,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5455 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=4819, Invalid=12211, Unknown=0, NotChecked=0, Total=17030 [2019-08-05 11:18:25,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 11:18:25,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2019-08-05 11:18:25,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 11:18:25,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-08-05 11:18:25,051 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 99 [2019-08-05 11:18:25,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:25,052 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-08-05 11:18:25,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 11:18:25,052 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-08-05 11:18:25,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 11:18:25,052 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:25,052 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 32, 1, 1] [2019-08-05 11:18:25,053 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:25,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:25,053 INFO L82 PathProgramCache]: Analyzing trace with hash 2021734214, now seen corresponding path program 32 times [2019-08-05 11:18:25,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:25,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 11:18:25,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:28,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 0 proven. 1584 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:28,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:28,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:18:28,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:18:28,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:18:28,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:18:28,708 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 36 states. [2019-08-05 11:18:28,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:28,917 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 11:18:28,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:18:28,917 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 100 [2019-08-05 11:18:28,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:28,918 INFO L225 Difference]: With dead ends: 106 [2019-08-05 11:18:28,919 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 11:18:28,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:18:28,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 11:18:28,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-08-05 11:18:28,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:18:28,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-05 11:18:28,922 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 100 [2019-08-05 11:18:28,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:28,922 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-05 11:18:28,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:18:28,923 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-05 11:18:28,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 11:18:28,923 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:28,923 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 33, 1, 1] [2019-08-05 11:18:28,924 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:28,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:28,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1561362952, now seen corresponding path program 33 times [2019-08-05 11:18:28,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:29,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 11:18:29,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:31,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:31,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:31,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 11:18:31,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 11:18:31,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 11:18:31,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1722, Invalid=3108, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:18:31,112 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 70 states. [2019-08-05 11:18:35,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:35,101 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2019-08-05 11:18:35,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 11:18:35,101 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 102 [2019-08-05 11:18:35,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:35,102 INFO L225 Difference]: With dead ends: 109 [2019-08-05 11:18:35,102 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 11:18:35,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5807 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5118, Invalid=12972, Unknown=0, NotChecked=0, Total=18090 [2019-08-05 11:18:35,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 11:18:35,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2019-08-05 11:18:35,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:18:35,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-08-05 11:18:35,106 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 102 [2019-08-05 11:18:35,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:35,107 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-08-05 11:18:35,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 11:18:35,107 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-08-05 11:18:35,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 11:18:35,107 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:35,108 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 33, 1, 1] [2019-08-05 11:18:35,108 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:35,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:35,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1157611294, now seen corresponding path program 33 times [2019-08-05 11:18:35,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:35,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 11:18:35,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:36,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 0 proven. 1683 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:36,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:36,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:18:36,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:18:36,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:18:36,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:18:36,802 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 37 states. [2019-08-05 11:18:37,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:37,034 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-08-05 11:18:37,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:18:37,034 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 103 [2019-08-05 11:18:37,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:37,035 INFO L225 Difference]: With dead ends: 109 [2019-08-05 11:18:37,035 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 11:18:37,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:18:37,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 11:18:37,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2019-08-05 11:18:37,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 11:18:37,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-08-05 11:18:37,038 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 103 [2019-08-05 11:18:37,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:37,038 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-08-05 11:18:37,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:18:37,039 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-08-05 11:18:37,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 11:18:37,039 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:37,039 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 34, 1, 1] [2019-08-05 11:18:37,039 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:37,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:37,040 INFO L82 PathProgramCache]: Analyzing trace with hash 67924960, now seen corresponding path program 34 times [2019-08-05 11:18:37,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:37,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:37,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 11:18:37,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:39,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:39,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:39,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 11:18:39,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 11:18:39,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 11:18:39,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1825, Invalid=3287, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:18:39,433 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 72 states. [2019-08-05 11:18:43,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:43,471 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2019-08-05 11:18:43,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 11:18:43,472 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 105 [2019-08-05 11:18:43,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:43,473 INFO L225 Difference]: With dead ends: 112 [2019-08-05 11:18:43,473 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 11:18:43,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6170 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=5426, Invalid=13756, Unknown=0, NotChecked=0, Total=19182 [2019-08-05 11:18:43,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 11:18:43,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-08-05 11:18:43,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 11:18:43,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-08-05 11:18:43,477 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 105 [2019-08-05 11:18:43,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:43,477 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-08-05 11:18:43,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 11:18:43,477 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-08-05 11:18:43,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 11:18:43,478 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:43,478 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 34, 1, 1] [2019-08-05 11:18:43,478 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:43,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:43,479 INFO L82 PathProgramCache]: Analyzing trace with hash 2105673798, now seen corresponding path program 34 times [2019-08-05 11:18:43,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:43,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 11:18:43,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:45,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 0 proven. 1785 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:45,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:45,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:18:45,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:18:45,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:18:45,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:18:45,265 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 38 states. [2019-08-05 11:18:45,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:45,482 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-08-05 11:18:45,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 11:18:45,482 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 106 [2019-08-05 11:18:45,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:45,483 INFO L225 Difference]: With dead ends: 112 [2019-08-05 11:18:45,483 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 11:18:45,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:18:45,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 11:18:45,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-08-05 11:18:45,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:18:45,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-08-05 11:18:45,486 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 106 [2019-08-05 11:18:45,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:45,486 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-08-05 11:18:45,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:18:45,486 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-08-05 11:18:45,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 11:18:45,486 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:45,487 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 35, 1, 1] [2019-08-05 11:18:45,487 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:45,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:45,487 INFO L82 PathProgramCache]: Analyzing trace with hash 622924552, now seen corresponding path program 35 times [2019-08-05 11:18:45,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:45,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 11:18:45,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:47,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:47,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:47,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 11:18:47,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 11:18:47,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 11:18:47,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1931, Invalid=3471, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:18:47,810 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 74 states. [2019-08-05 11:18:52,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:52,132 INFO L93 Difference]: Finished difference Result 115 states and 116 transitions. [2019-08-05 11:18:52,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 11:18:52,133 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 108 [2019-08-05 11:18:52,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:52,134 INFO L225 Difference]: With dead ends: 115 [2019-08-05 11:18:52,134 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 11:18:52,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6544 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=5743, Invalid=14563, Unknown=0, NotChecked=0, Total=20306 [2019-08-05 11:18:52,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 11:18:52,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2019-08-05 11:18:52,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:18:52,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-05 11:18:52,137 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 108 [2019-08-05 11:18:52,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:52,137 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-05 11:18:52,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 11:18:52,138 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-05 11:18:52,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 11:18:52,138 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:52,138 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 35, 1, 1] [2019-08-05 11:18:52,138 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:52,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:52,139 INFO L82 PathProgramCache]: Analyzing trace with hash 2130791966, now seen corresponding path program 35 times [2019-08-05 11:18:52,139 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:52,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 11:18:52,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:54,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 0 proven. 1890 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:54,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:54,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:18:54,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:18:54,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:18:54,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:18:54,073 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 39 states. [2019-08-05 11:18:54,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:54,308 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-08-05 11:18:54,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:18:54,309 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 109 [2019-08-05 11:18:54,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:54,310 INFO L225 Difference]: With dead ends: 115 [2019-08-05 11:18:54,310 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 11:18:54,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:18:54,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 11:18:54,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-08-05 11:18:54,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 11:18:54,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-08-05 11:18:54,314 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 109 [2019-08-05 11:18:54,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:54,314 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-08-05 11:18:54,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:18:54,315 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-08-05 11:18:54,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 11:18:54,315 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:54,315 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 36, 1, 1] [2019-08-05 11:18:54,315 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:54,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:54,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1008319776, now seen corresponding path program 36 times [2019-08-05 11:18:54,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:54,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 11:18:54,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:56,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:56,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:56,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 11:18:56,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 11:18:56,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 11:18:56,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2040, Invalid=3660, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:18:56,793 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 76 states. [2019-08-05 11:18:58,298 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2019-08-05 11:19:01,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:01,818 INFO L93 Difference]: Finished difference Result 118 states and 119 transitions. [2019-08-05 11:19:01,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 11:19:01,818 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 111 [2019-08-05 11:19:01,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:01,819 INFO L225 Difference]: With dead ends: 118 [2019-08-05 11:19:01,819 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 11:19:01,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6929 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=6069, Invalid=15393, Unknown=0, NotChecked=0, Total=21462 [2019-08-05 11:19:01,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 11:19:01,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2019-08-05 11:19:01,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 11:19:01,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-08-05 11:19:01,823 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 111 [2019-08-05 11:19:01,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:01,823 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-08-05 11:19:01,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 11:19:01,823 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-08-05 11:19:01,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 11:19:01,824 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:01,824 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 36, 1, 1] [2019-08-05 11:19:01,824 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:01,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:01,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1193141946, now seen corresponding path program 36 times [2019-08-05 11:19:01,825 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:02,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 11:19:02,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:03,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 0 proven. 1998 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:03,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:03,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 11:19:03,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 11:19:03,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 11:19:03,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:19:03,979 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 40 states. [2019-08-05 11:19:04,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:04,251 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-08-05 11:19:04,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 11:19:04,252 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 112 [2019-08-05 11:19:04,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:04,252 INFO L225 Difference]: With dead ends: 118 [2019-08-05 11:19:04,252 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 11:19:04,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:19:04,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 11:19:04,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-08-05 11:19:04,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:19:04,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-08-05 11:19:04,254 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 112 [2019-08-05 11:19:04,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:04,254 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-08-05 11:19:04,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 11:19:04,254 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-08-05 11:19:04,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 11:19:04,255 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:04,255 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 37, 1, 1] [2019-08-05 11:19:04,255 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:04,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:04,255 INFO L82 PathProgramCache]: Analyzing trace with hash 146859016, now seen corresponding path program 37 times [2019-08-05 11:19:04,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:04,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:04,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 11:19:04,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:06,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:06,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:06,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 11:19:06,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 11:19:06,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 11:19:06,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2152, Invalid=3854, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:19:06,832 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 78 states. [2019-08-05 11:19:11,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:11,673 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2019-08-05 11:19:11,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 11:19:11,673 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 114 [2019-08-05 11:19:11,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:11,674 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:19:11,674 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:19:11,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7325 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=6404, Invalid=16246, Unknown=0, NotChecked=0, Total=22650 [2019-08-05 11:19:11,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:19:11,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2019-08-05 11:19:11,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:19:11,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-08-05 11:19:11,677 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 114 [2019-08-05 11:19:11,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:11,677 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-08-05 11:19:11,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 11:19:11,677 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-08-05 11:19:11,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 11:19:11,678 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:11,678 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 37, 1, 1] [2019-08-05 11:19:11,678 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:11,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:11,678 INFO L82 PathProgramCache]: Analyzing trace with hash 257662238, now seen corresponding path program 37 times [2019-08-05 11:19:11,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:12,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:12,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 11:19:12,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:13,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 0 proven. 2109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:13,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:13,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:19:13,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 11:19:13,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 11:19:13,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:19:13,728 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 41 states. [2019-08-05 11:19:13,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:13,961 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-08-05 11:19:13,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:19:13,962 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 115 [2019-08-05 11:19:13,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:13,963 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:19:13,963 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:19:13,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:19:13,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:19:13,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2019-08-05 11:19:13,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-08-05 11:19:13,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-08-05 11:19:13,967 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 115 [2019-08-05 11:19:13,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:13,967 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-08-05 11:19:13,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 11:19:13,967 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-08-05 11:19:13,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-05 11:19:13,968 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:13,968 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 38, 1, 1] [2019-08-05 11:19:13,968 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:13,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:13,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1494691360, now seen corresponding path program 38 times [2019-08-05 11:19:13,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:14,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 11:19:14,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:17,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:17,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:17,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 11:19:17,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 11:19:17,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 11:19:17,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2267, Invalid=4053, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 11:19:17,019 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 80 states. [2019-08-05 11:19:22,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:22,254 INFO L93 Difference]: Finished difference Result 124 states and 125 transitions. [2019-08-05 11:19:22,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 11:19:22,255 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 117 [2019-08-05 11:19:22,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:22,256 INFO L225 Difference]: With dead ends: 124 [2019-08-05 11:19:22,256 INFO L226 Difference]: Without dead ends: 124 [2019-08-05 11:19:22,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7732 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=6748, Invalid=17122, Unknown=0, NotChecked=0, Total=23870 [2019-08-05 11:19:22,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-08-05 11:19:22,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-08-05 11:19:22,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-08-05 11:19:22,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-08-05 11:19:22,259 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 117 [2019-08-05 11:19:22,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:22,259 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-08-05 11:19:22,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 11:19:22,259 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-08-05 11:19:22,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-05 11:19:22,260 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:22,260 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 38, 1, 1] [2019-08-05 11:19:22,260 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:22,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:22,260 INFO L82 PathProgramCache]: Analyzing trace with hash 909208134, now seen corresponding path program 38 times [2019-08-05 11:19:22,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:22,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 11:19:22,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:24,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 0 proven. 2223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:24,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:24,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 11:19:24,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 11:19:24,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 11:19:24,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:19:24,307 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 42 states. [2019-08-05 11:19:24,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:24,566 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2019-08-05 11:19:24,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 11:19:24,567 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 118 [2019-08-05 11:19:24,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:24,568 INFO L225 Difference]: With dead ends: 124 [2019-08-05 11:19:24,568 INFO L226 Difference]: Without dead ends: 124 [2019-08-05 11:19:24,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:19:24,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-08-05 11:19:24,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2019-08-05 11:19:24,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:19:24,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2019-08-05 11:19:24,571 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 118 [2019-08-05 11:19:24,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:24,571 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2019-08-05 11:19:24,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 11:19:24,571 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2019-08-05 11:19:24,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-05 11:19:24,572 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:24,572 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 39, 1, 1] [2019-08-05 11:19:24,572 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:24,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:24,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1870656776, now seen corresponding path program 39 times [2019-08-05 11:19:24,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:24,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 121 conjunts are in the unsatisfiable core [2019-08-05 11:19:24,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:27,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:27,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:27,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 11:19:27,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 11:19:27,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 11:19:27,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2385, Invalid=4257, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 11:19:27,523 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 82 states. [2019-08-05 11:19:33,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:33,001 INFO L93 Difference]: Finished difference Result 127 states and 128 transitions. [2019-08-05 11:19:33,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 11:19:33,002 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 120 [2019-08-05 11:19:33,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:33,003 INFO L225 Difference]: With dead ends: 127 [2019-08-05 11:19:33,003 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 11:19:33,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8150 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=7101, Invalid=18021, Unknown=0, NotChecked=0, Total=25122 [2019-08-05 11:19:33,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 11:19:33,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2019-08-05 11:19:33,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:19:33,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-08-05 11:19:33,007 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 120 [2019-08-05 11:19:33,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:33,007 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2019-08-05 11:19:33,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 11:19:33,007 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2019-08-05 11:19:33,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-08-05 11:19:33,008 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:33,008 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 39, 1, 1] [2019-08-05 11:19:33,008 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:33,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:33,008 INFO L82 PathProgramCache]: Analyzing trace with hash -2139182050, now seen corresponding path program 39 times [2019-08-05 11:19:33,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:33,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 121 conjunts are in the unsatisfiable core [2019-08-05 11:19:33,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:35,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 0 proven. 2340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:35,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:35,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:19:35,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 11:19:35,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 11:19:35,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:19:35,327 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 43 states. [2019-08-05 11:19:35,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:35,592 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2019-08-05 11:19:35,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:19:35,592 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 121 [2019-08-05 11:19:35,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:35,593 INFO L225 Difference]: With dead ends: 127 [2019-08-05 11:19:35,593 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 11:19:35,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:19:35,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 11:19:35,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-08-05 11:19:35,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-08-05 11:19:35,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2019-08-05 11:19:35,596 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 121 [2019-08-05 11:19:35,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:35,597 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2019-08-05 11:19:35,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 11:19:35,597 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2019-08-05 11:19:35,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-08-05 11:19:35,597 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:35,597 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 40, 1, 1] [2019-08-05 11:19:35,598 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:35,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:35,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1535385824, now seen corresponding path program 40 times [2019-08-05 11:19:35,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:36,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 124 conjunts are in the unsatisfiable core [2019-08-05 11:19:36,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:38,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:38,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:38,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 11:19:38,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 11:19:38,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 11:19:38,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2506, Invalid=4466, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 11:19:38,751 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 84 states. [2019-08-05 11:19:44,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:44,506 INFO L93 Difference]: Finished difference Result 130 states and 131 transitions. [2019-08-05 11:19:44,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 11:19:44,507 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 123 [2019-08-05 11:19:44,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:44,508 INFO L225 Difference]: With dead ends: 130 [2019-08-05 11:19:44,508 INFO L226 Difference]: Without dead ends: 130 [2019-08-05 11:19:44,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8579 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=7463, Invalid=18943, Unknown=0, NotChecked=0, Total=26406 [2019-08-05 11:19:44,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-08-05 11:19:44,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2019-08-05 11:19:44,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-08-05 11:19:44,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2019-08-05 11:19:44,512 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 123 [2019-08-05 11:19:44,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:44,512 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2019-08-05 11:19:44,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 11:19:44,512 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2019-08-05 11:19:44,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-08-05 11:19:44,513 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:44,513 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 40, 1, 1] [2019-08-05 11:19:44,513 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:44,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:44,514 INFO L82 PathProgramCache]: Analyzing trace with hash 352320326, now seen corresponding path program 40 times [2019-08-05 11:19:44,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:45,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 124 conjunts are in the unsatisfiable core [2019-08-05 11:19:45,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:47,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2460 backedges. 0 proven. 2460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:47,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:47,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 11:19:47,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 11:19:47,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 11:19:47,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:19:47,018 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 44 states. [2019-08-05 11:19:47,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:47,274 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2019-08-05 11:19:47,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 11:19:47,274 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 124 [2019-08-05 11:19:47,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:47,276 INFO L225 Difference]: With dead ends: 130 [2019-08-05 11:19:47,276 INFO L226 Difference]: Without dead ends: 130 [2019-08-05 11:19:47,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:19:47,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-08-05 11:19:47,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-08-05 11:19:47,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:19:47,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2019-08-05 11:19:47,279 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 124 [2019-08-05 11:19:47,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:47,279 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2019-08-05 11:19:47,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 11:19:47,279 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2019-08-05 11:19:47,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-08-05 11:19:47,280 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:47,280 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 41, 1, 1] [2019-08-05 11:19:47,281 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:47,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:47,281 INFO L82 PathProgramCache]: Analyzing trace with hash -722582008, now seen corresponding path program 41 times [2019-08-05 11:19:47,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:47,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:47,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 127 conjunts are in the unsatisfiable core [2019-08-05 11:19:47,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:51,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:51,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:51,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 11:19:51,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 11:19:51,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 11:19:51,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2630, Invalid=4680, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 11:19:51,015 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 86 states. [2019-08-05 11:19:57,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:57,037 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2019-08-05 11:19:57,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 11:19:57,038 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 126 [2019-08-05 11:19:57,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:57,039 INFO L225 Difference]: With dead ends: 133 [2019-08-05 11:19:57,039 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 11:19:57,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9019 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=7834, Invalid=19888, Unknown=0, NotChecked=0, Total=27722 [2019-08-05 11:19:57,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 11:19:57,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2019-08-05 11:19:57,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-08-05 11:19:57,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2019-08-05 11:19:57,043 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 126 [2019-08-05 11:19:57,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:57,043 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2019-08-05 11:19:57,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 11:19:57,044 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2019-08-05 11:19:57,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-08-05 11:19:57,044 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:57,044 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 41, 1, 1] [2019-08-05 11:19:57,045 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:57,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:57,045 INFO L82 PathProgramCache]: Analyzing trace with hash -925205730, now seen corresponding path program 41 times [2019-08-05 11:19:57,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:57,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 127 conjunts are in the unsatisfiable core [2019-08-05 11:19:57,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:59,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 0 proven. 2583 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:59,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:59,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:19:59,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 11:19:59,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 11:19:59,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:19:59,501 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 45 states. [2019-08-05 11:19:59,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:59,795 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2019-08-05 11:19:59,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 11:19:59,795 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 127 [2019-08-05 11:19:59,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:59,797 INFO L225 Difference]: With dead ends: 133 [2019-08-05 11:19:59,797 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 11:19:59,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:19:59,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 11:19:59,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-08-05 11:19:59,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-08-05 11:19:59,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2019-08-05 11:19:59,800 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 127 [2019-08-05 11:19:59,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:59,800 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2019-08-05 11:19:59,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 11:19:59,800 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2019-08-05 11:19:59,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-08-05 11:19:59,801 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:59,801 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 42, 1, 1] [2019-08-05 11:19:59,801 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:59,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:59,802 INFO L82 PathProgramCache]: Analyzing trace with hash -64475168, now seen corresponding path program 42 times [2019-08-05 11:19:59,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:00,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:00,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 130 conjunts are in the unsatisfiable core [2019-08-05 11:20:00,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:03,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:03,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:03,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 11:20:03,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 11:20:03,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 11:20:03,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2757, Invalid=4899, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 11:20:03,535 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 88 states. [2019-08-05 11:20:09,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:09,948 INFO L93 Difference]: Finished difference Result 136 states and 137 transitions. [2019-08-05 11:20:09,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 11:20:09,949 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 129 [2019-08-05 11:20:09,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:09,950 INFO L225 Difference]: With dead ends: 136 [2019-08-05 11:20:09,950 INFO L226 Difference]: Without dead ends: 136 [2019-08-05 11:20:09,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9470 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=8214, Invalid=20856, Unknown=0, NotChecked=0, Total=29070 [2019-08-05 11:20:09,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-08-05 11:20:09,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2019-08-05 11:20:09,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-08-05 11:20:09,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2019-08-05 11:20:09,954 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 129 [2019-08-05 11:20:09,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:09,955 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2019-08-05 11:20:09,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 11:20:09,955 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2019-08-05 11:20:09,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-08-05 11:20:09,955 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:09,956 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 42, 1, 1] [2019-08-05 11:20:09,956 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:09,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:09,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1998730170, now seen corresponding path program 42 times [2019-08-05 11:20:09,957 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:10,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 130 conjunts are in the unsatisfiable core [2019-08-05 11:20:10,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:12,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 0 proven. 2709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:12,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:12,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 11:20:12,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 11:20:12,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 11:20:12,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:20:12,692 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 46 states. [2019-08-05 11:20:12,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:12,970 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2019-08-05 11:20:12,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 11:20:12,971 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 130 [2019-08-05 11:20:12,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:12,972 INFO L225 Difference]: With dead ends: 136 [2019-08-05 11:20:12,972 INFO L226 Difference]: Without dead ends: 136 [2019-08-05 11:20:12,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:20:12,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-08-05 11:20:12,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2019-08-05 11:20:12,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-08-05 11:20:12,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2019-08-05 11:20:12,975 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 130 [2019-08-05 11:20:12,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:12,976 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2019-08-05 11:20:12,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 11:20:12,976 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2019-08-05 11:20:12,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-08-05 11:20:12,977 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:12,977 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 43, 1, 1] [2019-08-05 11:20:12,977 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:12,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:12,977 INFO L82 PathProgramCache]: Analyzing trace with hash -929310968, now seen corresponding path program 43 times [2019-08-05 11:20:12,978 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:13,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 133 conjunts are in the unsatisfiable core [2019-08-05 11:20:13,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:16,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:16,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:16,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 11:20:16,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 11:20:16,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 11:20:17,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2887, Invalid=5123, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 11:20:17,000 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 90 states. [2019-08-05 11:20:23,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:23,799 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2019-08-05 11:20:23,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 11:20:23,799 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 132 [2019-08-05 11:20:23,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:23,800 INFO L225 Difference]: With dead ends: 139 [2019-08-05 11:20:23,800 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 11:20:23,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9932 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=8603, Invalid=21847, Unknown=0, NotChecked=0, Total=30450 [2019-08-05 11:20:23,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 11:20:23,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2019-08-05 11:20:23,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:20:23,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-08-05 11:20:23,804 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 132 [2019-08-05 11:20:23,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:23,805 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2019-08-05 11:20:23,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 11:20:23,805 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2019-08-05 11:20:23,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-08-05 11:20:23,805 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:23,806 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 43, 1, 1] [2019-08-05 11:20:23,806 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:23,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:23,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1256131102, now seen corresponding path program 43 times [2019-08-05 11:20:23,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:24,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 133 conjunts are in the unsatisfiable core [2019-08-05 11:20:24,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 0 proven. 2838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:26,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:26,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:20:26,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 11:20:26,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 11:20:26,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:20:26,622 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 47 states. [2019-08-05 11:20:26,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:26,896 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2019-08-05 11:20:26,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:20:26,896 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 133 [2019-08-05 11:20:26,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:26,897 INFO L225 Difference]: With dead ends: 139 [2019-08-05 11:20:26,898 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 11:20:26,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:20:26,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 11:20:26,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2019-08-05 11:20:26,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-08-05 11:20:26,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2019-08-05 11:20:26,900 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 133 [2019-08-05 11:20:26,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:26,901 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2019-08-05 11:20:26,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 11:20:26,901 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2019-08-05 11:20:26,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-08-05 11:20:26,901 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:26,902 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 44, 1, 1] [2019-08-05 11:20:26,902 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:26,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:26,902 INFO L82 PathProgramCache]: Analyzing trace with hash 256179936, now seen corresponding path program 44 times [2019-08-05 11:20:26,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:27,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 136 conjunts are in the unsatisfiable core [2019-08-05 11:20:27,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:30,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:30,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:30,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 11:20:30,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 11:20:30,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 11:20:30,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3020, Invalid=5352, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 11:20:30,905 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 92 states. [2019-08-05 11:20:38,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:38,159 INFO L93 Difference]: Finished difference Result 142 states and 143 transitions. [2019-08-05 11:20:38,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 11:20:38,160 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 135 [2019-08-05 11:20:38,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:38,161 INFO L225 Difference]: With dead ends: 142 [2019-08-05 11:20:38,161 INFO L226 Difference]: Without dead ends: 142 [2019-08-05 11:20:38,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10405 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=9001, Invalid=22861, Unknown=0, NotChecked=0, Total=31862 [2019-08-05 11:20:38,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-08-05 11:20:38,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2019-08-05 11:20:38,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-08-05 11:20:38,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2019-08-05 11:20:38,165 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 135 [2019-08-05 11:20:38,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:38,165 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2019-08-05 11:20:38,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 11:20:38,166 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2019-08-05 11:20:38,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-08-05 11:20:38,166 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:38,167 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 44, 1, 1] [2019-08-05 11:20:38,167 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:38,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:38,167 INFO L82 PathProgramCache]: Analyzing trace with hash -648356538, now seen corresponding path program 44 times [2019-08-05 11:20:38,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:38,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 136 conjunts are in the unsatisfiable core [2019-08-05 11:20:38,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:41,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:41,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:41,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 11:20:41,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 11:20:41,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 11:20:41,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:20:41,075 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 48 states. [2019-08-05 11:20:41,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:41,378 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2019-08-05 11:20:41,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 11:20:41,378 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 136 [2019-08-05 11:20:41,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:41,379 INFO L225 Difference]: With dead ends: 142 [2019-08-05 11:20:41,380 INFO L226 Difference]: Without dead ends: 142 [2019-08-05 11:20:41,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:20:41,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-08-05 11:20:41,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2019-08-05 11:20:41,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:20:41,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-08-05 11:20:41,384 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 136 [2019-08-05 11:20:41,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:41,384 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-08-05 11:20:41,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 11:20:41,384 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-08-05 11:20:41,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-08-05 11:20:41,385 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:41,385 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 45, 1, 1] [2019-08-05 11:20:41,385 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:41,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:41,386 INFO L82 PathProgramCache]: Analyzing trace with hash -300374008, now seen corresponding path program 45 times [2019-08-05 11:20:41,386 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:42,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 139 conjunts are in the unsatisfiable core [2019-08-05 11:20:42,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 11:20:43,788 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 11:20:43,788 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 11:20:43,793 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 11:20:43,794 INFO L202 PluginConnector]: Adding new model GasCakeWithJohoFractions01FixedInput.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:20:43 BoogieIcfgContainer [2019-08-05 11:20:43,794 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:20:43,795 INFO L168 Benchmark]: Toolchain (without parser) took 245902.90 ms. Allocated memory was 133.2 MB in the beginning and 693.1 MB in the end (delta: 559.9 MB). Free memory was 109.4 MB in the beginning and 526.6 MB in the end (delta: -417.3 MB). Peak memory consumption was 142.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:20:43,796 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 133.2 MB. Free memory was 110.6 MB in the beginning and 110.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:20:43,797 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.44 ms. Allocated memory is still 133.2 MB. Free memory was 109.4 MB in the beginning and 107.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:20:43,797 INFO L168 Benchmark]: Boogie Preprocessor took 21.39 ms. Allocated memory is still 133.2 MB. Free memory was 107.4 MB in the beginning and 106.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:20:43,798 INFO L168 Benchmark]: RCFGBuilder took 342.97 ms. Allocated memory is still 133.2 MB. Free memory was 106.3 MB in the beginning and 97.1 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:20:43,798 INFO L168 Benchmark]: TraceAbstraction took 245496.53 ms. Allocated memory was 133.2 MB in the beginning and 693.1 MB in the end (delta: 559.9 MB). Free memory was 96.9 MB in the beginning and 526.6 MB in the end (delta: -429.7 MB). Peak memory consumption was 130.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:20:43,801 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 133.2 MB. Free memory was 110.6 MB in the beginning and 110.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.44 ms. Allocated memory is still 133.2 MB. Free memory was 109.4 MB in the beginning and 107.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.39 ms. Allocated memory is still 133.2 MB. Free memory was 107.4 MB in the beginning and 106.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 342.97 ms. Allocated memory is still 133.2 MB. Free memory was 106.3 MB in the beginning and 97.1 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 245496.53 ms. Allocated memory was 133.2 MB in the beginning and 693.1 MB in the end (delta: 559.9 MB). Free memory was 96.9 MB in the beginning and 526.6 MB in the end (delta: -429.7 MB). Peak memory consumption was 130.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 21). Cancelled while BasicCegarLoop was analyzing trace of length 139 with TraceHistMax 46,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 64 known predicates. - TimeoutResultAtElement [Line: 20]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 20). Cancelled while BasicCegarLoop was analyzing trace of length 139 with TraceHistMax 46,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 64 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 2 error locations. TIMEOUT Result, 245.4s OverallTime, 91 OverallIterations, 46 TraceHistogramMax, 120.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 269 SDtfs, 5993 SDslu, 217 SDs, 0 SdLazy, 9540 SolverSat, 1274 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8100 GetRequests, 3015 SyntacticMatches, 0 SemanticMatches, 5085 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156048 ImplicationChecksByTransitivity, 204.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 90 MinimizatonAttempts, 133 StatesRemovedByMinimization, 89 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 14.4s SatisfiabilityAnalysisTime, 106.9s InterpolantComputationTime, 6255 NumberOfCodeBlocks, 6255 NumberOfCodeBlocksAsserted, 90 NumberOfCheckSat, 6165 ConstructedInterpolants, 0 QuantifiedInterpolants, 5881341 SizeOfPredicates, 1980 NumberOfNonLiveVariables, 17055 ConjunctsInSsa, 6300 ConjunctsInUnsatCore, 90 InterpolantComputations, 2 PerfectInterpolantSequences, 0/90090 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown