java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:35:20,201 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:35:20,203 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:35:20,215 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:35:20,215 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:35:20,216 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:35:20,217 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:35:20,219 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:35:20,221 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:35:20,222 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:35:20,223 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:35:20,223 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:35:20,223 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:35:20,224 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:35:20,225 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:35:20,226 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:35:20,227 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:35:20,228 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:35:20,230 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:35:20,232 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:35:20,234 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:35:20,235 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:35:20,236 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:35:20,237 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:35:20,239 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:35:20,239 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:35:20,239 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:35:20,240 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:35:20,241 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:35:20,242 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:35:20,242 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:35:20,243 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:35:20,244 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:35:20,245 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:35:20,246 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:35:20,246 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:35:20,247 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:35:20,247 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:35:20,247 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:35:20,248 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:35:20,249 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:35:20,281 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:35:20,294 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:35:20,300 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:35:20,302 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:35:20,302 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:35:20,303 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl [2019-08-05 10:35:20,303 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl' [2019-08-05 10:35:20,359 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:35:20,360 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:35:20,361 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:35:20,361 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:35:20,361 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:35:20,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:20" (1/1) ... [2019-08-05 10:35:20,389 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:20" (1/1) ... [2019-08-05 10:35:20,396 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:35:20,396 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:35:20,397 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:35:20,399 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:35:20,399 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:35:20,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:35:20,400 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:35:20,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:20" (1/1) ... [2019-08-05 10:35:20,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:20" (1/1) ... [2019-08-05 10:35:20,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:20" (1/1) ... [2019-08-05 10:35:20,412 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:20" (1/1) ... [2019-08-05 10:35:20,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:20" (1/1) ... [2019-08-05 10:35:20,425 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:20" (1/1) ... [2019-08-05 10:35:20,426 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:20" (1/1) ... [2019-08-05 10:35:20,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:35:20,429 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:35:20,429 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:35:20,429 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:35:20,430 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:35:20,506 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:35:20,506 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:35:20,506 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-08-05 10:35:20,914 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:35:20,915 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:35:20,916 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:35:20 BoogieIcfgContainer [2019-08-05 10:35:20,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:35:20,918 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:35:20,918 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:35:20,921 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:35:20,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:20" (1/2) ... [2019-08-05 10:35:20,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c44c787 and model type PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:35:20, skipping insertion in model container [2019-08-05 10:35:20,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:35:20" (2/2) ... [2019-08-05 10:35:20,931 INFO L109 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified03.bpl [2019-08-05 10:35:20,946 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:35:20,967 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:35:20,989 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:35:21,014 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:35:21,015 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:35:21,015 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:35:21,015 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:35:21,015 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:35:21,015 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:35:21,016 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:35:21,016 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:35:21,016 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:35:21,030 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:35:21,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:35:21,039 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:21,040 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:35:21,043 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:21,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:21,051 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-08-05 10:35:21,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:21,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:35:21,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:21,230 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:21,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:21,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:21,284 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:21,284 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:21,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:21,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:35:21,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:35:21,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:35:21,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:35:21,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:35:21,348 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:35:21,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:21,469 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:35:21,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:35:21,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:35:21,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:21,483 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:35:21,483 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:35:21,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:35:21,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:35:21,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:35:21,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:35:21,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:35:21,533 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2019-08-05 10:35:21,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:21,534 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:35:21,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:35:21,535 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:35:21,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:35:21,535 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:21,536 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:35:21,536 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:21,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:21,537 INFO L82 PathProgramCache]: Analyzing trace with hash 28824427, now seen corresponding path program 1 times [2019-08-05 10:35:21,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:21,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:35:21,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:21,630 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:21,630 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:21,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:21,710 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:21,711 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:21,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:21,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:21,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-05 10:35:21,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:35:21,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:35:21,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:35:21,861 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 4 states. [2019-08-05 10:35:21,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:21,929 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:35:21,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:35:21,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 10:35:21,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:21,930 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:35:21,930 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:35:21,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 10:35:21,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:35:21,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:35:21,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:35:21,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:35:21,934 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-08-05 10:35:21,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:21,935 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:35:21,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:35:21,935 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:35:21,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:35:21,936 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:21,936 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2019-08-05 10:35:21,937 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:21,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:21,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1930480374, now seen corresponding path program 2 times [2019-08-05 10:35:21,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:21,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:35:21,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:22,006 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:22,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:22,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:22,047 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:22,048 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:22,177 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 10:35:22,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:22,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:35:22,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:35:22,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:35:22,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:35:22,179 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 5 states. [2019-08-05 10:35:22,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:22,263 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:35:22,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:35:22,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-08-05 10:35:22,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:22,265 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:35:22,265 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:35:22,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:35:22,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:35:22,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:35:22,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:35:22,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:35:22,269 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2019-08-05 10:35:22,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:22,270 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:35:22,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:35:22,270 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:35:22,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:35:22,271 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:22,271 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2019-08-05 10:35:22,271 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:22,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:22,272 INFO L82 PathProgramCache]: Analyzing trace with hash -234222655, now seen corresponding path program 3 times [2019-08-05 10:35:22,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:22,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:35:22,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:22,374 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:22,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:22,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:22,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:22,392 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:22,645 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:22,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:22,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:35:22,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:35:22,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:35:22,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:35:22,647 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 6 states. [2019-08-05 10:35:22,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:22,729 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:35:22,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:35:22,729 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-08-05 10:35:22,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:22,730 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:35:22,731 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:35:22,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:35:22,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:35:22,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:35:22,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:35:22,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:35:22,736 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-08-05 10:35:22,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:22,736 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:35:22,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:35:22,737 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:35:22,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:35:22,737 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:22,737 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2019-08-05 10:35:22,738 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:22,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:22,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1749662260, now seen corresponding path program 4 times [2019-08-05 10:35:22,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:22,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:35:22,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:22,794 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:22,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:22,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:22,811 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:22,811 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:23,026 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:23,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:23,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:35:23,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:35:23,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:35:23,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:35:23,028 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 7 states. [2019-08-05 10:35:23,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:23,121 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:35:23,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:35:23,121 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-08-05 10:35:23,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:23,122 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:35:23,122 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:35:23,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:35:23,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:35:23,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:35:23,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:35:23,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:35:23,125 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-08-05 10:35:23,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:23,125 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:35:23,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:35:23,125 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:35:23,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:35:23,126 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:23,126 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2019-08-05 10:35:23,126 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:23,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:23,127 INFO L82 PathProgramCache]: Analyzing trace with hash -2093209321, now seen corresponding path program 5 times [2019-08-05 10:35:23,127 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:23,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:35:23,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:23,201 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:23,202 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:23,213 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:23,213 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:23,214 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:23,361 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:23,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:23,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:35:23,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:35:23,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:35:23,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:35:23,364 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 8 states. [2019-08-05 10:35:23,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:23,408 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:35:23,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:35:23,409 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-08-05 10:35:23,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:23,409 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:35:23,410 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:35:23,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:35:23,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:35:23,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:35:23,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:35:23,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:35:23,413 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2019-08-05 10:35:23,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:23,413 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:35:23,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:35:23,414 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:35:23,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:35:23,414 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:23,414 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2019-08-05 10:35:23,414 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:23,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:23,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1529453150, now seen corresponding path program 6 times [2019-08-05 10:35:23,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:23,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:35:23,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:23,481 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:23,481 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:23,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:23,502 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:23,502 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:23,659 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:23,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:23,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:35:23,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:35:23,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:35:23,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:35:23,661 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2019-08-05 10:35:23,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:23,710 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:35:23,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:35:23,710 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-08-05 10:35:23,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:23,711 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:35:23,711 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:35:23,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:35:23,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:35:23,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:35:23,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:35:23,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:35:23,715 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2019-08-05 10:35:23,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:23,715 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:35:23,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:35:23,716 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:35:23,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:35:23,716 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:23,716 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2019-08-05 10:35:23,717 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:23,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:23,717 INFO L82 PathProgramCache]: Analyzing trace with hash -925652115, now seen corresponding path program 7 times [2019-08-05 10:35:23,718 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:23,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:35:23,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:23,771 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:23,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:23,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:23,810 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:23,810 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:24,227 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:24,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:24,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:35:24,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:35:24,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:35:24,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:35:24,229 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 10 states. [2019-08-05 10:35:24,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:24,308 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:35:24,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:35:24,308 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-08-05 10:35:24,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:24,309 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:35:24,309 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:35:24,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:35:24,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:35:24,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:35:24,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:35:24,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:35:24,314 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2019-08-05 10:35:24,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:24,314 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:35:24,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:35:24,315 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:35:24,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:35:24,315 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:24,316 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2019-08-05 10:35:24,316 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:24,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:24,316 INFO L82 PathProgramCache]: Analyzing trace with hash -493442440, now seen corresponding path program 8 times [2019-08-05 10:35:24,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:24,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:35:24,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:24,391 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:24,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:24,394 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:24,394 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:24,395 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:24,618 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:24,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:24,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:35:24,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:35:24,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:35:24,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:35:24,619 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 11 states. [2019-08-05 10:35:24,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:24,697 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:35:24,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:35:24,697 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-08-05 10:35:24,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:24,698 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:35:24,699 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:35:24,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:35:24,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:35:24,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:35:24,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:35:24,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:35:24,704 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2019-08-05 10:35:24,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:24,704 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:35:24,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:35:24,704 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:35:24,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:35:24,705 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:24,705 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1] [2019-08-05 10:35:24,706 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:24,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:24,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1751772477, now seen corresponding path program 9 times [2019-08-05 10:35:24,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:24,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:35:24,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:24,781 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:24,781 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:24,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:24,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:24,803 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:25,120 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:25,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:25,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:35:25,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:35:25,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:35:25,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:35:25,122 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 12 states. [2019-08-05 10:35:25,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:25,185 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:35:25,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:35:25,186 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-08-05 10:35:25,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:25,187 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:35:25,187 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:35:25,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:35:25,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:35:25,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:35:25,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:35:25,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:35:25,192 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2019-08-05 10:35:25,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:25,192 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:35:25,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:35:25,192 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:35:25,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:35:25,193 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:25,193 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1] [2019-08-05 10:35:25,193 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:25,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:25,194 INFO L82 PathProgramCache]: Analyzing trace with hash 173839438, now seen corresponding path program 10 times [2019-08-05 10:35:25,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:25,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:35:25,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:25,259 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:25,259 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:25,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:25,274 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:25,274 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:25,509 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:25,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:25,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:35:25,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:35:25,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:35:25,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:35:25,512 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 13 states. [2019-08-05 10:35:25,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:25,583 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:35:25,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:35:25,585 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-08-05 10:35:25,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:25,586 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:35:25,586 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:35:25,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:35:25,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:35:25,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:35:25,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:35:25,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:35:25,590 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2019-08-05 10:35:25,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:25,591 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:35:25,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:35:25,591 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:35:25,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:35:25,591 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:25,592 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 1, 1] [2019-08-05 10:35:25,592 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:25,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:25,592 INFO L82 PathProgramCache]: Analyzing trace with hash -444014823, now seen corresponding path program 11 times [2019-08-05 10:35:25,593 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:25,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:35:25,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:25,670 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:25,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:25,744 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:25,744 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:25,744 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:26,132 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:26,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:26,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:35:26,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:35:26,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:35:26,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:35:26,135 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 14 states. [2019-08-05 10:35:26,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:26,205 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:35:26,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:35:26,213 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-08-05 10:35:26,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:26,214 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:35:26,214 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:35:26,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:35:26,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:35:26,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:35:26,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:35:26,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:35:26,218 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2019-08-05 10:35:26,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:26,218 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:35:26,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:35:26,218 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:35:26,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:35:26,219 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:26,219 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 1, 1] [2019-08-05 10:35:26,220 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:26,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:26,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1496472796, now seen corresponding path program 12 times [2019-08-05 10:35:26,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:26,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:35:26,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:26,266 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:26,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:26,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:26,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:26,280 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:26,606 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:26,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:26,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:35:26,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:35:26,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:35:26,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:35:26,608 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 15 states. [2019-08-05 10:35:26,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:26,805 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:35:26,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:35:26,805 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-08-05 10:35:26,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:26,806 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:35:26,806 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:35:26,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:35:26,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:35:26,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:35:26,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:35:26,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:35:26,811 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2019-08-05 10:35:26,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:26,812 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:35:26,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:35:26,812 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:35:26,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:35:26,813 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:26,813 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 1, 1] [2019-08-05 10:35:26,813 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:26,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:26,814 INFO L82 PathProgramCache]: Analyzing trace with hash 703697007, now seen corresponding path program 13 times [2019-08-05 10:35:26,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:26,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:26,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:35:26,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:26,882 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:26,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:26,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:26,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:26,921 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:27,190 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:27,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:27,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:35:27,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:35:27,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:35:27,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:35:27,192 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 16 states. [2019-08-05 10:35:27,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:27,250 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:35:27,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:35:27,250 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2019-08-05 10:35:27,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:27,251 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:35:27,251 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:35:27,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:35:27,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:35:27,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:35:27,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:35:27,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:35:27,257 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2019-08-05 10:35:27,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:27,258 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:35:27,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:35:27,258 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:35:27,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:35:27,259 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:27,259 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 1, 1] [2019-08-05 10:35:27,259 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:27,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:27,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1942968058, now seen corresponding path program 14 times [2019-08-05 10:35:27,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:27,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:35:27,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:27,339 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:27,340 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:27,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:27,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:27,369 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:27,574 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 10:35:27,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:27,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:35:27,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:35:27,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:35:27,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:35:27,576 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 17 states. [2019-08-05 10:35:27,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:27,755 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:35:27,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:35:27,756 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2019-08-05 10:35:27,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:27,757 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:35:27,757 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:35:27,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:35:27,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:35:27,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:35:27,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:35:27,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:35:27,762 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2019-08-05 10:35:27,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:27,762 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:35:27,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:35:27,763 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:35:27,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:35:27,764 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:27,764 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 1, 1] [2019-08-05 10:35:27,764 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:27,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:27,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1118460219, now seen corresponding path program 15 times [2019-08-05 10:35:27,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:27,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:35:27,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:27,824 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:27,824 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:27,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:27,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:27,842 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:28,344 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:28,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:28,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:35:28,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:35:28,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:35:28,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:35:28,346 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 18 states. [2019-08-05 10:35:28,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:28,452 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:35:28,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:35:28,452 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2019-08-05 10:35:28,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:28,452 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:35:28,453 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:35:28,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:35:28,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:35:28,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:35:28,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:35:28,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:35:28,457 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2019-08-05 10:35:28,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:28,458 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:35:28,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:35:28,458 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:35:28,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:35:28,459 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:28,459 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 1, 1] [2019-08-05 10:35:28,459 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:28,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:28,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1098436656, now seen corresponding path program 16 times [2019-08-05 10:35:28,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:28,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:35:28,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:28,518 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:28,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:28,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:28,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:28,527 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:28,922 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:28,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:28,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:35:28,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:35:28,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:35:28,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:35:28,924 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 19 states. [2019-08-05 10:35:29,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:29,023 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:35:29,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:35:29,024 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2019-08-05 10:35:29,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:29,025 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:35:29,025 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:35:29,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:35:29,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:35:29,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:35:29,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:35:29,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:35:29,030 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2019-08-05 10:35:29,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:29,030 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:35:29,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:35:29,030 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:35:29,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:35:29,031 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:29,031 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 1, 1] [2019-08-05 10:35:29,031 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:29,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:29,032 INFO L82 PathProgramCache]: Analyzing trace with hash 964338203, now seen corresponding path program 17 times [2019-08-05 10:35:29,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:29,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:35:29,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:29,100 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:29,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:29,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:29,124 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:29,124 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:29,453 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:29,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:29,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:35:29,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:35:29,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:35:29,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:35:29,454 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 20 states. [2019-08-05 10:35:29,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:29,568 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:35:29,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:35:29,569 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2019-08-05 10:35:29,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:29,569 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:35:29,569 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:35:29,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:35:29,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:35:29,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:35:29,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:35:29,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:35:29,572 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2019-08-05 10:35:29,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:29,572 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:35:29,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:35:29,573 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:35:29,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:35:29,573 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:29,573 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 1, 1] [2019-08-05 10:35:29,574 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:29,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:29,574 INFO L82 PathProgramCache]: Analyzing trace with hash -983913050, now seen corresponding path program 18 times [2019-08-05 10:35:29,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:29,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:35:29,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:29,648 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:29,648 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:29,684 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:29,685 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:29,685 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:30,030 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:30,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:30,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:35:30,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:35:30,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:35:30,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:35:30,032 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 21 states. [2019-08-05 10:35:30,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:30,115 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:35:30,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:35:30,116 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2019-08-05 10:35:30,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:30,117 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:35:30,117 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:35:30,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:35:30,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:35:30,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:35:30,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:35:30,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:35:30,122 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2019-08-05 10:35:30,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:30,122 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:35:30,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:35:30,122 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:35:30,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:35:30,123 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:30,123 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 1, 1] [2019-08-05 10:35:30,123 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:30,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:30,124 INFO L82 PathProgramCache]: Analyzing trace with hash -647626127, now seen corresponding path program 19 times [2019-08-05 10:35:30,124 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:30,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:35:30,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:30,200 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:30,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:30,265 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:30,265 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:30,265 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:30,683 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:30,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:30,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:35:30,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:35:30,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:35:30,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:35:30,685 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 22 states. [2019-08-05 10:35:30,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:30,787 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:35:30,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:35:30,787 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 41 [2019-08-05 10:35:30,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:30,788 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:35:30,788 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:35:30,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:35:30,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:35:30,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:35:30,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:35:30,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:35:30,792 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2019-08-05 10:35:30,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:30,793 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:35:30,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:35:30,793 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:35:30,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:35:30,794 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:30,794 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 1, 1] [2019-08-05 10:35:30,794 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:30,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:30,795 INFO L82 PathProgramCache]: Analyzing trace with hash 401559676, now seen corresponding path program 20 times [2019-08-05 10:35:30,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:30,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:35:30,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:30,865 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:30,865 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:30,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:30,924 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:30,925 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:32,236 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:32,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:32,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:35:32,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:35:32,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:35:32,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:35:32,238 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 23 states. [2019-08-05 10:35:32,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:32,318 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:35:32,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:35:32,318 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2019-08-05 10:35:32,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:32,319 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:35:32,319 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:35:32,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:35:32,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:35:32,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:35:32,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:35:32,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:35:32,324 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2019-08-05 10:35:32,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:32,325 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:35:32,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:35:32,325 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:35:32,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:35:32,326 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:32,326 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 1, 1] [2019-08-05 10:35:32,326 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:32,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:32,326 INFO L82 PathProgramCache]: Analyzing trace with hash -648198201, now seen corresponding path program 21 times [2019-08-05 10:35:32,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:32,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:35:32,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:32,397 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:32,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:32,460 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:32,461 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:32,461 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:33,000 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:33,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:33,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:35:33,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:35:33,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:35:33,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:35:33,002 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 24 states. [2019-08-05 10:35:33,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:33,107 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:35:33,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:35:33,113 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2019-08-05 10:35:33,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:33,114 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:35:33,114 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:35:33,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:35:33,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:35:33,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:35:33,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:35:33,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:35:33,118 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2019-08-05 10:35:33,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:33,118 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:35:33,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:35:33,118 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:35:33,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:35:33,119 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:33,119 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 1, 1] [2019-08-05 10:35:33,119 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:33,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:33,120 INFO L82 PathProgramCache]: Analyzing trace with hash -148203438, now seen corresponding path program 22 times [2019-08-05 10:35:33,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:33,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:33,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:35:33,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:33,194 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:33,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:33,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:33,235 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:33,235 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:34,608 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:34,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:34,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:35:34,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:35:34,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:35:34,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:35:34,610 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 25 states. [2019-08-05 10:35:34,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:34,722 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:35:34,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:35:34,722 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2019-08-05 10:35:34,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:34,723 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:35:34,723 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:35:34,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:35:34,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:35:34,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:35:34,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:35:34,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:35:34,727 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2019-08-05 10:35:34,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:34,728 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:35:34,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:35:34,728 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:35:34,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:35:34,729 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:34,729 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 1, 1] [2019-08-05 10:35:34,729 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:34,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:34,729 INFO L82 PathProgramCache]: Analyzing trace with hash -689573347, now seen corresponding path program 23 times [2019-08-05 10:35:34,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:34,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:35:34,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:34,806 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:34,806 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:34,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:34,839 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:34,839 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:35,254 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:35,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:35,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:35:35,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:35:35,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:35:35,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:35:35,256 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 26 states. [2019-08-05 10:35:35,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:35,333 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:35:35,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:35:35,334 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 49 [2019-08-05 10:35:35,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:35,335 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:35:35,335 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:35:35,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:35:35,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:35:35,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:35:35,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:35:35,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:35:35,339 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2019-08-05 10:35:35,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:35,339 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:35:35,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:35:35,340 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:35:35,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:35:35,340 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:35,341 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 1, 1] [2019-08-05 10:35:35,341 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:35,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:35,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1255013080, now seen corresponding path program 24 times [2019-08-05 10:35:35,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:35,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:35:35,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:35,400 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:35,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:35,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:35,421 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:35,421 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:36,103 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:36,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:36,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:35:36,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:35:36,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:35:36,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:35:36,104 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 27 states. [2019-08-05 10:35:36,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:36,206 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:35:36,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:35:36,206 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51 [2019-08-05 10:35:36,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:36,207 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:35:36,207 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:35:36,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:35:36,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:35:36,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:35:36,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:35:36,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:35:36,211 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2019-08-05 10:35:36,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:36,211 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:35:36,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:35:36,211 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:35:36,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:35:36,212 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:36,212 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 1, 1] [2019-08-05 10:35:36,212 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:36,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:36,212 INFO L82 PathProgramCache]: Analyzing trace with hash 818250099, now seen corresponding path program 25 times [2019-08-05 10:35:36,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:36,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:35:36,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:36,269 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:36,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:36,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:36,289 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:36,289 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:36,882 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:36,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:36,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:35:36,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:35:36,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:35:36,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:35:36,884 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 28 states. [2019-08-05 10:35:36,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:36,996 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:35:36,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:35:36,997 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 53 [2019-08-05 10:35:36,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:36,997 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:35:36,997 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:35:36,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:35:36,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:35:37,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:35:37,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:35:37,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:35:37,001 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2019-08-05 10:35:37,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:37,002 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:35:37,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:35:37,002 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:35:37,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:35:37,003 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:37,003 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 1, 1] [2019-08-05 10:35:37,003 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:37,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:37,003 INFO L82 PathProgramCache]: Analyzing trace with hash 359339774, now seen corresponding path program 26 times [2019-08-05 10:35:37,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:37,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:35:37,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:37,087 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:37,088 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:37,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:37,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:37,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:39,347 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:39,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:39,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:35:39,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:35:39,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:35:39,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:35:39,349 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 29 states. [2019-08-05 10:35:39,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:39,451 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:35:39,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:35:39,452 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 55 [2019-08-05 10:35:39,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:39,452 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:35:39,453 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:35:39,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:35:39,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:35:39,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:35:39,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:35:39,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:35:39,456 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2019-08-05 10:35:39,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:39,457 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:35:39,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:35:39,457 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:35:39,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:35:39,457 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:39,457 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 1, 1] [2019-08-05 10:35:39,458 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:39,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:39,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1728148937, now seen corresponding path program 27 times [2019-08-05 10:35:39,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:39,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:35:39,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:39,533 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:39,533 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:39,598 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:39,598 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:39,598 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:40,484 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:40,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:40,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:35:40,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:35:40,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:35:40,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:35:40,486 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 30 states. [2019-08-05 10:35:40,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:40,621 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:35:40,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:35:40,622 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 57 [2019-08-05 10:35:40,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:40,622 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:35:40,623 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:35:40,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:35:40,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:35:40,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:35:40,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:35:40,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:35:40,626 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2019-08-05 10:35:40,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:40,626 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:35:40,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:35:40,626 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:35:40,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:35:40,627 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:40,627 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 1, 1] [2019-08-05 10:35:40,628 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:40,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:40,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1401205292, now seen corresponding path program 28 times [2019-08-05 10:35:40,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:40,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:35:40,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:40,704 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:40,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:40,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:40,778 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:40,778 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:41,434 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:41,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:41,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:35:41,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:35:41,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:35:41,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:35:41,436 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 31 states. [2019-08-05 10:35:41,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:41,602 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:35:41,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:35:41,603 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 59 [2019-08-05 10:35:41,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:41,604 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:35:41,604 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:35:41,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:35:41,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:35:41,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:35:41,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:35:41,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:35:41,608 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2019-08-05 10:35:41,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:41,608 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:35:41,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:35:41,608 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:35:41,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:35:41,609 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:41,609 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 1, 1] [2019-08-05 10:35:41,609 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:41,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:41,610 INFO L82 PathProgramCache]: Analyzing trace with hash 2061455135, now seen corresponding path program 29 times [2019-08-05 10:35:41,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:41,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:35:41,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:41,683 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:41,683 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:41,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:41,755 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:41,756 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:42,725 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:42,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:42,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:35:42,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:35:42,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:35:42,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:35:42,726 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 32 states. [2019-08-05 10:35:42,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:42,845 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:35:42,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:35:42,846 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 61 [2019-08-05 10:35:42,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:42,847 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:35:42,847 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:35:42,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:35:42,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:35:42,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:35:42,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:35:42,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:35:42,850 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2019-08-05 10:35:42,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:42,851 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:35:42,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:35:42,851 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:35:42,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:35:42,851 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:42,851 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 1, 1] [2019-08-05 10:35:42,852 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:42,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:42,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1078471082, now seen corresponding path program 30 times [2019-08-05 10:35:42,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:42,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:35:42,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:42,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:42,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:42,969 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:42,970 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:42,970 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:43,548 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:43,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:43,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:35:43,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:35:43,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:35:43,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:35:43,549 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 33 states. [2019-08-05 10:35:43,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:43,654 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:35:43,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:35:43,655 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 63 [2019-08-05 10:35:43,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:43,656 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:35:43,656 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:35:43,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:35:43,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:35:43,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:35:43,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:35:43,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:35:43,660 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2019-08-05 10:35:43,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:43,660 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:35:43,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:35:43,660 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:35:43,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:35:43,661 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:43,661 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 1, 1] [2019-08-05 10:35:43,661 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:43,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:43,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1323601269, now seen corresponding path program 31 times [2019-08-05 10:35:43,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:43,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:35:43,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:43,745 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:43,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:43,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:43,785 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:43,785 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:44,345 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:44,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:44,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:35:44,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:35:44,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:35:44,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:35:44,346 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 34 states. [2019-08-05 10:35:44,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:44,453 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:35:44,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:35:44,454 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 65 [2019-08-05 10:35:44,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:44,455 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:35:44,455 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:35:44,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:35:44,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:35:44,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:35:44,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:35:44,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:35:44,459 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2019-08-05 10:35:44,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:44,459 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:35:44,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:35:44,459 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:35:44,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:35:44,460 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:44,460 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 1, 1] [2019-08-05 10:35:44,460 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:44,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:44,460 INFO L82 PathProgramCache]: Analyzing trace with hash 670509696, now seen corresponding path program 32 times [2019-08-05 10:35:44,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:44,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:35:44,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:44,555 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:44,555 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:44,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:44,593 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:44,593 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:45,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:45,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:45,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:35:45,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:35:45,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:35:45,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:35:45,248 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 35 states. [2019-08-05 10:35:45,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:45,412 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:35:45,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:35:45,412 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 67 [2019-08-05 10:35:45,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:45,413 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:35:45,413 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:35:45,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:35:45,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:35:45,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:35:45,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:35:45,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:35:45,417 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2019-08-05 10:35:45,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:45,418 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:35:45,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:35:45,418 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:35:45,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:35:45,419 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:45,419 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 1, 1] [2019-08-05 10:35:45,419 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:45,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:45,419 INFO L82 PathProgramCache]: Analyzing trace with hash 114733259, now seen corresponding path program 33 times [2019-08-05 10:35:45,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:45,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 10:35:45,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:45,499 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:45,500 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:45,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:45,558 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:45,558 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:46,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:46,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:46,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:35:46,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:35:46,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:35:46,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:35:46,264 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 36 states. [2019-08-05 10:35:46,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:46,377 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:35:46,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:35:46,377 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 69 [2019-08-05 10:35:46,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:46,378 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:35:46,378 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:35:46,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:35:46,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:35:46,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:35:46,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:35:46,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:35:46,382 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2019-08-05 10:35:46,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:46,382 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:35:46,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:35:46,382 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:35:46,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:35:46,382 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:46,383 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 1, 1] [2019-08-05 10:35:46,383 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:46,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:46,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1410477994, now seen corresponding path program 34 times [2019-08-05 10:35:46,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:46,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:35:46,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:46,484 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:46,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:46,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:46,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:46,526 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:47,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:47,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:47,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:35:47,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:35:47,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:35:47,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:35:47,430 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 37 states. [2019-08-05 10:35:47,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:47,613 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:35:47,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:35:47,614 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 71 [2019-08-05 10:35:47,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:47,615 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:35:47,615 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:35:47,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:35:47,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:35:47,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:35:47,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:35:47,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:35:47,618 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2019-08-05 10:35:47,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:47,619 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:35:47,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:35:47,619 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:35:47,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:35:47,619 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:47,619 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 1, 1] [2019-08-05 10:35:47,620 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:47,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:47,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1740323105, now seen corresponding path program 35 times [2019-08-05 10:35:47,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:47,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 10:35:47,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:47,707 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:47,707 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:47,781 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:47,781 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:47,781 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:48,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:48,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:48,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:35:48,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:35:48,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:35:48,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:35:48,842 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 38 states. [2019-08-05 10:35:48,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:48,968 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:35:48,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:35:48,968 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 73 [2019-08-05 10:35:48,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:48,969 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:35:48,969 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:35:48,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:35:48,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:35:48,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:35:48,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:35:48,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:35:48,972 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2019-08-05 10:35:48,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:48,973 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:35:48,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:35:48,973 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:35:48,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:35:48,973 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:48,973 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 1, 1] [2019-08-05 10:35:48,973 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:48,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:48,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1708235564, now seen corresponding path program 36 times [2019-08-05 10:35:48,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:49,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 10:35:49,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:49,064 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:49,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:49,086 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:49,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:49,086 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:49,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:49,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:49,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:35:49,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:35:49,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:35:49,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:35:49,953 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 39 states. [2019-08-05 10:35:50,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:50,075 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:35:50,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:35:50,076 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 75 [2019-08-05 10:35:50,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:50,077 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:35:50,077 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:35:50,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:35:50,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:35:50,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:35:50,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:35:50,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:35:50,080 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2019-08-05 10:35:50,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:50,081 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:35:50,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:35:50,081 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:35:50,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:35:50,081 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:50,082 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 1, 1] [2019-08-05 10:35:50,082 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:50,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:50,082 INFO L82 PathProgramCache]: Analyzing trace with hash 936879735, now seen corresponding path program 37 times [2019-08-05 10:35:50,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:50,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 10:35:50,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:50,151 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:50,152 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:50,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:50,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:50,171 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:50,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:50,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:50,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:35:50,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:35:50,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:35:50,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:35:50,939 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 40 states. [2019-08-05 10:35:51,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:51,100 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:35:51,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:35:51,100 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 77 [2019-08-05 10:35:51,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:51,101 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:35:51,101 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:35:51,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:35:51,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:35:51,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:35:51,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:35:51,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:35:51,106 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2019-08-05 10:35:51,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:51,106 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:35:51,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:35:51,106 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:35:51,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:35:51,107 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:51,107 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 1, 1] [2019-08-05 10:35:51,107 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:51,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:51,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1601697022, now seen corresponding path program 38 times [2019-08-05 10:35:51,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:51,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-05 10:35:51,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:51,186 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:51,187 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:51,200 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:51,200 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:51,200 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:52,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:52,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:52,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:35:52,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:35:52,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:35:52,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:35:52,073 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 41 states. [2019-08-05 10:35:52,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:52,203 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:35:52,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:35:52,204 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 79 [2019-08-05 10:35:52,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:52,205 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:35:52,205 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:35:52,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:35:52,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:35:52,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:35:52,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:35:52,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:35:52,210 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2019-08-05 10:35:52,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:52,210 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:35:52,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:35:52,210 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:35:52,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:35:52,211 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:52,211 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 1, 1] [2019-08-05 10:35:52,211 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:52,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:52,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1632536371, now seen corresponding path program 39 times [2019-08-05 10:35:52,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:52,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 123 conjunts are in the unsatisfiable core [2019-08-05 10:35:52,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:52,326 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:52,326 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:52,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:52,403 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:52,404 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:53,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:53,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:53,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:35:53,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:35:53,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:35:53,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:35:53,512 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 42 states. [2019-08-05 10:35:53,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:53,661 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:35:53,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:35:53,662 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 81 [2019-08-05 10:35:53,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:53,663 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:35:53,663 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:35:53,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:35:53,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:35:53,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:35:53,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:35:53,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:35:53,667 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2019-08-05 10:35:53,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:53,667 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:35:53,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:35:53,667 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:35:53,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:35:53,668 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:53,668 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 1, 1] [2019-08-05 10:35:53,668 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:53,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:53,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1204379688, now seen corresponding path program 40 times [2019-08-05 10:35:53,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:53,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 126 conjunts are in the unsatisfiable core [2019-08-05 10:35:53,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:53,767 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:53,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:53,835 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:53,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:53,835 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:54,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:54,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:54,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:35:54,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:35:54,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:35:54,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:35:54,879 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 43 states. [2019-08-05 10:35:55,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:55,025 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:35:55,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:35:55,025 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 83 [2019-08-05 10:35:55,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:55,026 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:35:55,027 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:35:55,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:35:55,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:35:55,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 10:35:55,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:35:55,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 10:35:55,030 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2019-08-05 10:35:55,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:55,031 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 10:35:55,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:35:55,031 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 10:35:55,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:35:55,032 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:55,032 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 1, 1] [2019-08-05 10:35:55,032 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:55,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:55,032 INFO L82 PathProgramCache]: Analyzing trace with hash -2062667741, now seen corresponding path program 41 times [2019-08-05 10:35:55,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:55,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 129 conjunts are in the unsatisfiable core [2019-08-05 10:35:55,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:55,122 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:55,122 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:55,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:55,142 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:55,142 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:56,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:56,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:56,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:35:56,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:35:56,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:35:56,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:35:56,093 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 44 states. [2019-08-05 10:35:56,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:56,243 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 10:35:56,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:35:56,244 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 85 [2019-08-05 10:35:56,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:56,244 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:35:56,244 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:35:56,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:35:56,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:35:56,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 10:35:56,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:35:56,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 10:35:56,247 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2019-08-05 10:35:56,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:56,248 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 10:35:56,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:35:56,248 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 10:35:56,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 10:35:56,248 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:56,248 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 1, 1] [2019-08-05 10:35:56,249 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:56,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:56,249 INFO L82 PathProgramCache]: Analyzing trace with hash 2051201454, now seen corresponding path program 42 times [2019-08-05 10:35:56,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:56,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 132 conjunts are in the unsatisfiable core [2019-08-05 10:35:56,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:56,343 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:56,344 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:56,407 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:56,407 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:56,407 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:57,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:57,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:57,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:35:57,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:35:57,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:35:57,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:35:57,411 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 45 states. [2019-08-05 10:35:57,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:57,586 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 10:35:57,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:35:57,587 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 87 [2019-08-05 10:35:57,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:57,588 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:35:57,588 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:35:57,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:35:57,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:35:57,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 10:35:57,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 10:35:57,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 10:35:57,592 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2019-08-05 10:35:57,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:57,593 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 10:35:57,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:35:57,593 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 10:35:57,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 10:35:57,593 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:57,594 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 1, 1] [2019-08-05 10:35:57,594 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:57,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:57,594 INFO L82 PathProgramCache]: Analyzing trace with hash -185381767, now seen corresponding path program 43 times [2019-08-05 10:35:57,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:57,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 135 conjunts are in the unsatisfiable core [2019-08-05 10:35:57,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:57,695 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:57,695 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:57,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:57,764 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:57,764 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:35:58,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:58,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:58,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:35:58,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:35:58,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:35:58,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:35:58,733 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 46 states. [2019-08-05 10:35:58,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:58,888 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 10:35:58,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:35:58,889 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 89 [2019-08-05 10:35:58,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:58,890 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:35:58,890 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:35:58,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:35:58,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:35:58,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 10:35:58,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 10:35:58,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 10:35:58,894 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2019-08-05 10:35:58,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:58,894 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 10:35:58,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:35:58,894 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 10:35:58,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:35:58,895 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:58,895 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 1, 1] [2019-08-05 10:35:58,895 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:58,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:58,895 INFO L82 PathProgramCache]: Analyzing trace with hash -2058209148, now seen corresponding path program 44 times [2019-08-05 10:35:58,896 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:58,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 138 conjunts are in the unsatisfiable core [2019-08-05 10:35:58,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:59,012 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:35:59,013 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:35:59,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:35:59,036 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:35:59,036 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:00,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:00,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:00,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:36:00,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:36:00,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:36:00,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:36:00,138 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 47 states. [2019-08-05 10:36:00,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:00,603 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 10:36:00,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:36:00,603 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 91 [2019-08-05 10:36:00,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:00,604 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:36:00,604 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:36:00,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:36:00,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:36:00,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-05 10:36:00,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 10:36:00,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-05 10:36:00,607 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2019-08-05 10:36:00,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:00,608 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-05 10:36:00,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:36:00,608 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-05 10:36:00,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 10:36:00,608 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:00,608 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 1, 1] [2019-08-05 10:36:00,608 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:00,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:00,609 INFO L82 PathProgramCache]: Analyzing trace with hash 2040942031, now seen corresponding path program 45 times [2019-08-05 10:36:00,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:00,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 141 conjunts are in the unsatisfiable core [2019-08-05 10:36:00,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:00,710 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:36:00,710 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:00,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:00,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:00,772 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:02,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:02,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:02,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:36:02,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:36:02,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:36:02,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:36:02,017 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 48 states. [2019-08-05 10:36:02,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:02,163 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 10:36:02,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:36:02,164 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 93 [2019-08-05 10:36:02,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:02,165 INFO L225 Difference]: With dead ends: 96 [2019-08-05 10:36:02,165 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 10:36:02,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:36:02,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 10:36:02,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-05 10:36:02,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 10:36:02,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-05 10:36:02,168 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2019-08-05 10:36:02,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:02,169 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-05 10:36:02,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:36:02,169 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-05 10:36:02,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 10:36:02,169 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:02,170 INFO L399 BasicCegarLoop]: trace histogram [47, 46, 1, 1] [2019-08-05 10:36:02,170 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:02,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:02,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1454752678, now seen corresponding path program 46 times [2019-08-05 10:36:02,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:02,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 144 conjunts are in the unsatisfiable core [2019-08-05 10:36:02,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:02,287 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:36:02,287 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:02,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:02,340 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:02,340 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:03,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:03,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:03,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:36:03,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:36:03,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:36:03,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:36:03,924 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 49 states. [2019-08-05 10:36:04,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:04,074 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 10:36:04,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:36:04,075 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 95 [2019-08-05 10:36:04,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:04,076 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:36:04,076 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:36:04,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:36:04,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:36:04,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 10:36:04,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 10:36:04,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-05 10:36:04,080 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2019-08-05 10:36:04,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:04,080 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-05 10:36:04,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:36:04,080 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-05 10:36:04,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 10:36:04,081 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:04,081 INFO L399 BasicCegarLoop]: trace histogram [48, 47, 1, 1] [2019-08-05 10:36:04,081 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:04,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:04,081 INFO L82 PathProgramCache]: Analyzing trace with hash 2142024741, now seen corresponding path program 47 times [2019-08-05 10:36:04,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:04,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 147 conjunts are in the unsatisfiable core [2019-08-05 10:36:04,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:04,166 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:36:04,167 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:04,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:04,189 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:04,189 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:05,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:05,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:05,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:36:05,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:36:05,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:36:05,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:36:05,330 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 50 states. [2019-08-05 10:36:05,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:05,491 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 10:36:05,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:36:05,492 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 97 [2019-08-05 10:36:05,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:05,492 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:36:05,493 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:36:05,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:36:05,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:36:05,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 10:36:05,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:36:05,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 10:36:05,496 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2019-08-05 10:36:05,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:05,497 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 10:36:05,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:36:05,497 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 10:36:05,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:36:05,497 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:05,498 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 1, 1] [2019-08-05 10:36:05,498 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:05,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:05,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1196451120, now seen corresponding path program 48 times [2019-08-05 10:36:05,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:05,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:05,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 150 conjunts are in the unsatisfiable core [2019-08-05 10:36:05,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:05,596 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:36:05,596 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:05,632 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:05,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:05,632 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:06,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:06,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:06,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:36:06,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:36:06,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:36:06,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:36:06,770 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 51 states. [2019-08-05 10:36:06,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:06,929 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 10:36:06,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:36:06,930 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 99 [2019-08-05 10:36:06,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:06,931 INFO L225 Difference]: With dead ends: 102 [2019-08-05 10:36:06,931 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 10:36:06,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:36:06,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 10:36:06,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-08-05 10:36:06,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:36:06,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-08-05 10:36:06,934 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2019-08-05 10:36:06,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:06,934 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-08-05 10:36:06,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:36:06,935 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-08-05 10:36:06,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 10:36:06,935 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:06,935 INFO L399 BasicCegarLoop]: trace histogram [50, 49, 1, 1] [2019-08-05 10:36:06,935 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:06,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:06,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1261699205, now seen corresponding path program 49 times [2019-08-05 10:36:06,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:07,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 153 conjunts are in the unsatisfiable core [2019-08-05 10:36:07,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:07,036 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:36:07,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:07,057 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:07,057 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:07,057 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:08,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:08,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:08,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:36:08,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:36:08,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:36:08,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:36:08,577 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 52 states. [2019-08-05 10:36:08,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:08,744 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 10:36:08,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:36:08,744 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 101 [2019-08-05 10:36:08,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:08,746 INFO L225 Difference]: With dead ends: 104 [2019-08-05 10:36:08,746 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 10:36:08,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:36:08,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 10:36:08,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-08-05 10:36:08,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 10:36:08,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-08-05 10:36:08,749 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2019-08-05 10:36:08,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:08,749 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-08-05 10:36:08,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:36:08,749 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-08-05 10:36:08,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 10:36:08,750 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:08,750 INFO L399 BasicCegarLoop]: trace histogram [51, 50, 1, 1] [2019-08-05 10:36:08,750 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:08,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:08,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1312148730, now seen corresponding path program 50 times [2019-08-05 10:36:08,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:08,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 156 conjunts are in the unsatisfiable core [2019-08-05 10:36:08,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:08,878 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:36:08,878 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:08,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:08,952 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:08,952 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:10,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:10,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:10,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:36:10,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:36:10,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:36:10,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:36:10,605 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 53 states. [2019-08-05 10:36:10,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:10,825 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 10:36:10,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:36:10,826 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 103 [2019-08-05 10:36:10,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:10,827 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:36:10,827 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 10:36:10,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:36:10,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 10:36:10,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-08-05 10:36:10,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 10:36:10,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-08-05 10:36:10,831 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2019-08-05 10:36:10,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:10,831 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-08-05 10:36:10,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:36:10,831 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-08-05 10:36:10,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 10:36:10,832 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:10,832 INFO L399 BasicCegarLoop]: trace histogram [52, 51, 1, 1] [2019-08-05 10:36:10,832 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:10,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:10,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1745465297, now seen corresponding path program 51 times [2019-08-05 10:36:10,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:10,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 159 conjunts are in the unsatisfiable core [2019-08-05 10:36:10,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:10,962 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:36:10,962 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:11,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:11,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:11,024 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:12,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:12,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:12,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:36:12,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:36:12,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:36:12,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:36:12,873 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 54 states. [2019-08-05 10:36:13,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:13,113 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-05 10:36:13,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:36:13,114 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 105 [2019-08-05 10:36:13,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:13,115 INFO L225 Difference]: With dead ends: 108 [2019-08-05 10:36:13,115 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 10:36:13,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:36:13,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 10:36:13,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-08-05 10:36:13,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 10:36:13,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-08-05 10:36:13,118 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2019-08-05 10:36:13,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:13,118 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-08-05 10:36:13,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:36:13,118 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-08-05 10:36:13,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 10:36:13,119 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:13,119 INFO L399 BasicCegarLoop]: trace histogram [53, 52, 1, 1] [2019-08-05 10:36:13,119 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:13,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:13,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1940052516, now seen corresponding path program 52 times [2019-08-05 10:36:13,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:13,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 162 conjunts are in the unsatisfiable core [2019-08-05 10:36:13,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:13,235 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:36:13,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:13,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:13,306 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:13,306 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:14,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:14,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:14,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:36:14,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:36:14,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:36:14,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:36:14,694 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 55 states. [2019-08-05 10:36:14,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:14,868 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-05 10:36:14,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:36:14,869 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 107 [2019-08-05 10:36:14,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:14,870 INFO L225 Difference]: With dead ends: 110 [2019-08-05 10:36:14,870 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 10:36:14,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:36:14,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 10:36:14,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-08-05 10:36:14,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 10:36:14,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-08-05 10:36:14,874 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2019-08-05 10:36:14,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:14,875 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-08-05 10:36:14,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:36:14,879 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-08-05 10:36:14,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 10:36:14,879 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:14,879 INFO L399 BasicCegarLoop]: trace histogram [54, 53, 1, 1] [2019-08-05 10:36:14,880 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:14,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:14,880 INFO L82 PathProgramCache]: Analyzing trace with hash -374651609, now seen corresponding path program 53 times [2019-08-05 10:36:14,881 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:14,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:14,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 165 conjunts are in the unsatisfiable core [2019-08-05 10:36:14,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:15,002 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:36:15,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:15,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:15,031 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:15,031 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:16,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:16,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:16,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:36:16,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:36:16,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:36:16,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:36:16,440 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 56 states. [2019-08-05 10:36:16,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:16,631 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-08-05 10:36:16,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:36:16,631 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 109 [2019-08-05 10:36:16,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:16,632 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:36:16,632 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 10:36:16,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:36:16,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 10:36:16,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-08-05 10:36:16,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 10:36:16,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-08-05 10:36:16,635 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2019-08-05 10:36:16,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:16,636 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-08-05 10:36:16,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:36:16,636 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-08-05 10:36:16,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 10:36:16,637 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:16,637 INFO L399 BasicCegarLoop]: trace histogram [55, 54, 1, 1] [2019-08-05 10:36:16,637 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:16,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:16,638 INFO L82 PathProgramCache]: Analyzing trace with hash 737066418, now seen corresponding path program 54 times [2019-08-05 10:36:16,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:16,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 168 conjunts are in the unsatisfiable core [2019-08-05 10:36:16,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:16,762 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:36:16,762 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:16,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:16,781 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:16,781 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:18,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:18,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:18,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:36:18,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:36:18,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:36:18,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:36:18,511 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 57 states. [2019-08-05 10:36:18,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:18,696 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-08-05 10:36:18,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:36:18,697 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 111 [2019-08-05 10:36:18,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:18,698 INFO L225 Difference]: With dead ends: 114 [2019-08-05 10:36:18,698 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 10:36:18,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:36:18,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 10:36:18,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-08-05 10:36:18,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 10:36:18,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-08-05 10:36:18,702 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 111 [2019-08-05 10:36:18,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:18,702 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-08-05 10:36:18,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:36:18,703 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-08-05 10:36:18,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 10:36:18,703 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:18,703 INFO L399 BasicCegarLoop]: trace histogram [56, 55, 1, 1] [2019-08-05 10:36:18,704 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:18,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:18,704 INFO L82 PathProgramCache]: Analyzing trace with hash -348766339, now seen corresponding path program 55 times [2019-08-05 10:36:18,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:18,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 171 conjunts are in the unsatisfiable core [2019-08-05 10:36:18,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:18,792 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:36:18,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:18,805 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:18,805 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:18,805 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:20,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:20,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:20,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:36:20,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:36:20,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:36:20,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:36:20,319 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 58 states. [2019-08-05 10:36:21,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:21,024 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-05 10:36:21,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:36:21,024 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 113 [2019-08-05 10:36:21,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:21,025 INFO L225 Difference]: With dead ends: 116 [2019-08-05 10:36:21,026 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 10:36:21,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:36:21,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 10:36:21,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-08-05 10:36:21,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 10:36:21,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-08-05 10:36:21,029 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 113 [2019-08-05 10:36:21,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:21,029 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-08-05 10:36:21,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:36:21,029 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-08-05 10:36:21,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 10:36:21,030 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:21,030 INFO L399 BasicCegarLoop]: trace histogram [57, 56, 1, 1] [2019-08-05 10:36:21,030 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:21,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:21,031 INFO L82 PathProgramCache]: Analyzing trace with hash -156992888, now seen corresponding path program 56 times [2019-08-05 10:36:21,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:21,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 174 conjunts are in the unsatisfiable core [2019-08-05 10:36:21,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:21,138 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:36:21,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:21,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:21,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:21,175 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:22,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:22,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:22,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:36:22,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:36:22,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:36:22,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:36:22,715 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 59 states. [2019-08-05 10:36:22,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:22,901 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-08-05 10:36:22,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:36:22,902 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 115 [2019-08-05 10:36:22,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:22,903 INFO L225 Difference]: With dead ends: 118 [2019-08-05 10:36:22,903 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 10:36:22,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:36:22,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 10:36:22,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-08-05 10:36:22,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 10:36:22,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-08-05 10:36:22,906 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 115 [2019-08-05 10:36:22,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:22,906 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-08-05 10:36:22,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:36:22,907 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-08-05 10:36:22,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-05 10:36:22,907 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:22,907 INFO L399 BasicCegarLoop]: trace histogram [58, 57, 1, 1] [2019-08-05 10:36:22,908 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:22,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:22,908 INFO L82 PathProgramCache]: Analyzing trace with hash -546300205, now seen corresponding path program 57 times [2019-08-05 10:36:22,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:23,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 177 conjunts are in the unsatisfiable core [2019-08-05 10:36:23,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:23,052 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:36:23,052 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:23,132 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:23,132 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:23,132 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:25,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:25,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:25,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:36:25,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:36:25,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:36:25,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:36:25,088 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 60 states. [2019-08-05 10:36:25,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:25,286 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-08-05 10:36:25,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:36:25,287 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 117 [2019-08-05 10:36:25,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:25,288 INFO L225 Difference]: With dead ends: 120 [2019-08-05 10:36:25,288 INFO L226 Difference]: Without dead ends: 120 [2019-08-05 10:36:25,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:36:25,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-08-05 10:36:25,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-08-05 10:36:25,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-08-05 10:36:25,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-08-05 10:36:25,291 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 117 [2019-08-05 10:36:25,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:25,291 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-08-05 10:36:25,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:36:25,292 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-08-05 10:36:25,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-08-05 10:36:25,292 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:25,293 INFO L399 BasicCegarLoop]: trace histogram [59, 58, 1, 1] [2019-08-05 10:36:25,293 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:25,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:25,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1008477090, now seen corresponding path program 58 times [2019-08-05 10:36:25,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:25,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 180 conjunts are in the unsatisfiable core [2019-08-05 10:36:25,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:25,430 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:36:25,431 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:25,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:25,506 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:25,506 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:28,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:28,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:28,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:36:28,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:36:28,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:36:28,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:36:28,658 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 61 states. [2019-08-05 10:36:28,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:28,883 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-08-05 10:36:28,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:36:28,884 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 119 [2019-08-05 10:36:28,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:28,885 INFO L225 Difference]: With dead ends: 122 [2019-08-05 10:36:28,885 INFO L226 Difference]: Without dead ends: 122 [2019-08-05 10:36:28,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:36:28,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-05 10:36:28,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-08-05 10:36:28,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-08-05 10:36:28,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-08-05 10:36:28,888 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 119 [2019-08-05 10:36:28,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:28,888 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-08-05 10:36:28,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:36:28,888 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-08-05 10:36:28,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-08-05 10:36:28,889 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:28,889 INFO L399 BasicCegarLoop]: trace histogram [60, 59, 1, 1] [2019-08-05 10:36:28,889 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:28,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:28,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1516135209, now seen corresponding path program 59 times [2019-08-05 10:36:28,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:28,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 183 conjunts are in the unsatisfiable core [2019-08-05 10:36:28,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:28,994 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:36:28,994 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:29,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:29,019 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:29,019 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:30,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:30,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:30,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:36:30,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:36:30,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:36:30,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:36:30,702 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 62 states. [2019-08-05 10:36:30,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:30,893 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2019-08-05 10:36:30,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:36:30,893 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 121 [2019-08-05 10:36:30,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:30,894 INFO L225 Difference]: With dead ends: 124 [2019-08-05 10:36:30,894 INFO L226 Difference]: Without dead ends: 124 [2019-08-05 10:36:30,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:36:30,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-08-05 10:36:30,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2019-08-05 10:36:30,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-05 10:36:30,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2019-08-05 10:36:30,898 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 121 [2019-08-05 10:36:30,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:30,898 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2019-08-05 10:36:30,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:36:30,898 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2019-08-05 10:36:30,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-08-05 10:36:30,899 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:30,899 INFO L399 BasicCegarLoop]: trace histogram [61, 60, 1, 1] [2019-08-05 10:36:30,899 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:30,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:30,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1012032308, now seen corresponding path program 60 times [2019-08-05 10:36:30,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:30,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:30,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 186 conjunts are in the unsatisfiable core [2019-08-05 10:36:30,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:31,011 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:36:31,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:31,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:31,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:31,030 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:32,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:32,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:32,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:36:32,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:36:32,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:36:32,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:36:32,768 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 63 states. [2019-08-05 10:36:32,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:32,964 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-08-05 10:36:32,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:36:32,964 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 123 [2019-08-05 10:36:32,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:32,965 INFO L225 Difference]: With dead ends: 126 [2019-08-05 10:36:32,965 INFO L226 Difference]: Without dead ends: 126 [2019-08-05 10:36:32,966 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:36:32,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-08-05 10:36:32,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-08-05 10:36:32,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-08-05 10:36:32,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2019-08-05 10:36:32,969 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 123 [2019-08-05 10:36:32,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:32,969 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2019-08-05 10:36:32,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:36:32,970 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2019-08-05 10:36:32,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-08-05 10:36:32,970 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:32,970 INFO L399 BasicCegarLoop]: trace histogram [62, 61, 1, 1] [2019-08-05 10:36:32,971 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:32,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:32,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1900448895, now seen corresponding path program 61 times [2019-08-05 10:36:32,972 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:33,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:33,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 189 conjunts are in the unsatisfiable core [2019-08-05 10:36:33,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:33,067 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:36:33,067 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:33,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:33,070 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:33,070 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:35,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:35,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:35,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:36:35,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:36:35,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:36:35,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:36:35,158 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 64 states. [2019-08-05 10:36:35,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:35,402 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2019-08-05 10:36:35,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:36:35,403 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 125 [2019-08-05 10:36:35,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:35,404 INFO L225 Difference]: With dead ends: 128 [2019-08-05 10:36:35,404 INFO L226 Difference]: Without dead ends: 128 [2019-08-05 10:36:35,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:36:35,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-08-05 10:36:35,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-08-05 10:36:35,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-08-05 10:36:35,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2019-08-05 10:36:35,406 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 125 [2019-08-05 10:36:35,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:35,406 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2019-08-05 10:36:35,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:36:35,407 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2019-08-05 10:36:35,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-08-05 10:36:35,407 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:35,407 INFO L399 BasicCegarLoop]: trace histogram [63, 62, 1, 1] [2019-08-05 10:36:35,407 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:35,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:35,408 INFO L82 PathProgramCache]: Analyzing trace with hash 970297098, now seen corresponding path program 62 times [2019-08-05 10:36:35,408 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:35,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 192 conjunts are in the unsatisfiable core [2019-08-05 10:36:35,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:35,510 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:36:35,511 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:35,527 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:35,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:35,527 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:37,388 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:37,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:37,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:36:37,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:36:37,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:36:37,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:36:37,390 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 65 states. [2019-08-05 10:36:37,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:37,599 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2019-08-05 10:36:37,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:36:37,599 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 127 [2019-08-05 10:36:37,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:37,601 INFO L225 Difference]: With dead ends: 130 [2019-08-05 10:36:37,601 INFO L226 Difference]: Without dead ends: 130 [2019-08-05 10:36:37,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:36:37,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-08-05 10:36:37,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-08-05 10:36:37,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-08-05 10:36:37,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2019-08-05 10:36:37,604 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 127 [2019-08-05 10:36:37,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:37,604 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2019-08-05 10:36:37,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:36:37,605 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2019-08-05 10:36:37,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-08-05 10:36:37,605 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:37,605 INFO L399 BasicCegarLoop]: trace histogram [64, 63, 1, 1] [2019-08-05 10:36:37,606 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:37,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:37,606 INFO L82 PathProgramCache]: Analyzing trace with hash 447617749, now seen corresponding path program 63 times [2019-08-05 10:36:37,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:37,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 195 conjunts are in the unsatisfiable core [2019-08-05 10:36:37,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:37,706 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:36:37,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:37,734 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:37,734 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:37,734 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:39,852 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:39,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:39,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:36:39,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:36:39,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:36:39,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:36:39,854 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 66 states. [2019-08-05 10:36:40,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:40,082 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2019-08-05 10:36:40,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:36:40,082 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 129 [2019-08-05 10:36:40,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:40,083 INFO L225 Difference]: With dead ends: 132 [2019-08-05 10:36:40,083 INFO L226 Difference]: Without dead ends: 132 [2019-08-05 10:36:40,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:36:40,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-08-05 10:36:40,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-08-05 10:36:40,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-08-05 10:36:40,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2019-08-05 10:36:40,087 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 129 [2019-08-05 10:36:40,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:40,087 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2019-08-05 10:36:40,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:36:40,087 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2019-08-05 10:36:40,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-08-05 10:36:40,088 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:40,088 INFO L399 BasicCegarLoop]: trace histogram [65, 64, 1, 1] [2019-08-05 10:36:40,088 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:40,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:40,088 INFO L82 PathProgramCache]: Analyzing trace with hash 663936992, now seen corresponding path program 64 times [2019-08-05 10:36:40,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:40,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 198 conjunts are in the unsatisfiable core [2019-08-05 10:36:40,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:40,197 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:36:40,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:40,207 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:40,207 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:40,207 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:42,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:42,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:42,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:36:42,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:36:42,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:36:42,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:36:42,142 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 67 states. [2019-08-05 10:36:42,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:42,360 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2019-08-05 10:36:42,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:36:42,361 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 131 [2019-08-05 10:36:42,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:42,362 INFO L225 Difference]: With dead ends: 134 [2019-08-05 10:36:42,362 INFO L226 Difference]: Without dead ends: 134 [2019-08-05 10:36:42,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:36:42,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-08-05 10:36:42,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-08-05 10:36:42,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-08-05 10:36:42,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2019-08-05 10:36:42,365 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 131 [2019-08-05 10:36:42,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:42,366 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2019-08-05 10:36:42,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:36:42,366 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2019-08-05 10:36:42,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-08-05 10:36:42,367 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:42,367 INFO L399 BasicCegarLoop]: trace histogram [66, 65, 1, 1] [2019-08-05 10:36:42,367 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:42,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:42,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1906667989, now seen corresponding path program 65 times [2019-08-05 10:36:42,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:42,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 201 conjunts are in the unsatisfiable core [2019-08-05 10:36:42,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:42,537 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:36:42,538 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:42,609 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:42,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:42,610 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:45,189 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:45,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:45,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:36:45,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:36:45,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:36:45,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:36:45,190 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 68 states. [2019-08-05 10:36:45,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:45,404 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2019-08-05 10:36:45,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:36:45,405 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 133 [2019-08-05 10:36:45,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:45,406 INFO L225 Difference]: With dead ends: 136 [2019-08-05 10:36:45,406 INFO L226 Difference]: Without dead ends: 136 [2019-08-05 10:36:45,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:36:45,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-08-05 10:36:45,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-08-05 10:36:45,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-08-05 10:36:45,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-08-05 10:36:45,409 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 133 [2019-08-05 10:36:45,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:45,410 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-08-05 10:36:45,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:36:45,410 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-08-05 10:36:45,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-08-05 10:36:45,410 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:45,410 INFO L399 BasicCegarLoop]: trace histogram [67, 66, 1, 1] [2019-08-05 10:36:45,410 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:45,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:45,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1643107766, now seen corresponding path program 66 times [2019-08-05 10:36:45,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:45,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 204 conjunts are in the unsatisfiable core [2019-08-05 10:36:45,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:45,536 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:36:45,536 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:45,610 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:45,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:45,610 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:47,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:47,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:47,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:36:47,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:36:47,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:36:47,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:36:47,762 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 69 states. [2019-08-05 10:36:48,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:48,113 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2019-08-05 10:36:48,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:36:48,113 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 135 [2019-08-05 10:36:48,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:48,114 INFO L225 Difference]: With dead ends: 138 [2019-08-05 10:36:48,114 INFO L226 Difference]: Without dead ends: 138 [2019-08-05 10:36:48,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:36:48,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-08-05 10:36:48,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2019-08-05 10:36:48,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-08-05 10:36:48,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2019-08-05 10:36:48,118 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 135 [2019-08-05 10:36:48,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:48,120 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2019-08-05 10:36:48,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:36:48,120 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2019-08-05 10:36:48,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-08-05 10:36:48,120 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:48,120 INFO L399 BasicCegarLoop]: trace histogram [68, 67, 1, 1] [2019-08-05 10:36:48,121 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:48,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:48,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1521391999, now seen corresponding path program 67 times [2019-08-05 10:36:48,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:48,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 207 conjunts are in the unsatisfiable core [2019-08-05 10:36:48,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:48,233 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:36:48,233 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:48,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:48,243 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:48,243 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:50,725 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:50,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:50,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:36:50,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:36:50,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:36:50,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:36:50,727 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 70 states. [2019-08-05 10:36:51,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:51,343 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2019-08-05 10:36:51,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:36:51,343 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 137 [2019-08-05 10:36:51,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:51,345 INFO L225 Difference]: With dead ends: 140 [2019-08-05 10:36:51,345 INFO L226 Difference]: Without dead ends: 140 [2019-08-05 10:36:51,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:36:51,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-08-05 10:36:51,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-08-05 10:36:51,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-08-05 10:36:51,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2019-08-05 10:36:51,348 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 137 [2019-08-05 10:36:51,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:51,349 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2019-08-05 10:36:51,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:36:51,349 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2019-08-05 10:36:51,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-08-05 10:36:51,350 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:51,350 INFO L399 BasicCegarLoop]: trace histogram [69, 68, 1, 1] [2019-08-05 10:36:51,350 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:51,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:51,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1768820596, now seen corresponding path program 68 times [2019-08-05 10:36:51,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:51,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 210 conjunts are in the unsatisfiable core [2019-08-05 10:36:51,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:51,503 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:36:51,503 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:51,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:51,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:51,513 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:53,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:53,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:53,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:36:53,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:36:53,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:36:53,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:36:53,693 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 71 states. [2019-08-05 10:36:54,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:54,047 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2019-08-05 10:36:54,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:36:54,048 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 139 [2019-08-05 10:36:54,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:54,049 INFO L225 Difference]: With dead ends: 142 [2019-08-05 10:36:54,049 INFO L226 Difference]: Without dead ends: 142 [2019-08-05 10:36:54,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:36:54,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-08-05 10:36:54,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2019-08-05 10:36:54,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-08-05 10:36:54,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2019-08-05 10:36:54,052 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 139 [2019-08-05 10:36:54,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:54,052 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2019-08-05 10:36:54,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:36:54,052 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2019-08-05 10:36:54,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-08-05 10:36:54,052 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:54,053 INFO L399 BasicCegarLoop]: trace histogram [70, 69, 1, 1] [2019-08-05 10:36:54,053 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:54,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:54,053 INFO L82 PathProgramCache]: Analyzing trace with hash 970466263, now seen corresponding path program 69 times [2019-08-05 10:36:54,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:54,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:54,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 213 conjunts are in the unsatisfiable core [2019-08-05 10:36:54,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:54,235 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:36:54,236 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:54,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:54,276 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:54,276 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:56,514 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:56,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:56,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:36:56,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:36:56,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:36:56,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:36:56,515 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 72 states. [2019-08-05 10:36:56,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:56,758 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2019-08-05 10:36:56,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:36:56,758 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 141 [2019-08-05 10:36:56,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:56,759 INFO L225 Difference]: With dead ends: 144 [2019-08-05 10:36:56,759 INFO L226 Difference]: Without dead ends: 144 [2019-08-05 10:36:56,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:36:56,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-08-05 10:36:56,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-08-05 10:36:56,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-08-05 10:36:56,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2019-08-05 10:36:56,764 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 141 [2019-08-05 10:36:56,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:56,764 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2019-08-05 10:36:56,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:36:56,764 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2019-08-05 10:36:56,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-08-05 10:36:56,765 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:56,765 INFO L399 BasicCegarLoop]: trace histogram [71, 70, 1, 1] [2019-08-05 10:36:56,765 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:56,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:56,765 INFO L82 PathProgramCache]: Analyzing trace with hash 610185314, now seen corresponding path program 70 times [2019-08-05 10:36:56,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:56,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 216 conjunts are in the unsatisfiable core [2019-08-05 10:36:56,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:56,884 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:36:56,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:56,891 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:56,891 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:56,892 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:59,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:59,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:36:59,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:36:59,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:36:59,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:36:59,370 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 73 states. [2019-08-05 10:36:59,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:59,612 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2019-08-05 10:36:59,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:36:59,613 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 143 [2019-08-05 10:36:59,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:59,614 INFO L225 Difference]: With dead ends: 146 [2019-08-05 10:36:59,614 INFO L226 Difference]: Without dead ends: 146 [2019-08-05 10:36:59,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:36:59,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-08-05 10:36:59,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-08-05 10:36:59,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-08-05 10:36:59,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2019-08-05 10:36:59,618 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 143 [2019-08-05 10:36:59,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:59,618 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2019-08-05 10:36:59,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:36:59,618 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2019-08-05 10:36:59,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-08-05 10:36:59,619 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:59,619 INFO L399 BasicCegarLoop]: trace histogram [72, 71, 1, 1] [2019-08-05 10:36:59,619 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:59,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:59,619 INFO L82 PathProgramCache]: Analyzing trace with hash -2022422995, now seen corresponding path program 71 times [2019-08-05 10:36:59,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:59,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 219 conjunts are in the unsatisfiable core [2019-08-05 10:36:59,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:59,773 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:36:59,773 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:59,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:59,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:59,838 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:02,229 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:02,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:02,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:37:02,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:37:02,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:37:02,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:37:02,230 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 74 states. [2019-08-05 10:37:02,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:02,503 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2019-08-05 10:37:02,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:37:02,503 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 145 [2019-08-05 10:37:02,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:02,505 INFO L225 Difference]: With dead ends: 148 [2019-08-05 10:37:02,505 INFO L226 Difference]: Without dead ends: 148 [2019-08-05 10:37:02,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:37:02,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-08-05 10:37:02,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2019-08-05 10:37:02,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-08-05 10:37:02,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2019-08-05 10:37:02,508 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 145 [2019-08-05 10:37:02,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:02,509 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2019-08-05 10:37:02,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:37:02,509 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2019-08-05 10:37:02,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-08-05 10:37:02,509 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:02,510 INFO L399 BasicCegarLoop]: trace histogram [73, 72, 1, 1] [2019-08-05 10:37:02,510 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:02,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:02,510 INFO L82 PathProgramCache]: Analyzing trace with hash 2071696696, now seen corresponding path program 72 times [2019-08-05 10:37:02,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:02,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 222 conjunts are in the unsatisfiable core [2019-08-05 10:37:02,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:02,645 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:37:02,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:02,653 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:02,653 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:02,653 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:05,426 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:05,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:05,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:37:05,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:37:05,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:37:05,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:37:05,428 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 75 states. [2019-08-05 10:37:05,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:05,678 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2019-08-05 10:37:05,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:37:05,678 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 147 [2019-08-05 10:37:05,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:05,679 INFO L225 Difference]: With dead ends: 150 [2019-08-05 10:37:05,679 INFO L226 Difference]: Without dead ends: 150 [2019-08-05 10:37:05,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:37:05,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-08-05 10:37:05,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2019-08-05 10:37:05,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-08-05 10:37:05,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2019-08-05 10:37:05,683 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 147 [2019-08-05 10:37:05,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:05,683 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2019-08-05 10:37:05,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:37:05,683 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2019-08-05 10:37:05,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-08-05 10:37:05,684 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:05,684 INFO L399 BasicCegarLoop]: trace histogram [74, 73, 1, 1] [2019-08-05 10:37:05,684 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:05,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:05,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1964290685, now seen corresponding path program 73 times [2019-08-05 10:37:05,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:05,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:05,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 225 conjunts are in the unsatisfiable core [2019-08-05 10:37:05,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:05,855 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:37:05,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:05,915 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:05,916 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:05,916 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:10,688 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:10,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:10,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:37:10,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:37:10,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:37:10,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:37:10,690 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 76 states. [2019-08-05 10:37:10,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:10,969 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2019-08-05 10:37:10,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:37:10,970 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 149 [2019-08-05 10:37:10,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:10,971 INFO L225 Difference]: With dead ends: 152 [2019-08-05 10:37:10,971 INFO L226 Difference]: Without dead ends: 152 [2019-08-05 10:37:10,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:37:10,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-08-05 10:37:10,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-08-05 10:37:10,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-08-05 10:37:10,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2019-08-05 10:37:10,974 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 149 [2019-08-05 10:37:10,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:10,975 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2019-08-05 10:37:10,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:37:10,975 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2019-08-05 10:37:10,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-08-05 10:37:10,976 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:10,976 INFO L399 BasicCegarLoop]: trace histogram [75, 74, 1, 1] [2019-08-05 10:37:10,976 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:10,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:10,976 INFO L82 PathProgramCache]: Analyzing trace with hash 2102271758, now seen corresponding path program 74 times [2019-08-05 10:37:10,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:11,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 228 conjunts are in the unsatisfiable core [2019-08-05 10:37:11,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:11,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:37:11,168 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:11,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:11,246 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:11,246 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:13,967 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:13,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:13,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:37:13,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:37:13,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:37:13,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:37:13,969 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 77 states. [2019-08-05 10:37:14,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:14,244 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2019-08-05 10:37:14,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:37:14,244 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 151 [2019-08-05 10:37:14,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:14,245 INFO L225 Difference]: With dead ends: 154 [2019-08-05 10:37:14,245 INFO L226 Difference]: Without dead ends: 154 [2019-08-05 10:37:14,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:37:14,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-08-05 10:37:14,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-08-05 10:37:14,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-08-05 10:37:14,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2019-08-05 10:37:14,247 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 151 [2019-08-05 10:37:14,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:14,247 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2019-08-05 10:37:14,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:37:14,247 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2019-08-05 10:37:14,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-08-05 10:37:14,248 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:14,248 INFO L399 BasicCegarLoop]: trace histogram [76, 75, 1, 1] [2019-08-05 10:37:14,248 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:14,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:14,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1648540121, now seen corresponding path program 75 times [2019-08-05 10:37:14,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:14,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 231 conjunts are in the unsatisfiable core [2019-08-05 10:37:14,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:14,364 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:37:14,365 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:14,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:14,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:14,387 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:17,102 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:17,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:17,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:37:17,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:37:17,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:37:17,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:37:17,104 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 78 states. [2019-08-05 10:37:17,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:17,357 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2019-08-05 10:37:17,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:37:17,357 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 153 [2019-08-05 10:37:17,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:17,358 INFO L225 Difference]: With dead ends: 156 [2019-08-05 10:37:17,359 INFO L226 Difference]: Without dead ends: 156 [2019-08-05 10:37:17,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:37:17,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-08-05 10:37:17,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2019-08-05 10:37:17,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-08-05 10:37:17,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2019-08-05 10:37:17,362 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 153 [2019-08-05 10:37:17,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:17,362 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2019-08-05 10:37:17,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:37:17,362 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2019-08-05 10:37:17,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-08-05 10:37:17,363 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:17,363 INFO L399 BasicCegarLoop]: trace histogram [77, 76, 1, 1] [2019-08-05 10:37:17,363 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:17,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:17,363 INFO L82 PathProgramCache]: Analyzing trace with hash -595866140, now seen corresponding path program 76 times [2019-08-05 10:37:17,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:17,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 234 conjunts are in the unsatisfiable core [2019-08-05 10:37:17,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:17,517 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:37:17,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:17,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:17,539 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:17,539 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:20,389 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:20,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:20,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:37:20,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:37:20,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:37:20,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:37:20,391 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 79 states. [2019-08-05 10:37:20,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:20,654 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2019-08-05 10:37:20,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:37:20,654 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 155 [2019-08-05 10:37:20,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:20,655 INFO L225 Difference]: With dead ends: 158 [2019-08-05 10:37:20,656 INFO L226 Difference]: Without dead ends: 158 [2019-08-05 10:37:20,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:37:20,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-08-05 10:37:20,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2019-08-05 10:37:20,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-08-05 10:37:20,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2019-08-05 10:37:20,659 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 155 [2019-08-05 10:37:20,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:20,659 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2019-08-05 10:37:20,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:37:20,659 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2019-08-05 10:37:20,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-08-05 10:37:20,660 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:20,660 INFO L399 BasicCegarLoop]: trace histogram [78, 77, 1, 1] [2019-08-05 10:37:20,660 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:20,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:20,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1396700369, now seen corresponding path program 77 times [2019-08-05 10:37:20,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:20,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 237 conjunts are in the unsatisfiable core [2019-08-05 10:37:20,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:20,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:37:20,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:20,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:20,819 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:20,819 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:23,624 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:23,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:23,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:37:23,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:37:23,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:37:23,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:37:23,625 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 80 states. [2019-08-05 10:37:23,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:23,917 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2019-08-05 10:37:23,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:37:23,917 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 157 [2019-08-05 10:37:23,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:23,918 INFO L225 Difference]: With dead ends: 160 [2019-08-05 10:37:23,919 INFO L226 Difference]: Without dead ends: 160 [2019-08-05 10:37:23,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:37:23,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-08-05 10:37:23,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-08-05 10:37:23,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-08-05 10:37:23,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2019-08-05 10:37:23,922 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 157 [2019-08-05 10:37:23,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:23,922 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2019-08-05 10:37:23,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:37:23,923 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2019-08-05 10:37:23,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-08-05 10:37:23,923 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:23,924 INFO L399 BasicCegarLoop]: trace histogram [79, 78, 1, 1] [2019-08-05 10:37:23,924 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:23,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:23,924 INFO L82 PathProgramCache]: Analyzing trace with hash 2095718842, now seen corresponding path program 78 times [2019-08-05 10:37:23,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:24,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 240 conjunts are in the unsatisfiable core [2019-08-05 10:37:24,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:24,068 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:37:24,068 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:24,083 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:24,083 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:24,083 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:27,084 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:27,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:27,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:37:27,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:37:27,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:37:27,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:37:27,086 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 81 states. [2019-08-05 10:37:27,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:27,356 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2019-08-05 10:37:27,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:37:27,357 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 159 [2019-08-05 10:37:27,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:27,358 INFO L225 Difference]: With dead ends: 162 [2019-08-05 10:37:27,358 INFO L226 Difference]: Without dead ends: 162 [2019-08-05 10:37:27,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:37:27,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-08-05 10:37:27,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-08-05 10:37:27,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-08-05 10:37:27,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2019-08-05 10:37:27,361 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 159 [2019-08-05 10:37:27,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:27,361 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2019-08-05 10:37:27,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:37:27,361 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2019-08-05 10:37:27,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-08-05 10:37:27,362 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:27,362 INFO L399 BasicCegarLoop]: trace histogram [80, 79, 1, 1] [2019-08-05 10:37:27,362 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:27,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:27,363 INFO L82 PathProgramCache]: Analyzing trace with hash -353844859, now seen corresponding path program 79 times [2019-08-05 10:37:27,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:27,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 243 conjunts are in the unsatisfiable core [2019-08-05 10:37:27,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:27,529 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:37:27,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:27,553 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:27,554 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:27,554 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:30,786 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:30,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:30,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:37:30,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:37:30,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:37:30,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:37:30,787 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 82 states. [2019-08-05 10:37:31,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:31,064 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2019-08-05 10:37:31,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:37:31,065 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 161 [2019-08-05 10:37:31,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:31,066 INFO L225 Difference]: With dead ends: 164 [2019-08-05 10:37:31,066 INFO L226 Difference]: Without dead ends: 164 [2019-08-05 10:37:31,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:37:31,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-08-05 10:37:31,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-08-05 10:37:31,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-08-05 10:37:31,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2019-08-05 10:37:31,070 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 161 [2019-08-05 10:37:31,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:31,070 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2019-08-05 10:37:31,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:37:31,070 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2019-08-05 10:37:31,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-08-05 10:37:31,071 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:31,071 INFO L399 BasicCegarLoop]: trace histogram [81, 80, 1, 1] [2019-08-05 10:37:31,071 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:31,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:31,072 INFO L82 PathProgramCache]: Analyzing trace with hash -742483312, now seen corresponding path program 80 times [2019-08-05 10:37:31,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:31,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 246 conjunts are in the unsatisfiable core [2019-08-05 10:37:31,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:31,234 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:37:31,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:31,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:31,251 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:31,251 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:35,008 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:35,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:35,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:37:35,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:37:35,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:37:35,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:37:35,010 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 83 states. [2019-08-05 10:37:35,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:35,339 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2019-08-05 10:37:35,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:37:35,339 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 163 [2019-08-05 10:37:35,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:35,341 INFO L225 Difference]: With dead ends: 166 [2019-08-05 10:37:35,341 INFO L226 Difference]: Without dead ends: 166 [2019-08-05 10:37:35,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:37:35,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-08-05 10:37:35,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2019-08-05 10:37:35,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-08-05 10:37:35,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2019-08-05 10:37:35,344 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 163 [2019-08-05 10:37:35,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:35,344 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2019-08-05 10:37:35,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:37:35,344 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2019-08-05 10:37:35,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-08-05 10:37:35,345 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:35,345 INFO L399 BasicCegarLoop]: trace histogram [82, 81, 1, 1] [2019-08-05 10:37:35,345 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:35,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:35,345 INFO L82 PathProgramCache]: Analyzing trace with hash -561881893, now seen corresponding path program 81 times [2019-08-05 10:37:35,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:35,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 249 conjunts are in the unsatisfiable core [2019-08-05 10:37:35,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:35,497 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:37:35,498 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:35,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:35,517 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:35,517 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:38,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:38,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:38,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:37:38,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:37:38,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:37:38,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:37:38,618 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 84 states. [2019-08-05 10:37:38,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:38,897 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2019-08-05 10:37:38,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:37:38,897 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 165 [2019-08-05 10:37:38,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:38,898 INFO L225 Difference]: With dead ends: 168 [2019-08-05 10:37:38,898 INFO L226 Difference]: Without dead ends: 168 [2019-08-05 10:37:38,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:37:38,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-08-05 10:37:38,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-08-05 10:37:38,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-08-05 10:37:38,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2019-08-05 10:37:38,902 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 165 [2019-08-05 10:37:38,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:38,902 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2019-08-05 10:37:38,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:37:38,902 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2019-08-05 10:37:38,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-08-05 10:37:38,903 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:38,903 INFO L399 BasicCegarLoop]: trace histogram [83, 82, 1, 1] [2019-08-05 10:37:38,903 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:38,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:38,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1197389926, now seen corresponding path program 82 times [2019-08-05 10:37:38,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:39,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:39,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 252 conjunts are in the unsatisfiable core [2019-08-05 10:37:39,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:39,104 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:37:39,104 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:39,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:39,179 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:39,179 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:42,789 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:42,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:42,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:37:42,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:37:42,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:37:42,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:37:42,790 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 85 states. [2019-08-05 10:37:43,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:43,084 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2019-08-05 10:37:43,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:37:43,085 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 167 [2019-08-05 10:37:43,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:43,086 INFO L225 Difference]: With dead ends: 170 [2019-08-05 10:37:43,086 INFO L226 Difference]: Without dead ends: 170 [2019-08-05 10:37:43,087 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:37:43,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-08-05 10:37:43,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2019-08-05 10:37:43,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-08-05 10:37:43,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2019-08-05 10:37:43,089 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 167 [2019-08-05 10:37:43,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:43,089 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2019-08-05 10:37:43,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 10:37:43,089 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2019-08-05 10:37:43,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-08-05 10:37:43,090 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:43,090 INFO L399 BasicCegarLoop]: trace histogram [84, 83, 1, 1] [2019-08-05 10:37:43,090 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:43,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:43,090 INFO L82 PathProgramCache]: Analyzing trace with hash -359506639, now seen corresponding path program 83 times [2019-08-05 10:37:43,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:43,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 255 conjunts are in the unsatisfiable core [2019-08-05 10:37:43,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:43,263 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:37:43,263 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:43,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:43,282 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:43,282 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:46,668 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:46,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:46,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:37:46,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 10:37:46,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 10:37:46,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:37:46,670 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 86 states. [2019-08-05 10:37:46,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:46,969 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2019-08-05 10:37:46,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:37:46,970 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 169 [2019-08-05 10:37:46,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:46,971 INFO L225 Difference]: With dead ends: 172 [2019-08-05 10:37:46,971 INFO L226 Difference]: Without dead ends: 172 [2019-08-05 10:37:46,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:37:46,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-08-05 10:37:46,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2019-08-05 10:37:46,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-08-05 10:37:46,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2019-08-05 10:37:46,974 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 169 [2019-08-05 10:37:46,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:46,974 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2019-08-05 10:37:46,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 10:37:46,974 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2019-08-05 10:37:46,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-08-05 10:37:46,975 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:46,975 INFO L399 BasicCegarLoop]: trace histogram [85, 84, 1, 1] [2019-08-05 10:37:46,975 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:46,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:46,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1888486596, now seen corresponding path program 84 times [2019-08-05 10:37:46,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:47,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:47,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 258 conjunts are in the unsatisfiable core [2019-08-05 10:37:47,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:47,137 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:37:47,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:47,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:47,156 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:47,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:50,646 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:50,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:50,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 10:37:50,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 10:37:50,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 10:37:50,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:37:50,649 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 87 states. [2019-08-05 10:37:50,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:50,952 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2019-08-05 10:37:50,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:37:50,952 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 171 [2019-08-05 10:37:50,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:50,953 INFO L225 Difference]: With dead ends: 174 [2019-08-05 10:37:50,953 INFO L226 Difference]: Without dead ends: 174 [2019-08-05 10:37:50,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:37:50,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-08-05 10:37:50,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2019-08-05 10:37:50,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-08-05 10:37:50,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2019-08-05 10:37:50,957 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 171 [2019-08-05 10:37:50,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:50,957 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2019-08-05 10:37:50,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 10:37:50,957 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2019-08-05 10:37:50,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-08-05 10:37:50,958 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:50,958 INFO L399 BasicCegarLoop]: trace histogram [86, 85, 1, 1] [2019-08-05 10:37:50,959 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:50,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:50,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1935557255, now seen corresponding path program 85 times [2019-08-05 10:37:50,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:51,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 261 conjunts are in the unsatisfiable core [2019-08-05 10:37:51,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:51,153 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:37:51,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:51,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:51,185 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:51,185 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:54,540 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:54,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:54,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 10:37:54,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 10:37:54,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 10:37:54,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:37:54,542 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 88 states. [2019-08-05 10:37:54,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:54,834 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2019-08-05 10:37:54,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 10:37:54,835 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 173 [2019-08-05 10:37:54,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:54,836 INFO L225 Difference]: With dead ends: 176 [2019-08-05 10:37:54,836 INFO L226 Difference]: Without dead ends: 176 [2019-08-05 10:37:54,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:37:54,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-08-05 10:37:54,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2019-08-05 10:37:54,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-08-05 10:37:54,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2019-08-05 10:37:54,841 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 173 [2019-08-05 10:37:54,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:54,841 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2019-08-05 10:37:54,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 10:37:54,841 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2019-08-05 10:37:54,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-08-05 10:37:54,842 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:54,842 INFO L399 BasicCegarLoop]: trace histogram [87, 86, 1, 1] [2019-08-05 10:37:54,843 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:54,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:54,843 INFO L82 PathProgramCache]: Analyzing trace with hash 349692690, now seen corresponding path program 86 times [2019-08-05 10:37:54,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:55,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 264 conjunts are in the unsatisfiable core [2019-08-05 10:37:55,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:55,025 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:37:55,025 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:55,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:55,037 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:55,037 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:58,569 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:58,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:58,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 10:37:58,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 10:37:58,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 10:37:58,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:37:58,571 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 89 states. [2019-08-05 10:37:58,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:58,878 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2019-08-05 10:37:58,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 10:37:58,878 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 175 [2019-08-05 10:37:58,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:58,879 INFO L225 Difference]: With dead ends: 178 [2019-08-05 10:37:58,880 INFO L226 Difference]: Without dead ends: 178 [2019-08-05 10:37:58,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:37:58,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-08-05 10:37:58,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2019-08-05 10:37:58,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-08-05 10:37:58,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2019-08-05 10:37:58,883 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 175 [2019-08-05 10:37:58,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:58,883 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2019-08-05 10:37:58,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 10:37:58,883 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2019-08-05 10:37:58,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-08-05 10:37:58,884 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:58,884 INFO L399 BasicCegarLoop]: trace histogram [88, 87, 1, 1] [2019-08-05 10:37:58,884 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:58,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:58,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1047235805, now seen corresponding path program 87 times [2019-08-05 10:37:58,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:59,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 267 conjunts are in the unsatisfiable core [2019-08-05 10:37:59,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:59,104 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:37:59,104 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:59,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:59,144 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:59,144 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:02,775 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:02,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:02,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 10:38:02,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 10:38:02,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 10:38:02,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:38:02,776 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 90 states. [2019-08-05 10:38:03,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:03,085 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2019-08-05 10:38:03,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:38:03,085 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 177 [2019-08-05 10:38:03,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:03,086 INFO L225 Difference]: With dead ends: 180 [2019-08-05 10:38:03,087 INFO L226 Difference]: Without dead ends: 180 [2019-08-05 10:38:03,087 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:38:03,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-08-05 10:38:03,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2019-08-05 10:38:03,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-08-05 10:38:03,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2019-08-05 10:38:03,090 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 177 [2019-08-05 10:38:03,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:03,090 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2019-08-05 10:38:03,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 10:38:03,090 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2019-08-05 10:38:03,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-08-05 10:38:03,091 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:03,091 INFO L399 BasicCegarLoop]: trace histogram [89, 88, 1, 1] [2019-08-05 10:38:03,091 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:03,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:03,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1371271144, now seen corresponding path program 88 times [2019-08-05 10:38:03,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:03,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 270 conjunts are in the unsatisfiable core [2019-08-05 10:38:03,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:03,277 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:38:03,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:03,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:03,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:03,288 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:06,956 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:06,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:06,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 10:38:06,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 10:38:06,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 10:38:06,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:38:06,957 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 91 states. [2019-08-05 10:38:07,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:07,257 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2019-08-05 10:38:07,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 10:38:07,257 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 179 [2019-08-05 10:38:07,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:07,259 INFO L225 Difference]: With dead ends: 182 [2019-08-05 10:38:07,259 INFO L226 Difference]: Without dead ends: 182 [2019-08-05 10:38:07,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:38:07,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-08-05 10:38:07,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2019-08-05 10:38:07,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-08-05 10:38:07,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2019-08-05 10:38:07,262 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 179 [2019-08-05 10:38:07,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:07,263 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2019-08-05 10:38:07,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 10:38:07,263 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2019-08-05 10:38:07,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-08-05 10:38:07,263 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:07,264 INFO L399 BasicCegarLoop]: trace histogram [90, 89, 1, 1] [2019-08-05 10:38:07,264 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:07,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:07,264 INFO L82 PathProgramCache]: Analyzing trace with hash -763380685, now seen corresponding path program 89 times [2019-08-05 10:38:07,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:07,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 273 conjunts are in the unsatisfiable core [2019-08-05 10:38:07,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:07,440 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:38:07,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:07,454 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:07,454 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:07,454 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:11,280 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:11,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:11,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 10:38:11,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 10:38:11,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 10:38:11,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:38:11,282 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 92 states. [2019-08-05 10:38:11,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:11,600 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2019-08-05 10:38:11,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:38:11,601 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 181 [2019-08-05 10:38:11,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:11,602 INFO L225 Difference]: With dead ends: 184 [2019-08-05 10:38:11,602 INFO L226 Difference]: Without dead ends: 184 [2019-08-05 10:38:11,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:38:11,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-08-05 10:38:11,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-08-05 10:38:11,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-08-05 10:38:11,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2019-08-05 10:38:11,606 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 181 [2019-08-05 10:38:11,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:11,606 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2019-08-05 10:38:11,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 10:38:11,606 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2019-08-05 10:38:11,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-08-05 10:38:11,607 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:11,607 INFO L399 BasicCegarLoop]: trace histogram [91, 90, 1, 1] [2019-08-05 10:38:11,607 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:11,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:11,607 INFO L82 PathProgramCache]: Analyzing trace with hash 830579134, now seen corresponding path program 90 times [2019-08-05 10:38:11,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:11,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 276 conjunts are in the unsatisfiable core [2019-08-05 10:38:11,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:11,802 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:38:11,803 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:11,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:11,817 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:11,817 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:15,433 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:15,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:15,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 10:38:15,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 10:38:15,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 10:38:15,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:38:15,434 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 93 states. [2019-08-05 10:38:15,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:15,813 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2019-08-05 10:38:15,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 10:38:15,814 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 183 [2019-08-05 10:38:15,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:15,814 INFO L225 Difference]: With dead ends: 186 [2019-08-05 10:38:15,814 INFO L226 Difference]: Without dead ends: 186 [2019-08-05 10:38:15,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:38:15,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-08-05 10:38:15,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-08-05 10:38:15,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-08-05 10:38:15,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2019-08-05 10:38:15,817 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 183 [2019-08-05 10:38:15,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:15,817 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2019-08-05 10:38:15,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 10:38:15,818 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2019-08-05 10:38:15,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-08-05 10:38:15,818 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:15,819 INFO L399 BasicCegarLoop]: trace histogram [92, 91, 1, 1] [2019-08-05 10:38:15,819 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:15,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:15,819 INFO L82 PathProgramCache]: Analyzing trace with hash -677359479, now seen corresponding path program 91 times [2019-08-05 10:38:15,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:16,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 279 conjunts are in the unsatisfiable core [2019-08-05 10:38:16,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:16,024 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:38:16,025 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:16,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:16,043 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:16,043 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:19,861 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:19,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:19,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 10:38:19,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 10:38:19,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 10:38:19,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:38:19,863 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 94 states. [2019-08-05 10:38:20,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:20,198 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2019-08-05 10:38:20,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 10:38:20,198 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 185 [2019-08-05 10:38:20,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:20,200 INFO L225 Difference]: With dead ends: 188 [2019-08-05 10:38:20,200 INFO L226 Difference]: Without dead ends: 188 [2019-08-05 10:38:20,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:38:20,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-08-05 10:38:20,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2019-08-05 10:38:20,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-08-05 10:38:20,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2019-08-05 10:38:20,204 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 185 [2019-08-05 10:38:20,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:20,204 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2019-08-05 10:38:20,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 10:38:20,205 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2019-08-05 10:38:20,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-08-05 10:38:20,205 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:20,206 INFO L399 BasicCegarLoop]: trace histogram [93, 92, 1, 1] [2019-08-05 10:38:20,206 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:20,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:20,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1892579476, now seen corresponding path program 92 times [2019-08-05 10:38:20,207 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:20,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 282 conjunts are in the unsatisfiable core [2019-08-05 10:38:20,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:20,445 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:38:20,446 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:20,453 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:20,453 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:20,453 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:24,470 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:24,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:24,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 10:38:24,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 10:38:24,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 10:38:24,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:38:24,472 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 95 states. [2019-08-05 10:38:24,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:24,826 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2019-08-05 10:38:24,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 10:38:24,826 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 187 [2019-08-05 10:38:24,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:24,828 INFO L225 Difference]: With dead ends: 190 [2019-08-05 10:38:24,828 INFO L226 Difference]: Without dead ends: 190 [2019-08-05 10:38:24,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:38:24,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-08-05 10:38:24,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2019-08-05 10:38:24,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-08-05 10:38:24,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2019-08-05 10:38:24,832 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 187 [2019-08-05 10:38:24,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:24,832 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2019-08-05 10:38:24,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 10:38:24,832 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2019-08-05 10:38:24,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-08-05 10:38:24,833 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:24,833 INFO L399 BasicCegarLoop]: trace histogram [94, 93, 1, 1] [2019-08-05 10:38:24,833 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:24,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:24,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1997720031, now seen corresponding path program 93 times [2019-08-05 10:38:24,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:25,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 285 conjunts are in the unsatisfiable core [2019-08-05 10:38:25,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:25,071 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:38:25,072 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:25,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:25,089 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:25,089 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:29,195 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:29,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:29,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 10:38:29,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 10:38:29,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 10:38:29,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:38:29,197 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 96 states. [2019-08-05 10:38:29,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:29,525 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2019-08-05 10:38:29,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 10:38:29,525 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 189 [2019-08-05 10:38:29,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:29,526 INFO L225 Difference]: With dead ends: 192 [2019-08-05 10:38:29,527 INFO L226 Difference]: Without dead ends: 192 [2019-08-05 10:38:29,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:38:29,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-08-05 10:38:29,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2019-08-05 10:38:29,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-08-05 10:38:29,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2019-08-05 10:38:29,530 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 189 [2019-08-05 10:38:29,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:29,530 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2019-08-05 10:38:29,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 10:38:29,531 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2019-08-05 10:38:29,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-08-05 10:38:29,531 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:29,532 INFO L399 BasicCegarLoop]: trace histogram [95, 94, 1, 1] [2019-08-05 10:38:29,532 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:29,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:29,532 INFO L82 PathProgramCache]: Analyzing trace with hash -41421718, now seen corresponding path program 94 times [2019-08-05 10:38:29,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:29,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 288 conjunts are in the unsatisfiable core [2019-08-05 10:38:29,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:29,768 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:38:29,769 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:29,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:29,778 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:29,778 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:34,063 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:34,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:34,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 10:38:34,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 10:38:34,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 10:38:34,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:38:34,065 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 97 states. [2019-08-05 10:38:34,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:34,399 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2019-08-05 10:38:34,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 10:38:34,400 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 191 [2019-08-05 10:38:34,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:34,401 INFO L225 Difference]: With dead ends: 194 [2019-08-05 10:38:34,401 INFO L226 Difference]: Without dead ends: 194 [2019-08-05 10:38:34,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:38:34,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-08-05 10:38:34,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2019-08-05 10:38:34,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-08-05 10:38:34,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2019-08-05 10:38:34,405 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 191 [2019-08-05 10:38:34,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:34,405 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2019-08-05 10:38:34,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 10:38:34,405 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2019-08-05 10:38:34,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-08-05 10:38:34,406 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:34,406 INFO L399 BasicCegarLoop]: trace histogram [96, 95, 1, 1] [2019-08-05 10:38:34,406 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:34,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:34,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1151555531, now seen corresponding path program 95 times [2019-08-05 10:38:34,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:34,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 291 conjunts are in the unsatisfiable core [2019-08-05 10:38:34,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:34,619 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:38:34,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:34,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:34,631 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:34,631 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:38,931 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:38,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:38,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 10:38:38,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 10:38:38,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 10:38:38,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:38:38,933 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 98 states. [2019-08-05 10:38:39,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:39,280 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2019-08-05 10:38:39,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 10:38:39,281 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 193 [2019-08-05 10:38:39,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:39,282 INFO L225 Difference]: With dead ends: 196 [2019-08-05 10:38:39,282 INFO L226 Difference]: Without dead ends: 196 [2019-08-05 10:38:39,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:38:39,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-08-05 10:38:39,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2019-08-05 10:38:39,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-08-05 10:38:39,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2019-08-05 10:38:39,285 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 193 [2019-08-05 10:38:39,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:39,286 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2019-08-05 10:38:39,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 10:38:39,286 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2019-08-05 10:38:39,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-08-05 10:38:39,286 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:39,287 INFO L399 BasicCegarLoop]: trace histogram [97, 96, 1, 1] [2019-08-05 10:38:39,287 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:39,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:39,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1456706880, now seen corresponding path program 96 times [2019-08-05 10:38:39,287 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:39,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 294 conjunts are in the unsatisfiable core [2019-08-05 10:38:39,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:39,550 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:38:39,550 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:39,621 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:39,622 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:39,622 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:44,087 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:44,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:44,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 10:38:44,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 10:38:44,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 10:38:44,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:38:44,088 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 99 states. [2019-08-05 10:38:44,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:44,432 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2019-08-05 10:38:44,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:38:44,433 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 195 [2019-08-05 10:38:44,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:44,434 INFO L225 Difference]: With dead ends: 198 [2019-08-05 10:38:44,434 INFO L226 Difference]: Without dead ends: 198 [2019-08-05 10:38:44,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:38:44,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-08-05 10:38:44,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2019-08-05 10:38:44,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-08-05 10:38:44,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2019-08-05 10:38:44,438 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 195 [2019-08-05 10:38:44,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:44,439 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2019-08-05 10:38:44,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 10:38:44,439 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2019-08-05 10:38:44,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-08-05 10:38:44,440 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:44,440 INFO L399 BasicCegarLoop]: trace histogram [98, 97, 1, 1] [2019-08-05 10:38:44,440 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:44,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:44,441 INFO L82 PathProgramCache]: Analyzing trace with hash -264017013, now seen corresponding path program 97 times [2019-08-05 10:38:44,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:44,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 297 conjunts are in the unsatisfiable core [2019-08-05 10:38:44,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:44,670 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:38:44,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:44,691 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:44,692 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:44,692 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:49,130 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:49,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:49,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 10:38:49,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 10:38:49,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 10:38:49,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:38:49,132 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 100 states. [2019-08-05 10:38:49,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:49,497 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2019-08-05 10:38:49,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 10:38:49,498 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 197 [2019-08-05 10:38:49,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:49,499 INFO L225 Difference]: With dead ends: 200 [2019-08-05 10:38:49,499 INFO L226 Difference]: Without dead ends: 200 [2019-08-05 10:38:49,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:38:49,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-08-05 10:38:49,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2019-08-05 10:38:49,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-08-05 10:38:49,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2019-08-05 10:38:49,502 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 197 [2019-08-05 10:38:49,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:49,503 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2019-08-05 10:38:49,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 10:38:49,503 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2019-08-05 10:38:49,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-08-05 10:38:49,503 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:49,504 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 1, 1] [2019-08-05 10:38:49,504 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:49,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:49,504 INFO L82 PathProgramCache]: Analyzing trace with hash -317269226, now seen corresponding path program 98 times [2019-08-05 10:38:49,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:49,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 300 conjunts are in the unsatisfiable core [2019-08-05 10:38:49,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:49,757 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:38:49,757 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:49,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:49,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:49,773 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:54,260 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:54,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:54,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 10:38:54,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 10:38:54,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 10:38:54,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:38:54,261 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 101 states. [2019-08-05 10:38:54,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:54,610 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2019-08-05 10:38:54,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 10:38:54,611 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 199 [2019-08-05 10:38:54,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:54,612 INFO L225 Difference]: With dead ends: 202 [2019-08-05 10:38:54,612 INFO L226 Difference]: Without dead ends: 202 [2019-08-05 10:38:54,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:38:54,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-08-05 10:38:54,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2019-08-05 10:38:54,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-08-05 10:38:54,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2019-08-05 10:38:54,615 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 199 [2019-08-05 10:38:54,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:54,615 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2019-08-05 10:38:54,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 10:38:54,616 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2019-08-05 10:38:54,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-08-05 10:38:54,616 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:54,616 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 1, 1] [2019-08-05 10:38:54,616 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:54,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:54,617 INFO L82 PathProgramCache]: Analyzing trace with hash 46961633, now seen corresponding path program 99 times [2019-08-05 10:38:54,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:54,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 303 conjunts are in the unsatisfiable core [2019-08-05 10:38:54,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:54,838 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:38:54,839 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:54,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:54,857 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:54,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:59,337 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:59,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:59,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 10:38:59,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 10:38:59,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 10:38:59,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:38:59,338 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 102 states. [2019-08-05 10:38:59,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:59,713 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2019-08-05 10:38:59,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 10:38:59,713 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 201 [2019-08-05 10:38:59,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:59,715 INFO L225 Difference]: With dead ends: 204 [2019-08-05 10:38:59,715 INFO L226 Difference]: Without dead ends: 204 [2019-08-05 10:38:59,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:38:59,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-08-05 10:38:59,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2019-08-05 10:38:59,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-08-05 10:38:59,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2019-08-05 10:38:59,718 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 201 [2019-08-05 10:38:59,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:59,719 INFO L475 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2019-08-05 10:38:59,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 10:38:59,719 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2019-08-05 10:38:59,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-08-05 10:38:59,719 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:59,720 INFO L399 BasicCegarLoop]: trace histogram [101, 100, 1, 1] [2019-08-05 10:38:59,720 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:59,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:59,720 INFO L82 PathProgramCache]: Analyzing trace with hash -2114501140, now seen corresponding path program 100 times [2019-08-05 10:38:59,721 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:59,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:38:59,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:05,173 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 10100 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:05,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:39:05,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [102] imperfect sequences [] total 102 [2019-08-05 10:39:05,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-05 10:39:05,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-05 10:39:05,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:39:05,174 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 103 states. [2019-08-05 10:39:05,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:05,781 INFO L93 Difference]: Finished difference Result 202 states and 201 transitions. [2019-08-05 10:39:05,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 10:39:05,782 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 203 [2019-08-05 10:39:05,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:05,782 INFO L225 Difference]: With dead ends: 202 [2019-08-05 10:39:05,782 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:39:05,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:39:05,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:39:05,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:39:05,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:39:05,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:39:05,784 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 203 [2019-08-05 10:39:05,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:05,784 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:39:05,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-05 10:39:05,784 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:39:05,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:39:05,790 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:39:05 BoogieIcfgContainer [2019-08-05 10:39:05,790 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:39:05,791 INFO L168 Benchmark]: Toolchain (without parser) took 225431.64 ms. Allocated memory was 133.2 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 109.3 MB in the beginning and 436.7 MB in the end (delta: -327.4 MB). Peak memory consumption was 727.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:39:05,792 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 133.2 MB. Free memory was 110.7 MB in the beginning and 110.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:39:05,792 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.09 ms. Allocated memory is still 133.2 MB. Free memory was 109.3 MB in the beginning and 107.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:39:05,793 INFO L168 Benchmark]: Boogie Preprocessor took 28.74 ms. Allocated memory is still 133.2 MB. Free memory was 107.4 MB in the beginning and 106.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 10:39:05,793 INFO L168 Benchmark]: RCFGBuilder took 487.74 ms. Allocated memory is still 133.2 MB. Free memory was 106.1 MB in the beginning and 95.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:39:05,794 INFO L168 Benchmark]: TraceAbstraction took 224872.30 ms. Allocated memory was 133.2 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 94.7 MB in the beginning and 436.7 MB in the end (delta: -342.0 MB). Peak memory consumption was 712.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:39:05,795 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 133.2 MB. Free memory was 110.7 MB in the beginning and 110.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.09 ms. Allocated memory is still 133.2 MB. Free memory was 109.3 MB in the beginning and 107.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.74 ms. Allocated memory is still 133.2 MB. Free memory was 107.4 MB in the beginning and 106.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 487.74 ms. Allocated memory is still 133.2 MB. Free memory was 106.1 MB in the beginning and 95.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 224872.30 ms. Allocated memory was 133.2 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 94.7 MB in the beginning and 436.7 MB in the end (delta: -342.0 MB). Peak memory consumption was 712.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. SAFE Result, 224.7s OverallTime, 101 OverallIterations, 101 TraceHistogramMax, 21.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 201 SDtfs, 1 SDslu, 0 SDs, 0 SdLazy, 11688 SolverSat, 334 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10302 GetRequests, 5151 SyntacticMatches, 0 SemanticMatches, 5151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 181.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=204occurred in iteration=100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 101 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 7.3s SatisfiabilityAnalysisTime, 194.7s InterpolantComputationTime, 10403 NumberOfCodeBlocks, 10403 NumberOfCodeBlocksAsserted, 101 NumberOfCheckSat, 10302 ConstructedInterpolants, 0 QuantifiedInterpolants, 12383004 SizeOfPredicates, 202 NumberOfNonLiveVariables, 31714 ConjunctsInSsa, 15552 ConjunctsInUnsatCore, 101 InterpolantComputations, 2 PerfectInterpolantSequences, 10100/343400 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...