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/unrolling-tests/ReachDef-Simple.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 09:53:24,950 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 09:53:24,952 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 09:53:24,964 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 09:53:24,964 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 09:53:24,965 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 09:53:24,966 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 09:53:24,968 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 09:53:24,970 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 09:53:24,971 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 09:53:24,972 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 09:53:24,972 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 09:53:24,973 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 09:53:24,974 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 09:53:24,975 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 09:53:24,976 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 09:53:24,977 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 09:53:24,978 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 09:53:24,979 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 09:53:24,982 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 09:53:24,983 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 09:53:24,985 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 09:53:24,986 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 09:53:24,987 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 09:53:24,989 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 09:53:24,990 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 09:53:24,990 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 09:53:24,991 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 09:53:24,991 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 09:53:24,992 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 09:53:24,992 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 09:53:24,993 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 09:53:24,994 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 09:53:24,995 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 09:53:24,996 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 09:53:24,996 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 09:53:24,997 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 09:53:24,997 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 09:53:24,997 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 09:53:24,999 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 09:53:24,999 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 09:53:25,028 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 09:53:25,040 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 09:53:25,044 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 09:53:25,045 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 09:53:25,046 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 09:53:25,047 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/unrolling-tests/ReachDef-Simple.bpl [2019-08-05 09:53:25,047 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/unrolling-tests/ReachDef-Simple.bpl' [2019-08-05 09:53:25,080 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 09:53:25,082 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 09:53:25,083 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 09:53:25,083 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 09:53:25,083 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 09:53:25,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ReachDef-Simple.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:53:25" (1/1) ... [2019-08-05 09:53:25,110 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ReachDef-Simple.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:53:25" (1/1) ... [2019-08-05 09:53:25,115 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 09:53:25,116 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 09:53:25,116 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 09:53:25,118 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 09:53:25,119 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 09:53:25,119 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 09:53:25,119 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 09:53:25,130 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ReachDef-Simple.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:53:25" (1/1) ... [2019-08-05 09:53:25,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ReachDef-Simple.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:53:25" (1/1) ... [2019-08-05 09:53:25,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ReachDef-Simple.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:53:25" (1/1) ... [2019-08-05 09:53:25,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ReachDef-Simple.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:53:25" (1/1) ... [2019-08-05 09:53:25,134 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ReachDef-Simple.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:53:25" (1/1) ... [2019-08-05 09:53:25,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ReachDef-Simple.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:53:25" (1/1) ... [2019-08-05 09:53:25,139 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ReachDef-Simple.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:53:25" (1/1) ... [2019-08-05 09:53:25,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 09:53:25,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 09:53:25,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 09:53:25,141 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 09:53:25,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ReachDef-Simple.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:53:25" (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 09:53:25,214 INFO L130 BoogieDeclarations]: Found specification of procedure Main [2019-08-05 09:53:25,214 INFO L138 BoogieDeclarations]: Found implementation of procedure Main [2019-08-05 09:53:25,406 INFO L275 CfgBuilder]: Using library mode [2019-08-05 09:53:25,406 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 09:53:25,407 INFO L202 PluginConnector]: Adding new model ReachDef-Simple.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 09:53:25 BoogieIcfgContainer [2019-08-05 09:53:25,407 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 09:53:25,409 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 09:53:25,409 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 09:53:25,412 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 09:53:25,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ReachDef-Simple.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:53:25" (1/2) ... [2019-08-05 09:53:25,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e76f99d and model type ReachDef-Simple.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 09:53:25, skipping insertion in model container [2019-08-05 09:53:25,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ReachDef-Simple.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 09:53:25" (2/2) ... [2019-08-05 09:53:25,416 INFO L109 eAbstractionObserver]: Analyzing ICFG ReachDef-Simple.bpl [2019-08-05 09:53:25,426 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 09:53:25,433 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 09:53:25,450 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 09:53:25,477 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 09:53:25,478 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 09:53:25,478 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 09:53:25,478 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 09:53:25,478 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 09:53:25,478 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 09:53:25,478 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 09:53:25,479 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 09:53:25,479 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 09:53:25,493 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 09:53:25,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 09:53:25,501 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:25,502 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 09:53:25,504 INFO L418 AbstractCegarLoop]: === Iteration 1 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:25,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:25,510 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-08-05 09:53:25,557 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:25,591 WARN L254 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 09:53:25,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:25,710 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 09:53:25,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:53:25,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 09:53:25,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 09:53:25,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 09:53:25,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 09:53:25,737 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 4 states. [2019-08-05 09:53:25,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:25,892 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 09:53:25,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 09:53:25,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-08-05 09:53:25,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:25,907 INFO L225 Difference]: With dead ends: 8 [2019-08-05 09:53:25,908 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 09:53:25,910 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 09:53:25,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 09:53:25,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 09:53:25,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 09:53:25,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 09:53:25,936 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 09:53:25,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:25,937 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 09:53:25,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 09:53:25,937 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 09:53:25,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 09:53:25,937 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:25,938 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 09:53:25,938 INFO L418 AbstractCegarLoop]: === Iteration 2 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:25,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:25,938 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2019-08-05 09:53:25,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:25,952 WARN L254 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 09:53:25,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:26,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:26,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:26,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 09:53:26,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 09:53:26,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 09:53:26,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 09:53:26,079 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2019-08-05 09:53:26,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:26,108 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 09:53:26,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 09:53:26,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-08-05 09:53:26,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:26,109 INFO L225 Difference]: With dead ends: 7 [2019-08-05 09:53:26,109 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 09:53:26,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 09:53:26,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 09:53:26,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 09:53:26,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 09:53:26,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 09:53:26,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 09:53:26,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:26,112 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 09:53:26,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 09:53:26,112 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 09:53:26,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 09:53:26,113 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:26,113 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 09:53:26,113 INFO L418 AbstractCegarLoop]: === Iteration 3 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:26,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:26,114 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2019-08-05 09:53:26,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:26,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:26,133 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 09:53:26,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:26,343 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 09:53:26,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:26,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 09:53:26,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 09:53:26,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 09:53:26,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 09:53:26,345 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2019-08-05 09:53:26,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:26,508 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 09:53:26,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 09:53:26,509 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-08-05 09:53:26,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:26,510 INFO L225 Difference]: With dead ends: 8 [2019-08-05 09:53:26,510 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 09:53:26,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 09:53:26,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 09:53:26,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 09:53:26,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 09:53:26,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 09:53:26,513 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 09:53:26,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:26,513 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 09:53:26,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 09:53:26,514 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 09:53:26,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 09:53:26,514 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:26,514 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 09:53:26,515 INFO L418 AbstractCegarLoop]: === Iteration 4 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:26,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:26,515 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2019-08-05 09:53:26,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:26,556 WARN L254 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 09:53:26,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:26,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:26,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:26,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 09:53:26,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 09:53:26,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 09:53:26,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 09:53:26,752 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2019-08-05 09:53:26,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:26,812 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 09:53:26,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 09:53:26,813 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 09:53:26,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:26,814 INFO L225 Difference]: With dead ends: 9 [2019-08-05 09:53:26,814 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 09:53:26,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 09:53:26,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 09:53:26,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 09:53:26,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 09:53:26,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 09:53:26,817 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 09:53:26,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:26,817 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 09:53:26,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 09:53:26,818 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 09:53:26,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 09:53:26,818 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:26,818 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 09:53:26,818 INFO L418 AbstractCegarLoop]: === Iteration 5 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:26,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:26,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2019-08-05 09:53:26,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:26,838 WARN L254 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 09:53:26,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:27,102 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:27,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:27,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 09:53:27,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 09:53:27,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 09:53:27,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 09:53:27,104 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2019-08-05 09:53:27,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:27,186 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 09:53:27,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 09:53:27,187 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-08-05 09:53:27,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:27,188 INFO L225 Difference]: With dead ends: 10 [2019-08-05 09:53:27,188 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 09:53:27,189 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 09:53:27,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 09:53:27,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 09:53:27,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 09:53:27,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 09:53:27,191 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 09:53:27,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:27,192 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 09:53:27,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 09:53:27,192 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 09:53:27,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 09:53:27,192 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:27,193 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 09:53:27,193 INFO L418 AbstractCegarLoop]: === Iteration 6 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:27,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:27,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2019-08-05 09:53:27,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:27,214 WARN L254 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 09:53:27,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:27,412 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 09:53:27,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:27,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 09:53:27,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 09:53:27,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 09:53:27,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 09:53:27,414 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2019-08-05 09:53:27,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:27,769 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 09:53:27,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 09:53:27,769 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-08-05 09:53:27,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:27,770 INFO L225 Difference]: With dead ends: 11 [2019-08-05 09:53:27,770 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 09:53:27,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 09:53:27,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 09:53:27,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 09:53:27,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 09:53:27,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 09:53:27,773 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 09:53:27,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:27,773 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 09:53:27,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 09:53:27,773 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 09:53:27,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 09:53:27,774 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:27,774 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 09:53:27,774 INFO L418 AbstractCegarLoop]: === Iteration 7 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:27,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:27,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2019-08-05 09:53:27,776 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:27,804 WARN L254 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 09:53:27,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:27,997 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:27,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:27,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 09:53:27,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 09:53:27,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 09:53:27,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 09:53:27,999 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2019-08-05 09:53:28,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:28,093 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 09:53:28,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 09:53:28,096 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-08-05 09:53:28,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:28,096 INFO L225 Difference]: With dead ends: 12 [2019-08-05 09:53:28,096 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 09:53:28,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 09:53:28,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 09:53:28,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 09:53:28,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 09:53:28,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 09:53:28,100 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 09:53:28,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:28,100 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 09:53:28,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 09:53:28,100 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 09:53:28,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 09:53:28,101 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:28,101 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 09:53:28,101 INFO L418 AbstractCegarLoop]: === Iteration 8 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:28,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:28,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820742, now seen corresponding path program 7 times [2019-08-05 09:53:28,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:28,123 WARN L254 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 09:53:28,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:28,334 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:28,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:28,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 09:53:28,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 09:53:28,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 09:53:28,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-08-05 09:53:28,336 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2019-08-05 09:53:28,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:28,471 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 09:53:28,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 09:53:28,471 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-08-05 09:53:28,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:28,472 INFO L225 Difference]: With dead ends: 13 [2019-08-05 09:53:28,472 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 09:53:28,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-08-05 09:53:28,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 09:53:28,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 09:53:28,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 09:53:28,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 09:53:28,475 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 09:53:28,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:28,475 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 09:53:28,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 09:53:28,475 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 09:53:28,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 09:53:28,476 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:28,476 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 09:53:28,476 INFO L418 AbstractCegarLoop]: === Iteration 9 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:28,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:28,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166496, now seen corresponding path program 8 times [2019-08-05 09:53:28,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:28,500 WARN L254 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 09:53:28,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:28,802 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:28,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:28,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 09:53:28,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 09:53:28,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 09:53:28,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-08-05 09:53:28,804 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2019-08-05 09:53:28,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:28,900 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 09:53:28,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 09:53:28,900 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2019-08-05 09:53:28,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:28,901 INFO L225 Difference]: With dead ends: 14 [2019-08-05 09:53:28,902 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 09:53:28,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-08-05 09:53:28,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 09:53:28,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 09:53:28,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 09:53:28,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 09:53:28,905 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 09:53:28,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:28,905 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 09:53:28,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 09:53:28,905 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 09:53:28,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 09:53:28,906 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:28,906 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 09:53:28,906 INFO L418 AbstractCegarLoop]: === Iteration 10 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:28,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:28,907 INFO L82 PathProgramCache]: Analyzing trace with hash -562523066, now seen corresponding path program 9 times [2019-08-05 09:53:28,907 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:28,928 WARN L254 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 09:53:28,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:29,098 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 09:53:29,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:29,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 09:53:29,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 09:53:29,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 09:53:29,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-08-05 09:53:29,100 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2019-08-05 09:53:29,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:29,213 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 09:53:29,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 09:53:29,214 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2019-08-05 09:53:29,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:29,215 INFO L225 Difference]: With dead ends: 15 [2019-08-05 09:53:29,215 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 09:53:29,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-08-05 09:53:29,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 09:53:29,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 09:53:29,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 09:53:29,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 09:53:29,219 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 09:53:29,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:29,219 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 09:53:29,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 09:53:29,219 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 09:53:29,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 09:53:29,220 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:29,220 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 09:53:29,220 INFO L418 AbstractCegarLoop]: === Iteration 11 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:29,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:29,220 INFO L82 PathProgramCache]: Analyzing trace with hash -258347808, now seen corresponding path program 10 times [2019-08-05 09:53:29,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:29,241 WARN L254 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 09:53:29,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:30,062 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:30,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:30,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 09:53:30,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 09:53:30,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 09:53:30,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-08-05 09:53:30,064 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2019-08-05 09:53:30,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:30,193 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 09:53:30,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 09:53:30,193 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2019-08-05 09:53:30,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:30,194 INFO L225 Difference]: With dead ends: 16 [2019-08-05 09:53:30,195 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 09:53:30,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-08-05 09:53:30,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 09:53:30,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 09:53:30,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 09:53:30,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 09:53:30,199 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 09:53:30,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:30,200 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 09:53:30,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 09:53:30,200 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 09:53:30,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 09:53:30,200 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:30,200 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 09:53:30,201 INFO L418 AbstractCegarLoop]: === Iteration 12 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:30,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:30,201 INFO L82 PathProgramCache]: Analyzing trace with hash 581150598, now seen corresponding path program 11 times [2019-08-05 09:53:30,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:30,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:30,223 WARN L254 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 09:53:30,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:30,610 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:30,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:30,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 09:53:30,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 09:53:30,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 09:53:30,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-08-05 09:53:30,612 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2019-08-05 09:53:30,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:30,762 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 09:53:30,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 09:53:30,763 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2019-08-05 09:53:30,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:30,764 INFO L225 Difference]: With dead ends: 17 [2019-08-05 09:53:30,764 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 09:53:30,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-08-05 09:53:30,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 09:53:30,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 09:53:30,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 09:53:30,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 09:53:30,768 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 09:53:30,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:30,768 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 09:53:30,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 09:53:30,769 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 09:53:30,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 09:53:30,769 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:30,769 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 09:53:30,770 INFO L418 AbstractCegarLoop]: === Iteration 13 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:30,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:30,770 INFO L82 PathProgramCache]: Analyzing trace with hash 835797408, now seen corresponding path program 12 times [2019-08-05 09:53:30,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:30,793 WARN L254 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 09:53:30,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:30,994 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:30,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:30,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 09:53:30,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 09:53:30,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 09:53:30,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2019-08-05 09:53:30,997 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2019-08-05 09:53:31,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:31,331 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 09:53:31,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 09:53:31,332 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2019-08-05 09:53:31,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:31,333 INFO L225 Difference]: With dead ends: 18 [2019-08-05 09:53:31,333 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 09:53:31,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2019-08-05 09:53:31,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 09:53:31,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 09:53:31,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 09:53:31,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 09:53:31,339 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 09:53:31,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:31,339 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 09:53:31,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 09:53:31,340 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 09:53:31,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 09:53:31,340 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:31,340 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 09:53:31,341 INFO L418 AbstractCegarLoop]: === Iteration 14 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:31,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:31,341 INFO L82 PathProgramCache]: Analyzing trace with hash 139913926, now seen corresponding path program 13 times [2019-08-05 09:53:31,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:31,363 WARN L254 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 09:53:31,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:31,604 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:31,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:31,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 09:53:31,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 09:53:31,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 09:53:31,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2019-08-05 09:53:31,606 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2019-08-05 09:53:31,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:31,908 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 09:53:31,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 09:53:31,909 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-08-05 09:53:31,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:31,909 INFO L225 Difference]: With dead ends: 19 [2019-08-05 09:53:31,909 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 09:53:31,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2019-08-05 09:53:31,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 09:53:31,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 09:53:31,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 09:53:31,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 09:53:31,913 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 09:53:31,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:31,913 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 09:53:31,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 09:53:31,913 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 09:53:31,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 09:53:31,914 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:31,914 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 09:53:31,914 INFO L418 AbstractCegarLoop]: === Iteration 15 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:31,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:31,915 INFO L82 PathProgramCache]: Analyzing trace with hash 42362464, now seen corresponding path program 14 times [2019-08-05 09:53:31,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:31,946 WARN L254 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 09:53:31,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:32,207 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-08-05 09:53:32,515 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:32,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:32,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 09:53:32,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 09:53:32,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 09:53:32,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2019-08-05 09:53:32,517 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2019-08-05 09:53:32,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:32,705 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 09:53:32,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 09:53:32,706 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2019-08-05 09:53:32,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:32,707 INFO L225 Difference]: With dead ends: 20 [2019-08-05 09:53:32,707 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 09:53:32,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2019-08-05 09:53:32,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 09:53:32,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 09:53:32,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 09:53:32,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 09:53:32,711 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 09:53:32,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:32,711 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 09:53:32,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 09:53:32,712 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 09:53:32,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 09:53:32,712 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:32,712 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 09:53:32,712 INFO L418 AbstractCegarLoop]: === Iteration 16 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:32,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:32,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234438, now seen corresponding path program 15 times [2019-08-05 09:53:32,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:32,732 WARN L254 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 09:53:32,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:33,067 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:33,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:33,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 09:53:33,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 09:53:33,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 09:53:33,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2019-08-05 09:53:33,069 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2019-08-05 09:53:33,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:33,332 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 09:53:33,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 09:53:33,333 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2019-08-05 09:53:33,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:33,334 INFO L225 Difference]: With dead ends: 21 [2019-08-05 09:53:33,334 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 09:53:33,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2019-08-05 09:53:33,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 09:53:33,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 09:53:33,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 09:53:33,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 09:53:33,337 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 09:53:33,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:33,337 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 09:53:33,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 09:53:33,337 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 09:53:33,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 09:53:33,338 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:33,338 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 09:53:33,338 INFO L418 AbstractCegarLoop]: === Iteration 17 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:33,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:33,339 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559968, now seen corresponding path program 16 times [2019-08-05 09:53:33,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:33,359 WARN L254 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 09:53:33,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:33,621 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:33,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:33,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 09:53:33,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 09:53:33,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 09:53:33,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2019-08-05 09:53:33,623 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2019-08-05 09:53:33,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:33,900 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 09:53:33,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 09:53:33,900 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-08-05 09:53:33,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:33,901 INFO L225 Difference]: With dead ends: 22 [2019-08-05 09:53:33,901 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 09:53:33,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2019-08-05 09:53:33,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 09:53:33,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 09:53:33,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 09:53:33,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 09:53:33,905 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 09:53:33,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:33,905 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 09:53:33,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 09:53:33,906 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 09:53:33,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 09:53:33,906 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:33,906 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 09:53:33,906 INFO L418 AbstractCegarLoop]: === Iteration 18 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:33,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:33,907 INFO L82 PathProgramCache]: Analyzing trace with hash -702152378, now seen corresponding path program 17 times [2019-08-05 09:53:33,907 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:33,925 WARN L254 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 09:53:33,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:34,214 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:34,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:34,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 09:53:34,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 09:53:34,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 09:53:34,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2019-08-05 09:53:34,217 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2019-08-05 09:53:34,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:34,586 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 09:53:34,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 09:53:34,587 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-08-05 09:53:34,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:34,588 INFO L225 Difference]: With dead ends: 23 [2019-08-05 09:53:34,588 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 09:53:34,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2019-08-05 09:53:34,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 09:53:34,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 09:53:34,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 09:53:34,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 09:53:34,592 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 09:53:34,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:34,593 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 09:53:34,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 09:53:34,593 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 09:53:34,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 09:53:34,593 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:34,594 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 09:53:34,594 INFO L418 AbstractCegarLoop]: === Iteration 19 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:34,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:34,594 INFO L82 PathProgramCache]: Analyzing trace with hash -291889184, now seen corresponding path program 18 times [2019-08-05 09:53:34,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:34,613 WARN L254 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 09:53:34,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:34,928 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:34,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:34,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 09:53:34,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 09:53:34,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 09:53:34,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2019-08-05 09:53:34,931 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2019-08-05 09:53:35,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:35,310 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 09:53:35,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 09:53:35,311 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-08-05 09:53:35,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:35,312 INFO L225 Difference]: With dead ends: 24 [2019-08-05 09:53:35,312 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 09:53:35,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2019-08-05 09:53:35,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 09:53:35,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 09:53:35,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 09:53:35,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 09:53:35,317 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 09:53:35,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:35,318 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 09:53:35,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 09:53:35,318 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 09:53:35,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 09:53:35,319 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:35,319 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 09:53:35,319 INFO L418 AbstractCegarLoop]: === Iteration 20 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:35,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:35,320 INFO L82 PathProgramCache]: Analyzing trace with hash -458632058, now seen corresponding path program 19 times [2019-08-05 09:53:35,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:35,353 WARN L254 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 09:53:35,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:35,785 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:35,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:35,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 09:53:35,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 09:53:35,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 09:53:35,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2019-08-05 09:53:35,788 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2019-08-05 09:53:36,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:36,105 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 09:53:36,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 09:53:36,105 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2019-08-05 09:53:36,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:36,106 INFO L225 Difference]: With dead ends: 25 [2019-08-05 09:53:36,107 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 09:53:36,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2019-08-05 09:53:36,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 09:53:36,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 09:53:36,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 09:53:36,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 09:53:36,112 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 09:53:36,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:36,112 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 09:53:36,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 09:53:36,112 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 09:53:36,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 09:53:36,113 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:36,113 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 09:53:36,113 INFO L418 AbstractCegarLoop]: === Iteration 21 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:36,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:36,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693856, now seen corresponding path program 20 times [2019-08-05 09:53:36,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:36,133 WARN L254 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 09:53:36,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:36,476 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:36,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:36,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 09:53:36,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 09:53:36,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 09:53:36,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2019-08-05 09:53:36,477 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2019-08-05 09:53:36,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:36,916 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 09:53:36,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 09:53:36,926 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-08-05 09:53:36,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:36,926 INFO L225 Difference]: With dead ends: 26 [2019-08-05 09:53:36,926 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 09:53:36,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2019-08-05 09:53:36,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 09:53:36,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 09:53:36,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 09:53:36,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 09:53:36,929 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 09:53:36,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:36,930 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 09:53:36,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 09:53:36,930 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 09:53:36,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 09:53:36,931 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:36,931 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 09:53:36,931 INFO L418 AbstractCegarLoop]: === Iteration 22 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:36,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:36,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161478, now seen corresponding path program 21 times [2019-08-05 09:53:36,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:36,953 WARN L254 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 09:53:36,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:37,660 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:37,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:37,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 09:53:37,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 09:53:37,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 09:53:37,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2019-08-05 09:53:37,662 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2019-08-05 09:53:38,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:38,777 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 09:53:38,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 09:53:38,779 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-08-05 09:53:38,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:38,780 INFO L225 Difference]: With dead ends: 27 [2019-08-05 09:53:38,780 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 09:53:38,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2019-08-05 09:53:38,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 09:53:38,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 09:53:38,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 09:53:38,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 09:53:38,784 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 09:53:38,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:38,788 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 09:53:38,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 09:53:38,789 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 09:53:38,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 09:53:38,789 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:38,789 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 09:53:38,790 INFO L418 AbstractCegarLoop]: === Iteration 23 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:38,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:38,790 INFO L82 PathProgramCache]: Analyzing trace with hash -818603680, now seen corresponding path program 22 times [2019-08-05 09:53:38,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:38,813 WARN L254 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 09:53:38,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:39,345 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:39,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:39,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 09:53:39,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 09:53:39,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 09:53:39,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2019-08-05 09:53:39,347 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2019-08-05 09:53:39,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:39,863 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 09:53:39,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 09:53:39,864 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-05 09:53:39,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:39,864 INFO L225 Difference]: With dead ends: 28 [2019-08-05 09:53:39,865 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 09:53:39,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2019-08-05 09:53:39,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 09:53:39,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 09:53:39,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 09:53:39,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 09:53:39,869 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 09:53:39,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:39,870 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 09:53:39,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 09:53:39,870 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 09:53:39,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 09:53:39,871 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:39,871 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 09:53:39,871 INFO L418 AbstractCegarLoop]: === Iteration 24 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:39,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:39,871 INFO L82 PathProgramCache]: Analyzing trace with hash 393087750, now seen corresponding path program 23 times [2019-08-05 09:53:39,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:39,894 WARN L254 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 09:53:39,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:40,405 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:40,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:40,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 09:53:40,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 09:53:40,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 09:53:40,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2019-08-05 09:53:40,407 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2019-08-05 09:53:41,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:41,067 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 09:53:41,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 09:53:41,068 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2019-08-05 09:53:41,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:41,068 INFO L225 Difference]: With dead ends: 29 [2019-08-05 09:53:41,068 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 09:53:41,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2019-08-05 09:53:41,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 09:53:41,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 09:53:41,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 09:53:41,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 09:53:41,073 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 09:53:41,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:41,073 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 09:53:41,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 09:53:41,073 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 09:53:41,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 09:53:41,074 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:41,074 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 09:53:41,074 INFO L418 AbstractCegarLoop]: === Iteration 25 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:41,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:41,075 INFO L82 PathProgramCache]: Analyzing trace with hash -699183584, now seen corresponding path program 24 times [2019-08-05 09:53:41,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:41,097 WARN L254 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 09:53:41,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:41,694 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:41,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:41,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 09:53:41,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 09:53:41,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 09:53:41,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2019-08-05 09:53:41,696 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2019-08-05 09:53:42,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:42,280 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 09:53:42,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 09:53:42,280 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2019-08-05 09:53:42,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:42,281 INFO L225 Difference]: With dead ends: 30 [2019-08-05 09:53:42,281 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 09:53:42,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2019-08-05 09:53:42,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 09:53:42,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 09:53:42,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 09:53:42,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 09:53:42,284 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 09:53:42,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:42,284 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 09:53:42,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 09:53:42,284 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 09:53:42,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 09:53:42,285 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:42,285 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 09:53:42,285 INFO L418 AbstractCegarLoop]: === Iteration 26 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:42,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:42,286 INFO L82 PathProgramCache]: Analyzing trace with hash -199856570, now seen corresponding path program 25 times [2019-08-05 09:53:42,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:42,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:42,310 WARN L254 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 09:53:42,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:42,817 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:42,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:42,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 09:53:42,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 09:53:42,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 09:53:42,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2019-08-05 09:53:42,819 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2019-08-05 09:53:43,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:43,331 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 09:53:43,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 09:53:43,331 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2019-08-05 09:53:43,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:43,332 INFO L225 Difference]: With dead ends: 31 [2019-08-05 09:53:43,332 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 09:53:43,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2019-08-05 09:53:43,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 09:53:43,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 09:53:43,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 09:53:43,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 09:53:43,336 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 09:53:43,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:43,336 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 09:53:43,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 09:53:43,336 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 09:53:43,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 09:53:43,337 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:43,337 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 09:53:43,337 INFO L418 AbstractCegarLoop]: === Iteration 27 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:43,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:43,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588320, now seen corresponding path program 26 times [2019-08-05 09:53:43,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:43,366 WARN L254 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 09:53:43,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:44,949 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:44,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:44,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 09:53:44,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 09:53:44,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 09:53:44,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2019-08-05 09:53:44,951 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2019-08-05 09:53:45,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:45,487 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 09:53:45,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 09:53:45,488 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2019-08-05 09:53:45,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:45,489 INFO L225 Difference]: With dead ends: 32 [2019-08-05 09:53:45,489 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 09:53:45,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2019-08-05 09:53:45,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 09:53:45,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 09:53:45,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 09:53:45,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 09:53:45,493 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 09:53:45,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:45,494 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 09:53:45,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 09:53:45,494 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 09:53:45,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 09:53:45,494 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:45,494 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 09:53:45,495 INFO L418 AbstractCegarLoop]: === Iteration 28 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:45,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:45,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302278, now seen corresponding path program 27 times [2019-08-05 09:53:45,496 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:45,521 WARN L254 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 09:53:45,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:46,041 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:46,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:46,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 09:53:46,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 09:53:46,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 09:53:46,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2019-08-05 09:53:46,044 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2019-08-05 09:53:46,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:46,646 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 09:53:46,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 09:53:46,646 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2019-08-05 09:53:46,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:46,647 INFO L225 Difference]: With dead ends: 33 [2019-08-05 09:53:46,647 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 09:53:46,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2019-08-05 09:53:46,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 09:53:46,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 09:53:46,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 09:53:46,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 09:53:46,652 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 09:53:46,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:46,652 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 09:53:46,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 09:53:46,652 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 09:53:46,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 09:53:46,653 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:46,653 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 09:53:46,653 INFO L418 AbstractCegarLoop]: === Iteration 29 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:46,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:46,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1104336992, now seen corresponding path program 28 times [2019-08-05 09:53:46,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:46,682 WARN L254 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 119 conjunts are in the unsatisfiable core [2019-08-05 09:53:46,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:47,842 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:47,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:47,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 09:53:47,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 09:53:47,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 09:53:47,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2019-08-05 09:53:47,844 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2019-08-05 09:53:48,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:48,480 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 09:53:48,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 09:53:48,480 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2019-08-05 09:53:48,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:48,481 INFO L225 Difference]: With dead ends: 34 [2019-08-05 09:53:48,481 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 09:53:48,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2019-08-05 09:53:48,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 09:53:48,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 09:53:48,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 09:53:48,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 09:53:48,485 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 09:53:48,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:48,485 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 09:53:48,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 09:53:48,486 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 09:53:48,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 09:53:48,486 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:48,486 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 09:53:48,487 INFO L418 AbstractCegarLoop]: === Iteration 30 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:48,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:48,487 INFO L82 PathProgramCache]: Analyzing trace with hash 125289670, now seen corresponding path program 29 times [2019-08-05 09:53:48,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:48,516 WARN L254 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 123 conjunts are in the unsatisfiable core [2019-08-05 09:53:48,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:50,501 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:50,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:50,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 09:53:50,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 09:53:50,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 09:53:50,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 09:53:50,503 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2019-08-05 09:53:51,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:51,213 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 09:53:51,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 09:53:51,214 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2019-08-05 09:53:51,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:51,215 INFO L225 Difference]: With dead ends: 35 [2019-08-05 09:53:51,215 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 09:53:51,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 09:53:51,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 09:53:51,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 09:53:51,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 09:53:51,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 09:53:51,218 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 09:53:51,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:51,219 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 09:53:51,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 09:53:51,219 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 09:53:51,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 09:53:51,219 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:51,220 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 09:53:51,220 INFO L418 AbstractCegarLoop]: === Iteration 31 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:51,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:51,220 INFO L82 PathProgramCache]: Analyzing trace with hash -410989472, now seen corresponding path program 30 times [2019-08-05 09:53:51,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:51,249 WARN L254 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 127 conjunts are in the unsatisfiable core [2019-08-05 09:53:51,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:52,181 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:52,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:52,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 09:53:52,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 09:53:52,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 09:53:52,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 09:53:52,182 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2019-08-05 09:53:53,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:53,028 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 09:53:53,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 09:53:53,029 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2019-08-05 09:53:53,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:53,030 INFO L225 Difference]: With dead ends: 36 [2019-08-05 09:53:53,030 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 09:53:53,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 09:53:53,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 09:53:53,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 09:53:53,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 09:53:53,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 09:53:53,033 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 09:53:53,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:53,033 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 09:53:53,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 09:53:53,033 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 09:53:53,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 09:53:53,033 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:53,034 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 09:53:53,034 INFO L418 AbstractCegarLoop]: === Iteration 32 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:53,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:53,034 INFO L82 PathProgramCache]: Analyzing trace with hash 144226310, now seen corresponding path program 31 times [2019-08-05 09:53:53,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:53,066 WARN L254 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 131 conjunts are in the unsatisfiable core [2019-08-05 09:53:53,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:53,806 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:53,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:53,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 09:53:53,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 09:53:53,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 09:53:53,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 09:53:53,808 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2019-08-05 09:53:54,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:54,559 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 09:53:54,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 09:53:54,559 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2019-08-05 09:53:54,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:54,560 INFO L225 Difference]: With dead ends: 37 [2019-08-05 09:53:54,560 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 09:53:54,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 09:53:54,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 09:53:54,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 09:53:54,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 09:53:54,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 09:53:54,564 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 09:53:54,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:54,564 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 09:53:54,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 09:53:54,564 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 09:53:54,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 09:53:54,565 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:54,565 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 09:53:54,565 INFO L418 AbstractCegarLoop]: === Iteration 33 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:54,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:54,565 INFO L82 PathProgramCache]: Analyzing trace with hash 176046368, now seen corresponding path program 32 times [2019-08-05 09:53:54,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:54,598 WARN L254 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 135 conjunts are in the unsatisfiable core [2019-08-05 09:53:54,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:55,377 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:55,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:55,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 09:53:55,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 09:53:55,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 09:53:55,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 09:53:55,379 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2019-08-05 09:53:56,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:56,157 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 09:53:56,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 09:53:56,158 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2019-08-05 09:53:56,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:56,159 INFO L225 Difference]: With dead ends: 38 [2019-08-05 09:53:56,159 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 09:53:56,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 09:53:56,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 09:53:56,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 09:53:56,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 09:53:56,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 09:53:56,163 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 09:53:56,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:56,163 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 09:53:56,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 09:53:56,163 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 09:53:56,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 09:53:56,164 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:56,164 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 09:53:56,164 INFO L418 AbstractCegarLoop]: === Iteration 34 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:56,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:56,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468166, now seen corresponding path program 33 times [2019-08-05 09:53:56,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:56,200 WARN L254 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 139 conjunts are in the unsatisfiable core [2019-08-05 09:53:56,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:56,837 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:56,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:56,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 09:53:56,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 09:53:56,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 09:53:56,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 09:53:56,839 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2019-08-05 09:53:57,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:57,843 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 09:53:57,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 09:53:57,843 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2019-08-05 09:53:57,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:57,844 INFO L225 Difference]: With dead ends: 39 [2019-08-05 09:53:57,844 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 09:53:57,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 09:53:57,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 09:53:57,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 09:53:57,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 09:53:57,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 09:53:57,847 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 09:53:57,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:57,848 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 09:53:57,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 09:53:57,848 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 09:53:57,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 09:53:57,848 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:57,848 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 09:53:57,848 INFO L418 AbstractCegarLoop]: === Iteration 35 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:57,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:57,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772832, now seen corresponding path program 34 times [2019-08-05 09:53:57,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:57,886 WARN L254 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 143 conjunts are in the unsatisfiable core [2019-08-05 09:53:57,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:58,681 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:58,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:58,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 09:53:58,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 09:53:58,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 09:53:58,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 09:53:58,683 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2019-08-05 09:53:59,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:59,555 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 09:53:59,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 09:53:59,561 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2019-08-05 09:53:59,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:59,561 INFO L225 Difference]: With dead ends: 40 [2019-08-05 09:53:59,561 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 09:53:59,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 09:53:59,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 09:53:59,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 09:53:59,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 09:53:59,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 09:53:59,564 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 09:53:59,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:59,564 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 09:53:59,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 09:53:59,564 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 09:53:59,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 09:53:59,564 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:59,565 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 09:53:59,565 INFO L418 AbstractCegarLoop]: === Iteration 36 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:59,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:59,565 INFO L82 PathProgramCache]: Analyzing trace with hash 440348294, now seen corresponding path program 35 times [2019-08-05 09:53:59,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:59,602 WARN L254 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 147 conjunts are in the unsatisfiable core [2019-08-05 09:53:59,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:00,383 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 09:54:00,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:00,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 09:54:00,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 09:54:00,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 09:54:00,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=1406, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 09:54:00,384 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2019-08-05 09:54:01,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:01,285 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 09:54:01,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 09:54:01,285 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2019-08-05 09:54:01,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:01,286 INFO L225 Difference]: With dead ends: 41 [2019-08-05 09:54:01,286 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 09:54:01,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=76, Invalid=1406, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 09:54:01,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 09:54:01,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 09:54:01,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 09:54:01,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 09:54:01,289 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 09:54:01,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:01,290 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 09:54:01,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 09:54:01,290 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 09:54:01,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 09:54:01,290 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:01,290 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 09:54:01,291 INFO L418 AbstractCegarLoop]: === Iteration 37 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:01,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:01,291 INFO L82 PathProgramCache]: Analyzing trace with hash 765893280, now seen corresponding path program 36 times [2019-08-05 09:54:01,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:01,324 WARN L254 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 151 conjunts are in the unsatisfiable core [2019-08-05 09:54:01,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:02,121 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:54:02,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:02,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 09:54:02,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 09:54:02,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 09:54:02,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 09:54:02,123 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2019-08-05 09:54:03,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:03,299 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 09:54:03,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 09:54:03,301 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2019-08-05 09:54:03,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:03,301 INFO L225 Difference]: With dead ends: 42 [2019-08-05 09:54:03,301 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 09:54:03,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 09:54:03,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 09:54:03,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 09:54:03,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 09:54:03,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 09:54:03,304 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 09:54:03,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:03,304 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 09:54:03,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 09:54:03,305 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 09:54:03,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 09:54:03,305 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:03,305 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 09:54:03,306 INFO L418 AbstractCegarLoop]: === Iteration 38 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:03,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:03,306 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114042, now seen corresponding path program 37 times [2019-08-05 09:54:03,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:03,349 WARN L254 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 155 conjunts are in the unsatisfiable core [2019-08-05 09:54:03,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:04,129 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:54:04,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:04,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 09:54:04,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 09:54:04,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 09:54:04,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1560, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 09:54:04,131 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2019-08-05 09:54:05,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:05,134 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 09:54:05,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 09:54:05,134 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2019-08-05 09:54:05,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:05,135 INFO L225 Difference]: With dead ends: 43 [2019-08-05 09:54:05,135 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 09:54:05,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=80, Invalid=1560, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 09:54:05,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 09:54:05,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 09:54:05,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 09:54:05,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 09:54:05,139 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 09:54:05,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:05,139 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 09:54:05,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 09:54:05,139 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 09:54:05,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 09:54:05,140 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:05,140 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 09:54:05,140 INFO L418 AbstractCegarLoop]: === Iteration 39 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:05,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:05,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972192, now seen corresponding path program 38 times [2019-08-05 09:54:05,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:05,185 WARN L254 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 159 conjunts are in the unsatisfiable core [2019-08-05 09:54:05,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:06,020 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:54:06,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:06,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 09:54:06,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 09:54:06,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 09:54:06,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1640, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 09:54:06,021 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2019-08-05 09:54:07,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:07,121 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 09:54:07,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 09:54:07,122 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2019-08-05 09:54:07,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:07,123 INFO L225 Difference]: With dead ends: 44 [2019-08-05 09:54:07,123 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 09:54:07,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=82, Invalid=1640, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 09:54:07,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 09:54:07,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 09:54:07,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 09:54:07,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 09:54:07,126 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 09:54:07,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:07,127 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 09:54:07,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 09:54:07,127 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 09:54:07,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 09:54:07,127 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:07,127 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 09:54:07,128 INFO L418 AbstractCegarLoop]: === Iteration 40 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:07,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:07,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495750, now seen corresponding path program 39 times [2019-08-05 09:54:07,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:07,165 WARN L254 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 163 conjunts are in the unsatisfiable core [2019-08-05 09:54:07,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:08,407 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:54:08,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:08,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 09:54:08,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 09:54:08,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 09:54:08,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1722, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 09:54:08,409 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2019-08-05 09:54:09,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:09,567 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 09:54:09,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 09:54:09,568 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2019-08-05 09:54:09,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:09,569 INFO L225 Difference]: With dead ends: 45 [2019-08-05 09:54:09,569 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 09:54:09,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=84, Invalid=1722, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 09:54:09,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 09:54:09,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 09:54:09,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 09:54:09,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 09:54:09,572 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 09:54:09,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:09,572 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 09:54:09,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 09:54:09,572 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 09:54:09,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 09:54:09,573 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:09,573 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 09:54:09,573 INFO L418 AbstractCegarLoop]: === Iteration 41 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:09,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:09,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791456, now seen corresponding path program 40 times [2019-08-05 09:54:09,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:09,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:09,630 WARN L254 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 167 conjunts are in the unsatisfiable core [2019-08-05 09:54:09,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:10,658 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:54:10,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:10,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 09:54:10,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 09:54:10,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 09:54:10,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 09:54:10,659 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2019-08-05 09:54:11,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:11,894 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 09:54:11,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 09:54:11,895 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2019-08-05 09:54:11,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:11,896 INFO L225 Difference]: With dead ends: 46 [2019-08-05 09:54:11,896 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 09:54:11,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 09:54:11,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 09:54:11,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 09:54:11,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 09:54:11,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 09:54:11,899 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 09:54:11,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:11,899 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 09:54:11,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 09:54:11,899 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 09:54:11,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 09:54:11,900 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:11,900 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 09:54:11,900 INFO L418 AbstractCegarLoop]: === Iteration 42 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:11,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:11,900 INFO L82 PathProgramCache]: Analyzing trace with hash -692041658, now seen corresponding path program 41 times [2019-08-05 09:54:11,901 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:11,953 WARN L254 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 171 conjunts are in the unsatisfiable core [2019-08-05 09:54:11,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:13,278 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:54:13,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:13,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 09:54:13,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 09:54:13,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 09:54:13,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1892, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 09:54:13,280 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2019-08-05 09:54:14,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:14,525 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 09:54:14,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 09:54:14,525 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2019-08-05 09:54:14,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:14,526 INFO L225 Difference]: With dead ends: 47 [2019-08-05 09:54:14,526 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 09:54:14,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=88, Invalid=1892, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 09:54:14,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 09:54:14,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 09:54:14,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 09:54:14,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 09:54:14,529 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 09:54:14,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:14,530 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 09:54:14,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 09:54:14,530 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 09:54:14,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 09:54:14,530 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:14,531 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 09:54:14,531 INFO L418 AbstractCegarLoop]: === Iteration 43 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:14,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:14,531 INFO L82 PathProgramCache]: Analyzing trace with hash 21543136, now seen corresponding path program 42 times [2019-08-05 09:54:14,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:14,589 WARN L254 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 175 conjunts are in the unsatisfiable core [2019-08-05 09:54:14,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:15,512 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:54:15,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:15,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 09:54:15,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 09:54:15,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 09:54:15,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1980, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 09:54:15,514 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2019-08-05 09:54:16,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:16,782 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 09:54:16,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 09:54:16,782 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2019-08-05 09:54:16,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:16,783 INFO L225 Difference]: With dead ends: 48 [2019-08-05 09:54:16,783 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 09:54:16,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=90, Invalid=1980, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 09:54:16,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 09:54:16,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 09:54:16,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 09:54:16,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 09:54:16,786 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 09:54:16,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:16,786 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 09:54:16,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 09:54:16,787 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 09:54:16,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 09:54:16,787 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:16,787 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 09:54:16,787 INFO L418 AbstractCegarLoop]: === Iteration 44 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:16,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:16,788 INFO L82 PathProgramCache]: Analyzing trace with hash 667835270, now seen corresponding path program 43 times [2019-08-05 09:54:16,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:16,834 WARN L254 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 179 conjunts are in the unsatisfiable core [2019-08-05 09:54:16,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:17,785 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:54:17,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:17,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 09:54:17,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 09:54:17,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 09:54:17,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=2070, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 09:54:17,786 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2019-08-05 09:54:19,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:19,299 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 09:54:19,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 09:54:19,301 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2019-08-05 09:54:19,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:19,301 INFO L225 Difference]: With dead ends: 49 [2019-08-05 09:54:19,302 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 09:54:19,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=92, Invalid=2070, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 09:54:19,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 09:54:19,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 09:54:19,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 09:54:19,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 09:54:19,304 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 09:54:19,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:19,304 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 09:54:19,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 09:54:19,304 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 09:54:19,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 09:54:19,304 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:19,305 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 09:54:19,305 INFO L418 AbstractCegarLoop]: === Iteration 45 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:19,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:19,305 INFO L82 PathProgramCache]: Analyzing trace with hash -771945056, now seen corresponding path program 44 times [2019-08-05 09:54:19,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:19,354 WARN L254 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 183 conjunts are in the unsatisfiable core [2019-08-05 09:54:19,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:20,658 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:54:20,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:20,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 09:54:20,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 09:54:20,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 09:54:20,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=2162, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 09:54:20,659 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2019-08-05 09:54:22,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:22,075 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 09:54:22,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 09:54:22,075 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2019-08-05 09:54:22,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:22,076 INFO L225 Difference]: With dead ends: 50 [2019-08-05 09:54:22,076 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 09:54:22,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=94, Invalid=2162, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 09:54:22,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 09:54:22,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 09:54:22,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 09:54:22,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 09:54:22,079 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 09:54:22,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:22,079 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 09:54:22,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 09:54:22,080 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 09:54:22,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 09:54:22,080 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:22,080 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 09:54:22,080 INFO L418 AbstractCegarLoop]: === Iteration 46 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:22,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:22,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505094, now seen corresponding path program 45 times [2019-08-05 09:54:22,081 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:22,140 WARN L254 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 187 conjunts are in the unsatisfiable core [2019-08-05 09:54:22,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:23,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:54:23,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:23,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 09:54:23,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 09:54:23,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 09:54:23,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=2256, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 09:54:23,512 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2019-08-05 09:54:24,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:24,975 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 09:54:24,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 09:54:24,976 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2019-08-05 09:54:24,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:24,977 INFO L225 Difference]: With dead ends: 51 [2019-08-05 09:54:24,977 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 09:54:24,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=96, Invalid=2256, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 09:54:24,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 09:54:24,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 09:54:24,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 09:54:24,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 09:54:24,979 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 09:54:24,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:24,980 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 09:54:24,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 09:54:24,980 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 09:54:24,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 09:54:24,981 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:24,981 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 09:54:24,981 INFO L418 AbstractCegarLoop]: === Iteration 47 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:24,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:24,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081120, now seen corresponding path program 46 times [2019-08-05 09:54:24,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:25,043 WARN L254 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 191 conjunts are in the unsatisfiable core [2019-08-05 09:54:25,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:26,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:54:26,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:26,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 09:54:26,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 09:54:26,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 09:54:26,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=2352, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 09:54:26,132 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2019-08-05 09:54:27,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:27,666 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 09:54:27,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 09:54:27,666 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2019-08-05 09:54:27,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:27,667 INFO L225 Difference]: With dead ends: 52 [2019-08-05 09:54:27,667 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 09:54:27,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=98, Invalid=2352, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 09:54:27,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 09:54:27,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 09:54:27,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 09:54:27,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 09:54:27,670 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 09:54:27,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:27,670 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 09:54:27,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 09:54:27,670 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 09:54:27,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 09:54:27,671 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:27,671 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 09:54:27,671 INFO L418 AbstractCegarLoop]: === Iteration 48 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:27,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:27,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192890, now seen corresponding path program 47 times [2019-08-05 09:54:27,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:27,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:27,717 WARN L254 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 195 conjunts are in the unsatisfiable core [2019-08-05 09:54:27,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:29,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:54:29,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:29,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 09:54:29,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 09:54:29,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 09:54:29,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=2450, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 09:54:29,099 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2019-08-05 09:54:30,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:30,746 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 09:54:30,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 09:54:30,747 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2019-08-05 09:54:30,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:30,748 INFO L225 Difference]: With dead ends: 53 [2019-08-05 09:54:30,748 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 09:54:30,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=100, Invalid=2450, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 09:54:30,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 09:54:30,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 09:54:30,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 09:54:30,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 09:54:30,751 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 09:54:30,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:30,751 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 09:54:30,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 09:54:30,752 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 09:54:30,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 09:54:30,752 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:30,752 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 09:54:30,752 INFO L418 AbstractCegarLoop]: === Iteration 49 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:30,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:30,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593312, now seen corresponding path program 48 times [2019-08-05 09:54:30,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:30,825 WARN L254 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 199 conjunts are in the unsatisfiable core [2019-08-05 09:54:30,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:32,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:54:32,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:32,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 09:54:32,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 09:54:32,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 09:54:32,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=2550, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 09:54:32,026 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2019-08-05 09:54:33,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:33,840 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 09:54:33,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 09:54:33,840 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2019-08-05 09:54:33,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:33,841 INFO L225 Difference]: With dead ends: 54 [2019-08-05 09:54:33,841 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 09:54:33,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=102, Invalid=2550, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 09:54:33,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 09:54:33,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 09:54:33,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 09:54:33,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 09:54:33,844 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 09:54:33,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:33,844 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 09:54:33,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 09:54:33,845 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 09:54:33,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 09:54:33,845 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:33,845 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 09:54:33,845 INFO L418 AbstractCegarLoop]: === Iteration 50 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:33,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:33,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1250314938, now seen corresponding path program 49 times [2019-08-05 09:54:33,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:33,924 WARN L254 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 203 conjunts are in the unsatisfiable core [2019-08-05 09:54:33,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:35,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:54:35,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:35,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 09:54:35,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 09:54:35,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 09:54:35,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=2652, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 09:54:35,161 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2019-08-05 09:54:36,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:36,862 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 09:54:36,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 09:54:36,862 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2019-08-05 09:54:36,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:36,863 INFO L225 Difference]: With dead ends: 55 [2019-08-05 09:54:36,863 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 09:54:36,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=104, Invalid=2652, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 09:54:36,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 09:54:36,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 09:54:36,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 09:54:36,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 09:54:36,866 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 09:54:36,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:36,866 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 09:54:36,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 09:54:36,867 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 09:54:36,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 09:54:36,867 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:36,867 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 09:54:36,867 INFO L418 AbstractCegarLoop]: === Iteration 51 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:36,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:36,868 INFO L82 PathProgramCache]: Analyzing trace with hash -105059360, now seen corresponding path program 50 times [2019-08-05 09:54:36,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:36,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:36,936 WARN L254 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 207 conjunts are in the unsatisfiable core [2019-08-05 09:54:36,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:38,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:54:38,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:38,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 09:54:38,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 09:54:38,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 09:54:38,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=2756, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 09:54:38,190 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2019-08-05 09:54:40,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:40,216 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 09:54:40,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 09:54:40,217 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2019-08-05 09:54:40,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:40,218 INFO L225 Difference]: With dead ends: 56 [2019-08-05 09:54:40,218 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 09:54:40,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=106, Invalid=2756, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 09:54:40,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 09:54:40,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 09:54:40,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 09:54:40,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 09:54:40,220 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 09:54:40,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:40,221 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 09:54:40,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 09:54:40,221 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 09:54:40,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 09:54:40,221 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:40,222 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 09:54:40,222 INFO L418 AbstractCegarLoop]: === Iteration 52 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:40,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:40,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125190, now seen corresponding path program 51 times [2019-08-05 09:54:40,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:40,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:40,310 WARN L254 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 211 conjunts are in the unsatisfiable core [2019-08-05 09:54:40,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:41,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:54:41,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:41,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 09:54:41,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 09:54:41,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 09:54:41,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 09:54:41,701 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. [2019-08-05 09:54:43,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:43,685 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 09:54:43,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 09:54:43,685 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2019-08-05 09:54:43,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:43,686 INFO L225 Difference]: With dead ends: 57 [2019-08-05 09:54:43,686 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 09:54:43,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 09:54:43,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 09:54:43,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 09:54:43,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 09:54:43,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 09:54:43,688 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 09:54:43,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:43,688 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 09:54:43,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 09:54:43,689 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 09:54:43,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 09:54:43,689 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:43,689 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 09:54:43,690 INFO L418 AbstractCegarLoop]: === Iteration 53 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:43,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:43,690 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107872, now seen corresponding path program 52 times [2019-08-05 09:54:43,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:43,790 WARN L254 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 215 conjunts are in the unsatisfiable core [2019-08-05 09:54:43,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:45,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:54:45,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:45,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 09:54:45,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 09:54:45,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 09:54:45,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=2970, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 09:54:45,179 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2019-08-05 09:54:47,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:47,127 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 09:54:47,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 09:54:47,128 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2019-08-05 09:54:47,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:47,129 INFO L225 Difference]: With dead ends: 58 [2019-08-05 09:54:47,129 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 09:54:47,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=110, Invalid=2970, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 09:54:47,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 09:54:47,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 09:54:47,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 09:54:47,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 09:54:47,131 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 09:54:47,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:47,132 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 09:54:47,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 09:54:47,132 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 09:54:47,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 09:54:47,133 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:47,133 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 09:54:47,133 INFO L418 AbstractCegarLoop]: === Iteration 54 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:47,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:47,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832646, now seen corresponding path program 53 times [2019-08-05 09:54:47,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:47,252 WARN L254 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 219 conjunts are in the unsatisfiable core [2019-08-05 09:54:47,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:49,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:54:49,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:49,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 09:54:49,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 09:54:49,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 09:54:49,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=3080, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 09:54:49,180 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 57 states. [2019-08-05 09:54:51,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:51,255 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 09:54:51,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 09:54:51,256 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2019-08-05 09:54:51,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:51,257 INFO L225 Difference]: With dead ends: 59 [2019-08-05 09:54:51,257 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 09:54:51,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=112, Invalid=3080, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 09:54:51,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 09:54:51,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 09:54:51,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 09:54:51,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 09:54:51,260 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 09:54:51,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:51,260 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 09:54:51,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 09:54:51,260 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 09:54:51,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 09:54:51,261 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:51,261 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 09:54:51,261 INFO L418 AbstractCegarLoop]: === Iteration 55 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:51,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:51,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895584, now seen corresponding path program 54 times [2019-08-05 09:54:51,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:51,331 WARN L254 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 223 conjunts are in the unsatisfiable core [2019-08-05 09:54:51,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:52,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:54:52,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:52,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 09:54:52,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 09:54:52,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 09:54:52,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=3192, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 09:54:52,749 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 58 states. [2019-08-05 09:54:54,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:54,974 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 09:54:54,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 09:54:54,974 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2019-08-05 09:54:54,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:54,975 INFO L225 Difference]: With dead ends: 60 [2019-08-05 09:54:54,975 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 09:54:54,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=114, Invalid=3192, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 09:54:54,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 09:54:54,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 09:54:54,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 09:54:54,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 09:54:54,977 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 09:54:54,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:54,978 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 09:54:54,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 09:54:54,978 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 09:54:54,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 09:54:54,978 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:54,978 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 09:54:54,979 INFO L418 AbstractCegarLoop]: === Iteration 56 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:54,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:54,979 INFO L82 PathProgramCache]: Analyzing trace with hash -836059386, now seen corresponding path program 55 times [2019-08-05 09:54:54,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:55,082 WARN L254 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 227 conjunts are in the unsatisfiable core [2019-08-05 09:54:55,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:56,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:54:56,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:56,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 09:54:56,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 09:54:56,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 09:54:56,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=3306, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 09:54:56,782 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 59 states. [2019-08-05 09:54:59,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:59,014 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 09:54:59,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 09:54:59,015 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 58 [2019-08-05 09:54:59,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:59,015 INFO L225 Difference]: With dead ends: 61 [2019-08-05 09:54:59,015 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 09:54:59,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=116, Invalid=3306, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 09:54:59,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 09:54:59,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 09:54:59,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 09:54:59,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 09:54:59,017 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 09:54:59,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:59,017 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 09:54:59,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 09:54:59,018 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 09:54:59,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 09:54:59,018 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:59,018 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 09:54:59,018 INFO L418 AbstractCegarLoop]: === Iteration 57 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:59,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:59,019 INFO L82 PathProgramCache]: Analyzing trace with hash -148039136, now seen corresponding path program 56 times [2019-08-05 09:54:59,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:59,104 WARN L254 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 231 conjunts are in the unsatisfiable core [2019-08-05 09:54:59,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:55:00,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:55:00,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:55:00,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 09:55:00,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 09:55:00,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 09:55:00,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=3422, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 09:55:00,623 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 60 states. [2019-08-05 09:55:02,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:55:02,837 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 09:55:02,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 09:55:02,837 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2019-08-05 09:55:02,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:55:02,838 INFO L225 Difference]: With dead ends: 62 [2019-08-05 09:55:02,838 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 09:55:02,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=118, Invalid=3422, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 09:55:02,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 09:55:02,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 09:55:02,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 09:55:02,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 09:55:02,841 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 09:55:02,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:55:02,841 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 09:55:02,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 09:55:02,842 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 09:55:02,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 09:55:02,842 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:55:02,842 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 09:55:02,842 INFO L418 AbstractCegarLoop]: === Iteration 58 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:55:02,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:55:02,843 INFO L82 PathProgramCache]: Analyzing trace with hash -294247866, now seen corresponding path program 57 times [2019-08-05 09:55:02,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:55:02,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:55:02,922 WARN L254 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 235 conjunts are in the unsatisfiable core [2019-08-05 09:55:02,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:55:04,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:55:04,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:55:04,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 09:55:04,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 09:55:04,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 09:55:04,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=3540, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 09:55:04,856 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 61 states. [2019-08-05 09:55:07,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:55:07,243 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 09:55:07,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 09:55:07,244 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 60 [2019-08-05 09:55:07,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:55:07,245 INFO L225 Difference]: With dead ends: 63 [2019-08-05 09:55:07,245 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 09:55:07,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=120, Invalid=3540, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 09:55:07,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 09:55:07,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 09:55:07,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 09:55:07,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 09:55:07,248 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 09:55:07,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:55:07,248 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 09:55:07,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 09:55:07,248 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 09:55:07,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 09:55:07,249 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:55:07,249 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 09:55:07,249 INFO L418 AbstractCegarLoop]: === Iteration 59 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:55:07,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:55:07,249 INFO L82 PathProgramCache]: Analyzing trace with hash -531751200, now seen corresponding path program 58 times [2019-08-05 09:55:07,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:55:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:55:07,381 WARN L254 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 239 conjunts are in the unsatisfiable core [2019-08-05 09:55:07,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:55:10,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:55:10,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:55:10,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 09:55:10,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 09:55:10,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 09:55:10,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=3660, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 09:55:10,126 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 62 states. [2019-08-05 09:55:12,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:55:12,484 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 09:55:12,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 09:55:12,485 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 61 [2019-08-05 09:55:12,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:55:12,486 INFO L225 Difference]: With dead ends: 64 [2019-08-05 09:55:12,486 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 09:55:12,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=122, Invalid=3660, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 09:55:12,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 09:55:12,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 09:55:12,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 09:55:12,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 09:55:12,488 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 09:55:12,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:55:12,489 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 09:55:12,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 09:55:12,489 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 09:55:12,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 09:55:12,489 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:55:12,489 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 09:55:12,490 INFO L418 AbstractCegarLoop]: === Iteration 60 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:55:12,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:55:12,490 INFO L82 PathProgramCache]: Analyzing trace with hash 695580038, now seen corresponding path program 59 times [2019-08-05 09:55:12,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:55:12,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:55:12,614 WARN L254 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 243 conjunts are in the unsatisfiable core [2019-08-05 09:55:12,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:55:14,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:55:14,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:55:14,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 09:55:14,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 09:55:14,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 09:55:14,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=3782, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 09:55:14,595 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 63 states. [2019-08-05 09:55:17,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:55:17,045 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 09:55:17,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 09:55:17,045 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 62 [2019-08-05 09:55:17,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:55:17,046 INFO L225 Difference]: With dead ends: 65 [2019-08-05 09:55:17,046 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 09:55:17,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=124, Invalid=3782, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 09:55:17,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 09:55:17,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 09:55:17,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 09:55:17,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 09:55:17,049 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 09:55:17,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:55:17,050 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 09:55:17,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 09:55:17,050 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 09:55:17,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 09:55:17,050 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:55:17,050 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 09:55:17,051 INFO L418 AbstractCegarLoop]: === Iteration 61 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:55:17,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:55:17,051 INFO L82 PathProgramCache]: Analyzing trace with hash 88142752, now seen corresponding path program 60 times [2019-08-05 09:55:17,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:55:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:55:17,138 WARN L254 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 247 conjunts are in the unsatisfiable core [2019-08-05 09:55:17,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:55:18,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:55:18,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:55:18,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 09:55:18,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 09:55:18,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 09:55:18,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=3906, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 09:55:18,881 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 64 states. [2019-08-05 09:55:21,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:55:21,655 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 09:55:21,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 09:55:21,655 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 63 [2019-08-05 09:55:21,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:55:21,656 INFO L225 Difference]: With dead ends: 66 [2019-08-05 09:55:21,656 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 09:55:21,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=126, Invalid=3906, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 09:55:21,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 09:55:21,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 09:55:21,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 09:55:21,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 09:55:21,659 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 09:55:21,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:55:21,659 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 09:55:21,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 09:55:21,660 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 09:55:21,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 09:55:21,660 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:55:21,660 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 09:55:21,660 INFO L418 AbstractCegarLoop]: === Iteration 62 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:55:21,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:55:21,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543930, now seen corresponding path program 61 times [2019-08-05 09:55:21,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:55:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:55:21,772 WARN L254 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 251 conjunts are in the unsatisfiable core [2019-08-05 09:55:21,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:55:23,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:55:23,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:55:23,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 09:55:23,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 09:55:23,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 09:55:23,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=4032, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 09:55:23,534 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 65 states. [2019-08-05 09:55:26,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:55:26,522 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 09:55:26,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 09:55:26,522 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 64 [2019-08-05 09:55:26,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:55:26,523 INFO L225 Difference]: With dead ends: 67 [2019-08-05 09:55:26,523 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 09:55:26,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=128, Invalid=4032, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 09:55:26,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 09:55:26,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 09:55:26,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 09:55:26,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 09:55:26,525 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 09:55:26,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:55:26,526 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 09:55:26,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 09:55:26,526 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 09:55:26,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 09:55:26,526 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:55:26,526 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 09:55:26,526 INFO L418 AbstractCegarLoop]: === Iteration 63 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:55:26,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:55:26,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223520, now seen corresponding path program 62 times [2019-08-05 09:55:26,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:55:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:55:26,625 WARN L254 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 255 conjunts are in the unsatisfiable core [2019-08-05 09:55:26,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:55:28,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:55:28,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:55:28,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 09:55:28,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 09:55:28,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 09:55:28,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=4160, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 09:55:28,447 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 66 states. [2019-08-05 09:55:31,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:55:31,345 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 09:55:31,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 09:55:31,346 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 65 [2019-08-05 09:55:31,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:55:31,346 INFO L225 Difference]: With dead ends: 68 [2019-08-05 09:55:31,347 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 09:55:31,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=130, Invalid=4160, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 09:55:31,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 09:55:31,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 09:55:31,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 09:55:31,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 09:55:31,349 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 09:55:31,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:55:31,349 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 09:55:31,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 09:55:31,349 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 09:55:31,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 09:55:31,350 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:55:31,350 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 09:55:31,350 INFO L418 AbstractCegarLoop]: === Iteration 64 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:55:31,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:55:31,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774598, now seen corresponding path program 63 times [2019-08-05 09:55:31,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:55:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:55:31,446 WARN L254 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 259 conjunts are in the unsatisfiable core [2019-08-05 09:55:31,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:55:33,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:55:33,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:55:33,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 09:55:33,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 09:55:33,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 09:55:33,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=4290, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 09:55:33,313 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 67 states. [2019-08-05 09:55:36,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:55:36,284 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 09:55:36,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 09:55:36,284 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 66 [2019-08-05 09:55:36,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:55:36,285 INFO L225 Difference]: With dead ends: 69 [2019-08-05 09:55:36,285 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 09:55:36,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=132, Invalid=4290, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 09:55:36,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 09:55:36,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 09:55:36,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 09:55:36,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 09:55:36,288 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 09:55:36,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:55:36,288 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 09:55:36,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 09:55:36,288 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 09:55:36,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 09:55:36,289 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:55:36,289 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 09:55:36,289 INFO L418 AbstractCegarLoop]: === Iteration 65 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:55:36,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:55:36,289 INFO L82 PathProgramCache]: Analyzing trace with hash -892596960, now seen corresponding path program 64 times [2019-08-05 09:55:36,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:55:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:55:36,391 WARN L254 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 263 conjunts are in the unsatisfiable core [2019-08-05 09:55:36,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:55:38,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:55:38,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:55:38,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 09:55:38,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 09:55:38,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 09:55:38,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=4422, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 09:55:38,389 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 68 states. [2019-08-05 09:55:41,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:55:41,477 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 09:55:41,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 09:55:41,477 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 67 [2019-08-05 09:55:41,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:55:41,478 INFO L225 Difference]: With dead ends: 70 [2019-08-05 09:55:41,478 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 09:55:41,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=134, Invalid=4422, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 09:55:41,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 09:55:41,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 09:55:41,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 09:55:41,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 09:55:41,481 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 09:55:41,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:55:41,481 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 09:55:41,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 09:55:41,481 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 09:55:41,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 09:55:41,482 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:55:41,482 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 09:55:41,482 INFO L418 AbstractCegarLoop]: === Iteration 66 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:55:41,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:55:41,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703930, now seen corresponding path program 65 times [2019-08-05 09:55:41,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:55:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:55:41,587 WARN L254 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 267 conjunts are in the unsatisfiable core [2019-08-05 09:55:41,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:55:45,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:55:45,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:55:45,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 09:55:45,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 09:55:45,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 09:55:45,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=4556, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 09:55:45,700 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 69 states. [2019-08-05 09:55:48,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:55:48,701 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 09:55:48,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 09:55:48,701 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 68 [2019-08-05 09:55:48,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:55:48,702 INFO L225 Difference]: With dead ends: 71 [2019-08-05 09:55:48,702 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 09:55:48,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=136, Invalid=4556, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 09:55:48,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 09:55:48,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 09:55:48,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 09:55:48,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 09:55:48,705 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 09:55:48,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:55:48,705 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 09:55:48,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 09:55:48,705 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 09:55:48,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 09:55:48,706 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:55:48,706 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 09:55:48,706 INFO L418 AbstractCegarLoop]: === Iteration 67 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:55:48,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:55:48,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718368, now seen corresponding path program 66 times [2019-08-05 09:55:48,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:55:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:55:48,829 WARN L254 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 271 conjunts are in the unsatisfiable core [2019-08-05 09:55:48,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:55:51,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:55:51,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:55:51,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 09:55:51,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 09:55:51,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 09:55:51,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=4692, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 09:55:51,130 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 70 states. [2019-08-05 09:55:54,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:55:54,171 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 09:55:54,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 09:55:54,172 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 69 [2019-08-05 09:55:54,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:55:54,172 INFO L225 Difference]: With dead ends: 72 [2019-08-05 09:55:54,173 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 09:55:54,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=138, Invalid=4692, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 09:55:54,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 09:55:54,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 09:55:54,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 09:55:54,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 09:55:54,175 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 09:55:54,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:55:54,175 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 09:55:54,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 09:55:54,175 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 09:55:54,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 09:55:54,176 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:55:54,176 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 09:55:54,176 INFO L418 AbstractCegarLoop]: === Iteration 68 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:55:54,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:55:54,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438202, now seen corresponding path program 67 times [2019-08-05 09:55:54,177 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:55:54,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:55:54,286 WARN L254 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 275 conjunts are in the unsatisfiable core [2019-08-05 09:55:54,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:55:56,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:55:56,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:55:56,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 09:55:56,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 09:55:56,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 09:55:56,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=4830, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 09:55:56,810 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 71 states. [2019-08-05 09:55:59,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:55:59,940 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 09:55:59,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 09:55:59,941 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 70 [2019-08-05 09:55:59,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:55:59,942 INFO L225 Difference]: With dead ends: 73 [2019-08-05 09:55:59,942 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 09:55:59,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=140, Invalid=4830, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 09:55:59,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 09:55:59,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 09:55:59,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 09:55:59,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 09:55:59,944 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 09:55:59,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:55:59,945 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 09:55:59,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 09:55:59,945 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 09:55:59,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 09:55:59,945 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:55:59,945 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 09:55:59,946 INFO L418 AbstractCegarLoop]: === Iteration 69 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:55:59,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:55:59,946 INFO L82 PathProgramCache]: Analyzing trace with hash 976119456, now seen corresponding path program 68 times [2019-08-05 09:55:59,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:55:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:56:00,067 WARN L254 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 279 conjunts are in the unsatisfiable core [2019-08-05 09:56:00,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:56:02,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:56:02,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:56:02,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 09:56:02,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 09:56:02,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 09:56:02,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=4970, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 09:56:02,390 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 72 states. [2019-08-05 09:56:05,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:56:05,823 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 09:56:05,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 09:56:05,824 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 71 [2019-08-05 09:56:05,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:56:05,825 INFO L225 Difference]: With dead ends: 74 [2019-08-05 09:56:05,825 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 09:56:05,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=142, Invalid=4970, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 09:56:05,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 09:56:05,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 09:56:05,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 09:56:05,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 09:56:05,828 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 09:56:05,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:56:05,828 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 09:56:05,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 09:56:05,828 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 09:56:05,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 09:56:05,829 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:56:05,829 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 09:56:05,829 INFO L418 AbstractCegarLoop]: === Iteration 70 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:56:05,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:56:05,829 INFO L82 PathProgramCache]: Analyzing trace with hash 194930118, now seen corresponding path program 69 times [2019-08-05 09:56:05,830 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:56:05,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:56:05,960 WARN L254 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 283 conjunts are in the unsatisfiable core [2019-08-05 09:56:05,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:56:08,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:56:08,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:56:08,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 09:56:08,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 09:56:08,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 09:56:08,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=5112, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 09:56:08,185 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 73 states. [2019-08-05 09:56:11,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:56:11,705 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 09:56:11,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 09:56:11,706 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 72 [2019-08-05 09:56:11,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:56:11,707 INFO L225 Difference]: With dead ends: 75 [2019-08-05 09:56:11,707 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 09:56:11,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=144, Invalid=5112, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 09:56:11,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 09:56:11,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 09:56:11,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 09:56:11,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 09:56:11,710 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 09:56:11,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:56:11,710 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 09:56:11,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 09:56:11,710 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 09:56:11,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 09:56:11,711 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:56:11,711 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 09:56:11,711 INFO L418 AbstractCegarLoop]: === Iteration 71 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:56:11,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:56:11,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864416, now seen corresponding path program 70 times [2019-08-05 09:56:11,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:56:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:56:11,832 WARN L254 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 287 conjunts are in the unsatisfiable core [2019-08-05 09:56:11,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:56:14,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:56:14,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:56:14,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 09:56:14,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 09:56:14,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 09:56:14,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=5256, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 09:56:14,131 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 74 states. [2019-08-05 09:56:17,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:56:17,796 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 09:56:17,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 09:56:17,797 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 73 [2019-08-05 09:56:17,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:56:17,798 INFO L225 Difference]: With dead ends: 76 [2019-08-05 09:56:17,798 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 09:56:17,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=146, Invalid=5256, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 09:56:17,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 09:56:17,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 09:56:17,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 09:56:17,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 09:56:17,801 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 09:56:17,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:56:17,801 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 09:56:17,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 09:56:17,801 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 09:56:17,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 09:56:17,802 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:56:17,802 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 09:56:17,802 INFO L418 AbstractCegarLoop]: === Iteration 72 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:56:17,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:56:17,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779898, now seen corresponding path program 71 times [2019-08-05 09:56:17,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:56:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:56:18,061 WARN L254 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 291 conjunts are in the unsatisfiable core [2019-08-05 09:56:18,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:56:20,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:56:20,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:56:20,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 09:56:20,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 09:56:20,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 09:56:20,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=5402, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 09:56:20,671 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 75 states. [2019-08-05 09:56:24,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:56:24,446 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 09:56:24,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 09:56:24,447 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 74 [2019-08-05 09:56:24,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:56:24,448 INFO L225 Difference]: With dead ends: 77 [2019-08-05 09:56:24,448 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 09:56:24,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=148, Invalid=5402, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 09:56:24,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 09:56:24,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 09:56:24,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 09:56:24,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 09:56:24,451 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 09:56:24,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:56:24,451 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 09:56:24,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 09:56:24,451 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 09:56:24,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 09:56:24,452 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:56:24,452 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 09:56:24,452 INFO L418 AbstractCegarLoop]: === Iteration 73 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:56:24,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:56:24,453 INFO L82 PathProgramCache]: Analyzing trace with hash 365428768, now seen corresponding path program 72 times [2019-08-05 09:56:24,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:56:24,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:56:24,733 WARN L254 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 295 conjunts are in the unsatisfiable core [2019-08-05 09:56:24,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:56:27,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:56:27,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:56:27,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 09:56:27,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 09:56:27,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 09:56:27,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=5550, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 09:56:27,904 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 76 states. [2019-08-05 09:56:32,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:56:32,000 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 09:56:32,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 09:56:32,001 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 75 [2019-08-05 09:56:32,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:56:32,002 INFO L225 Difference]: With dead ends: 78 [2019-08-05 09:56:32,002 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 09:56:32,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=150, Invalid=5550, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 09:56:32,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 09:56:32,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 09:56:32,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 09:56:32,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 09:56:32,005 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 09:56:32,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:56:32,005 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 09:56:32,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 09:56:32,005 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 09:56:32,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 09:56:32,006 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:56:32,006 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 09:56:32,006 INFO L418 AbstractCegarLoop]: === Iteration 74 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:56:32,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:56:32,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1556612026, now seen corresponding path program 73 times [2019-08-05 09:56:32,007 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:56:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:56:32,152 WARN L254 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 299 conjunts are in the unsatisfiable core [2019-08-05 09:56:32,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:56:34,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:56:34,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:56:34,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 09:56:34,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 09:56:34,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 09:56:34,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=5700, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 09:56:34,625 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 77 states. [2019-08-05 09:56:38,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:56:38,645 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 09:56:38,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 09:56:38,645 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 76 [2019-08-05 09:56:38,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:56:38,646 INFO L225 Difference]: With dead ends: 79 [2019-08-05 09:56:38,646 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 09:56:38,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=152, Invalid=5700, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 09:56:38,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 09:56:38,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 09:56:38,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 09:56:38,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 09:56:38,649 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 09:56:38,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:56:38,649 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 09:56:38,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 09:56:38,650 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 09:56:38,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 09:56:38,650 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:56:38,650 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 09:56:38,650 INFO L418 AbstractCegarLoop]: === Iteration 75 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:56:38,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:56:38,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334496, now seen corresponding path program 74 times [2019-08-05 09:56:38,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:56:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:56:38,809 WARN L254 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 303 conjunts are in the unsatisfiable core [2019-08-05 09:56:38,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:56:41,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:56:41,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:56:41,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 09:56:41,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 09:56:41,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 09:56:41,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=5852, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 09:56:41,560 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 78 states. [2019-08-05 09:56:45,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:56:45,581 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 09:56:45,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 09:56:45,581 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 77 [2019-08-05 09:56:45,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:56:45,582 INFO L225 Difference]: With dead ends: 80 [2019-08-05 09:56:45,582 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 09:56:45,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=154, Invalid=5852, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 09:56:45,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 09:56:45,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 09:56:45,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 09:56:45,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 09:56:45,585 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 09:56:45,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:56:45,585 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 09:56:45,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 09:56:45,586 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 09:56:45,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 09:56:45,586 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:56:45,586 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 09:56:45,586 INFO L418 AbstractCegarLoop]: === Iteration 76 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:56:45,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:56:45,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600250, now seen corresponding path program 75 times [2019-08-05 09:56:45,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:56:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:56:45,765 WARN L254 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 307 conjunts are in the unsatisfiable core [2019-08-05 09:56:45,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:56:48,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:56:48,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:56:48,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 09:56:48,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 09:56:48,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 09:56:48,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=6006, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 09:56:48,749 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 79 states. [2019-08-05 09:56:52,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:56:52,935 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 09:56:52,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 09:56:52,936 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 78 [2019-08-05 09:56:52,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:56:52,937 INFO L225 Difference]: With dead ends: 81 [2019-08-05 09:56:52,937 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 09:56:52,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=156, Invalid=6006, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 09:56:52,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 09:56:52,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 09:56:52,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 09:56:52,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 09:56:52,940 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 09:56:52,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:56:52,940 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 09:56:52,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 09:56:52,941 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 09:56:52,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 09:56:52,941 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:56:52,941 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 09:56:52,941 INFO L418 AbstractCegarLoop]: === Iteration 77 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:56:52,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:56:52,942 INFO L82 PathProgramCache]: Analyzing trace with hash -268904032, now seen corresponding path program 76 times [2019-08-05 09:56:52,942 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:56:53,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:56:53,280 WARN L254 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 311 conjunts are in the unsatisfiable core [2019-08-05 09:56:53,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:56:56,170 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 09:56:56,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:56:56,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 09:56:56,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 09:56:56,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 09:56:56,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=6162, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 09:56:56,171 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 80 states. [2019-08-05 09:57:00,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:57:00,393 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 09:57:00,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 09:57:00,394 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 79 [2019-08-05 09:57:00,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:57:00,395 INFO L225 Difference]: With dead ends: 82 [2019-08-05 09:57:00,395 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 09:57:00,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=158, Invalid=6162, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 09:57:00,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 09:57:00,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 09:57:00,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 09:57:00,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 09:57:00,398 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 09:57:00,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:57:00,398 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 09:57:00,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 09:57:00,399 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 09:57:00,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 09:57:00,399 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:57:00,399 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 09:57:00,399 INFO L418 AbstractCegarLoop]: === Iteration 78 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:57:00,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:57:00,400 INFO L82 PathProgramCache]: Analyzing trace with hash 253907654, now seen corresponding path program 77 times [2019-08-05 09:57:00,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:57:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:57:00,590 WARN L254 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 315 conjunts are in the unsatisfiable core [2019-08-05 09:57:00,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:57:03,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:57:03,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:57:03,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 09:57:03,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 09:57:03,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 09:57:03,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=6320, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 09:57:03,402 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 81 states. [2019-08-05 09:57:07,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:57:07,766 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 09:57:07,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 09:57:07,767 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 80 [2019-08-05 09:57:07,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:57:07,768 INFO L225 Difference]: With dead ends: 83 [2019-08-05 09:57:07,768 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 09:57:07,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=160, Invalid=6320, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 09:57:07,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 09:57:07,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 09:57:07,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 09:57:07,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 09:57:07,771 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 09:57:07,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:57:07,771 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 09:57:07,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 09:57:07,771 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 09:57:07,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 09:57:07,772 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:57:07,772 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-05 09:57:07,772 INFO L418 AbstractCegarLoop]: === Iteration 79 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:57:07,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:57:07,773 INFO L82 PathProgramCache]: Analyzing trace with hash -718799264, now seen corresponding path program 78 times [2019-08-05 09:57:07,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:57:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:57:08,024 WARN L254 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 319 conjunts are in the unsatisfiable core [2019-08-05 09:57:08,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:57:10,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:57:10,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:57:10,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 09:57:10,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 09:57:10,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 09:57:10,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=6480, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 09:57:10,762 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 82 states. [2019-08-05 09:57:15,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:57:15,315 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 09:57:15,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 09:57:15,315 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 81 [2019-08-05 09:57:15,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:57:15,316 INFO L225 Difference]: With dead ends: 84 [2019-08-05 09:57:15,316 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 09:57:15,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=162, Invalid=6480, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 09:57:15,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 09:57:15,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 09:57:15,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 09:57:15,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 09:57:15,319 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-05 09:57:15,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:57:15,319 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 09:57:15,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 09:57:15,319 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 09:57:15,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 09:57:15,320 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:57:15,320 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-05 09:57:15,320 INFO L418 AbstractCegarLoop]: === Iteration 80 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:57:15,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:57:15,320 INFO L82 PathProgramCache]: Analyzing trace with hash -807942650, now seen corresponding path program 79 times [2019-08-05 09:57:15,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:57:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:57:15,496 WARN L254 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 323 conjunts are in the unsatisfiable core [2019-08-05 09:57:15,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:57:18,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:57:18,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:57:18,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 09:57:18,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 09:57:18,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 09:57:18,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=6642, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 09:57:18,717 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 83 states. [2019-08-05 09:57:23,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:57:23,484 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 09:57:23,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 09:57:23,485 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 82 [2019-08-05 09:57:23,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:57:23,485 INFO L225 Difference]: With dead ends: 85 [2019-08-05 09:57:23,486 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 09:57:23,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=164, Invalid=6642, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 09:57:23,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 09:57:23,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 09:57:23,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 09:57:23,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 09:57:23,488 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-05 09:57:23,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:57:23,488 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 09:57:23,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 09:57:23,488 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 09:57:23,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 09:57:23,488 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:57:23,488 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-05 09:57:23,489 INFO L418 AbstractCegarLoop]: === Iteration 81 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:57:23,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:57:23,489 INFO L82 PathProgramCache]: Analyzing trace with hash 723579680, now seen corresponding path program 80 times [2019-08-05 09:57:23,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:57:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:57:23,675 WARN L254 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 327 conjunts are in the unsatisfiable core [2019-08-05 09:57:23,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:57:26,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:57:26,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:57:26,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 09:57:26,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 09:57:26,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 09:57:26,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=6806, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 09:57:26,613 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 84 states. [2019-08-05 09:57:31,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:57:31,467 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 09:57:31,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 09:57:31,467 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 83 [2019-08-05 09:57:31,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:57:31,468 INFO L225 Difference]: With dead ends: 86 [2019-08-05 09:57:31,468 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 09:57:31,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=166, Invalid=6806, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 09:57:31,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 09:57:31,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 09:57:31,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 09:57:31,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 09:57:31,471 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-08-05 09:57:31,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:57:31,471 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 09:57:31,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 09:57:31,471 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 09:57:31,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 09:57:31,471 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:57:31,471 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-05 09:57:31,472 INFO L418 AbstractCegarLoop]: === Iteration 82 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:57:31,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:57:31,472 INFO L82 PathProgramCache]: Analyzing trace with hash 956131654, now seen corresponding path program 81 times [2019-08-05 09:57:31,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:57:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:57:31,670 WARN L254 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 331 conjunts are in the unsatisfiable core [2019-08-05 09:57:31,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 09:57:33,124 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 09:57:33,124 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 09:57:33,128 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 09:57:33,128 INFO L202 PluginConnector]: Adding new model ReachDef-Simple.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 09:57:33 BoogieIcfgContainer [2019-08-05 09:57:33,128 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 09:57:33,130 INFO L168 Benchmark]: Toolchain (without parser) took 248048.50 ms. Allocated memory was 133.7 MB in the beginning and 386.9 MB in the end (delta: 253.2 MB). Free memory was 111.4 MB in the beginning and 238.1 MB in the end (delta: -126.7 MB). Peak memory consumption was 126.5 MB. Max. memory is 7.1 GB. [2019-08-05 09:57:33,131 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 133.7 MB. Free memory was 112.4 MB in the beginning and 112.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 09:57:33,131 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.59 ms. Allocated memory is still 133.7 MB. Free memory was 111.2 MB in the beginning and 109.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 09:57:33,132 INFO L168 Benchmark]: Boogie Preprocessor took 21.66 ms. Allocated memory is still 133.7 MB. Free memory was 109.4 MB in the beginning and 108.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 09:57:33,133 INFO L168 Benchmark]: RCFGBuilder took 266.75 ms. Allocated memory is still 133.7 MB. Free memory was 108.1 MB in the beginning and 99.2 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. [2019-08-05 09:57:33,133 INFO L168 Benchmark]: TraceAbstraction took 247719.40 ms. Allocated memory was 133.7 MB in the beginning and 386.9 MB in the end (delta: 253.2 MB). Free memory was 99.0 MB in the beginning and 238.1 MB in the end (delta: -139.2 MB). Peak memory consumption was 114.1 MB. Max. memory is 7.1 GB. [2019-08-05 09:57:33,136 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.25 ms. Allocated memory is still 133.7 MB. Free memory was 112.4 MB in the beginning and 112.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.59 ms. Allocated memory is still 133.7 MB. Free memory was 111.2 MB in the beginning and 109.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.66 ms. Allocated memory is still 133.7 MB. Free memory was 109.4 MB in the beginning and 108.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 266.75 ms. Allocated memory is still 133.7 MB. Free memory was 108.1 MB in the beginning and 99.2 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 247719.40 ms. Allocated memory was 133.7 MB in the beginning and 386.9 MB in the end (delta: 253.2 MB). Free memory was 99.0 MB in the beginning and 238.1 MB in the end (delta: -139.2 MB). Peak memory consumption was 114.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 19). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 81,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 247.6s OverallTime, 82 OverallIterations, 81 TraceHistogramMax, 134.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 243 SDtfs, 82 SDslu, 3321 SDs, 0 SdLazy, 187780 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 111.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3402 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3402 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 103.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=81, 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.1s AutomataMinimizationTime, 81 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 108.2s InterpolantComputationTime, 3483 NumberOfCodeBlocks, 3483 NumberOfCodeBlocksAsserted, 81 NumberOfCheckSat, 3402 ConstructedInterpolants, 0 QuantifiedInterpolants, 1320354 SizeOfPredicates, 0 NumberOfNonLiveVariables, 20331 ConjunctsInSsa, 13527 ConjunctsInUnsatCore, 81 InterpolantComputations, 1 PerfectInterpolantSequences, 0/88560 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown