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/abstractInterpretation/regression/open/eq/unboundedStoreChain02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:09:59,275 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:09:59,277 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:09:59,289 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:09:59,289 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:09:59,290 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:09:59,292 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:09:59,294 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:09:59,295 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:09:59,296 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:09:59,297 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:09:59,298 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:09:59,298 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:09:59,299 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:09:59,300 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:09:59,301 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:09:59,302 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:09:59,303 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:09:59,305 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:09:59,307 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:09:59,309 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:09:59,310 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:09:59,311 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:09:59,312 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:09:59,314 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:09:59,315 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:09:59,315 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:09:59,316 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:09:59,317 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:09:59,318 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:09:59,318 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:09:59,319 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:09:59,320 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:09:59,321 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:09:59,322 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:09:59,322 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:09:59,323 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:09:59,323 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:09:59,323 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:09:59,324 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:09:59,325 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:09:59,353 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:09:59,371 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:09:59,375 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:09:59,377 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:09:59,377 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:09:59,378 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/open/eq/unboundedStoreChain02.bpl [2019-08-05 11:09:59,378 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/open/eq/unboundedStoreChain02.bpl' [2019-08-05 11:09:59,410 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:09:59,411 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:09:59,412 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:09:59,412 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:09:59,413 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:09:59,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "unboundedStoreChain02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:59" (1/1) ... [2019-08-05 11:09:59,443 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "unboundedStoreChain02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:59" (1/1) ... [2019-08-05 11:09:59,453 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:09:59,454 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:09:59,454 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:09:59,456 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:09:59,457 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:09:59,457 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:09:59,457 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:09:59,469 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "unboundedStoreChain02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:59" (1/1) ... [2019-08-05 11:09:59,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "unboundedStoreChain02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:59" (1/1) ... [2019-08-05 11:09:59,470 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "unboundedStoreChain02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:59" (1/1) ... [2019-08-05 11:09:59,471 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "unboundedStoreChain02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:59" (1/1) ... [2019-08-05 11:09:59,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "unboundedStoreChain02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:59" (1/1) ... [2019-08-05 11:09:59,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "unboundedStoreChain02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:59" (1/1) ... [2019-08-05 11:09:59,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "unboundedStoreChain02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:59" (1/1) ... [2019-08-05 11:09:59,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:09:59,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:09:59,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:09:59,484 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:09:59,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "unboundedStoreChain02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 11:09:59,562 INFO L130 BoogieDeclarations]: Found specification of procedure bla [2019-08-05 11:09:59,562 INFO L138 BoogieDeclarations]: Found implementation of procedure bla [2019-08-05 11:09:59,813 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:09:59,813 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:09:59,815 INFO L202 PluginConnector]: Adding new model unboundedStoreChain02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:09:59 BoogieIcfgContainer [2019-08-05 11:09:59,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:09:59,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:09:59,817 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:09:59,820 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:09:59,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "unboundedStoreChain02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:59" (1/2) ... [2019-08-05 11:09:59,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35867114 and model type unboundedStoreChain02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:09:59, skipping insertion in model container [2019-08-05 11:09:59,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "unboundedStoreChain02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:09:59" (2/2) ... [2019-08-05 11:09:59,826 INFO L109 eAbstractionObserver]: Analyzing ICFG unboundedStoreChain02.bpl [2019-08-05 11:09:59,837 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:09:59,845 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:09:59,863 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:09:59,892 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:09:59,893 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:09:59,893 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:09:59,893 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:09:59,893 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:09:59,893 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:09:59,894 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:09:59,894 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:09:59,894 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:09:59,906 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 11:09:59,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:09:59,914 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:59,915 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:09:59,917 INFO L418 AbstractCegarLoop]: === Iteration 1 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:59,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:59,923 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-08-05 11:09:59,968 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:59,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:00,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:10:00,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:00,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:00,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:10:00,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:10:00,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:10:00,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:10:00,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:10:00,166 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 11:10:00,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:00,230 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 11:10:00,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:10:00,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:10:00,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:00,242 INFO L225 Difference]: With dead ends: 6 [2019-08-05 11:10:00,242 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 11:10:00,245 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 11:10:00,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 11:10:00,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 11:10:00,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 11:10:00,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 11:10:00,278 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 11:10:00,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:00,279 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 11:10:00,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:10:00,279 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 11:10:00,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:10:00,279 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:00,280 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:10:00,280 INFO L418 AbstractCegarLoop]: === Iteration 2 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:00,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:00,281 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2019-08-05 11:10:00,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:00,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:10:00,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:00,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:00,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:00,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:10:00,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:10:00,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:10:00,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:10:00,419 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 11:10:00,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:00,458 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 11:10:00,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:10:00,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 11:10:00,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:00,459 INFO L225 Difference]: With dead ends: 6 [2019-08-05 11:10:00,459 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 11:10:00,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:10:00,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 11:10:00,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 11:10:00,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:10:00,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 11:10:00,462 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 11:10:00,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:00,463 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 11:10:00,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:10:00,463 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 11:10:00,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:10:00,463 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:00,464 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 11:10:00,464 INFO L418 AbstractCegarLoop]: === Iteration 3 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:00,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:00,465 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2019-08-05 11:10:00,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:00,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:10:00,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:00,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:00,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:00,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:10:00,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:10:00,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:10:00,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:10:00,617 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 11:10:00,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:00,662 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 11:10:00,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:10:00,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 11:10:00,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:00,663 INFO L225 Difference]: With dead ends: 7 [2019-08-05 11:10:00,663 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:10:00,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:10:00,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:10:00,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 11:10:00,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:10:00,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 11:10:00,666 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 11:10:00,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:00,667 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 11:10:00,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:10:00,667 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 11:10:00,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:10:00,668 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:00,668 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 11:10:00,668 INFO L418 AbstractCegarLoop]: === Iteration 4 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:00,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:00,669 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2019-08-05 11:10:00,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:00,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:10:00,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:00,902 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 11:10:00,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:00,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:10:00,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:10:00,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:10:00,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:10:00,904 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 11:10:00,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:00,962 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:10:00,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:10:00,963 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 11:10:00,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:00,963 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:10:00,963 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:10:00,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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 11:10:00,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:10:00,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 11:10:00,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:10:00,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 11:10:00,966 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 11:10:00,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:00,966 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 11:10:00,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:10:00,967 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 11:10:00,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:10:00,967 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:00,967 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 11:10:00,968 INFO L418 AbstractCegarLoop]: === Iteration 5 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:00,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:00,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2019-08-05 11:10:00,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:00,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:10:00,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:01,291 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:01,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:01,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:10:01,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:10:01,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:10:01,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:10:01,294 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 11:10:01,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:01,330 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 11:10:01,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:10:01,330 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 11:10:01,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:01,331 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:10:01,331 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:10:01,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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 11:10:01,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:10:01,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 11:10:01,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:10:01,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 11:10:01,334 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 11:10:01,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:01,334 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 11:10:01,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:10:01,335 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 11:10:01,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:10:01,335 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:01,335 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 11:10:01,335 INFO L418 AbstractCegarLoop]: === Iteration 6 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:01,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:01,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2019-08-05 11:10:01,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:01,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:10:01,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:01,647 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:01,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:01,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:10:01,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:10:01,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:10:01,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:10:01,649 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 11:10:01,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:01,677 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 11:10:01,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:10:01,677 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 11:10:01,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:01,678 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:10:01,678 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:10:01,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:10:01,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:10:01,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 11:10:01,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:10:01,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 11:10:01,681 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 11:10:01,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:01,683 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 11:10:01,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:10:01,683 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 11:10:01,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:10:01,683 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:01,683 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 11:10:01,684 INFO L418 AbstractCegarLoop]: === Iteration 7 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:01,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:01,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2019-08-05 11:10:01,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:01,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:10:01,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:01,861 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:01,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:01,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:10:01,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:10:01,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:10:01,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:10:01,863 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 11:10:01,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:01,890 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 11:10:01,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:10:01,891 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 11:10:01,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:01,892 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:10:01,892 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:10:01,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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 11:10:01,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:10:01,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 11:10:01,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:10:01,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 11:10:01,895 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 11:10:01,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:01,895 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 11:10:01,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:10:01,896 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 11:10:01,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:10:01,896 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:01,896 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 11:10:01,896 INFO L418 AbstractCegarLoop]: === Iteration 8 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:01,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:01,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820742, now seen corresponding path program 7 times [2019-08-05 11:10:01,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:01,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:01,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:10:01,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:02,369 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:02,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:02,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:10:02,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:10:02,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:10:02,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:10:02,371 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 11:10:02,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:02,447 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 11:10:02,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:10:02,448 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 11:10:02,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:02,448 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:10:02,448 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:10:02,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 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 11:10:02,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:10:02,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 11:10:02,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:10:02,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 11:10:02,452 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 11:10:02,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:02,452 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 11:10:02,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:10:02,453 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 11:10:02,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:10:02,453 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:02,453 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 11:10:02,454 INFO L418 AbstractCegarLoop]: === Iteration 9 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:02,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:02,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166496, now seen corresponding path program 8 times [2019-08-05 11:10:02,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:02,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:10:02,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:02,682 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:02,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:02,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:10:02,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:10:02,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:10:02,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:10:02,684 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 11:10:02,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:02,743 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 11:10:02,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:10:02,744 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 11:10:02,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:02,745 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:10:02,745 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:10:02,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:10:02,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:10:02,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:10:02,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:10:02,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 11:10:02,748 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 11:10:02,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:02,748 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 11:10:02,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:10:02,748 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 11:10:02,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:10:02,749 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:02,749 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 11:10:02,749 INFO L418 AbstractCegarLoop]: === Iteration 10 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:02,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:02,750 INFO L82 PathProgramCache]: Analyzing trace with hash -562523066, now seen corresponding path program 9 times [2019-08-05 11:10:02,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:02,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:02,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:10:02,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:02,982 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:02,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:02,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:10:02,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:10:02,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:10:02,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:10:02,983 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 11:10:03,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:03,027 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 11:10:03,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:10:03,028 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 11:10:03,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:03,028 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:10:03,028 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:10:03,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:10:03,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:10:03,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 11:10:03,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:10:03,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 11:10:03,032 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 11:10:03,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:03,033 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 11:10:03,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:10:03,033 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 11:10:03,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:10:03,033 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:03,033 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 11:10:03,034 INFO L418 AbstractCegarLoop]: === Iteration 11 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:03,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:03,034 INFO L82 PathProgramCache]: Analyzing trace with hash -258347808, now seen corresponding path program 10 times [2019-08-05 11:10:03,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:03,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:10:03,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:03,327 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:03,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:03,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:10:03,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:10:03,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:10:03,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:10:03,329 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 11:10:03,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:03,379 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 11:10:03,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:10:03,380 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 11:10:03,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:03,380 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:10:03,381 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:10:03,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:10:03,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:10:03,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 11:10:03,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:10:03,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 11:10:03,385 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 11:10:03,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:03,385 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 11:10:03,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:10:03,385 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 11:10:03,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:10:03,386 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:03,386 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 11:10:03,386 INFO L418 AbstractCegarLoop]: === Iteration 12 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:03,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:03,387 INFO L82 PathProgramCache]: Analyzing trace with hash 581150598, now seen corresponding path program 11 times [2019-08-05 11:10:03,387 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:03,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:10:03,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:03,774 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:03,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:03,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:10:03,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:10:03,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:10:03,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:10:03,776 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 11:10:03,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:03,816 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 11:10:03,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:10:03,816 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 11:10:03,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:03,817 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:10:03,817 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:10:03,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 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 11:10:03,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:10:03,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 11:10:03,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:10:03,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 11:10:03,821 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 11:10:03,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:03,821 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 11:10:03,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:10:03,822 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 11:10:03,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:10:03,822 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:03,822 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 11:10:03,823 INFO L418 AbstractCegarLoop]: === Iteration 13 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:03,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:03,823 INFO L82 PathProgramCache]: Analyzing trace with hash 835797408, now seen corresponding path program 12 times [2019-08-05 11:10:03,825 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:03,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:10:03,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:04,205 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:04,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:04,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:10:04,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:10:04,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:10:04,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:04,207 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 11:10:04,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:04,250 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 11:10:04,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:10:04,251 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 11:10:04,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:04,252 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:10:04,252 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:10:04,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:10:04,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:10:04,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 11:10:04,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:10:04,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 11:10:04,256 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 11:10:04,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:04,256 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 11:10:04,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:10:04,257 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 11:10:04,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:10:04,257 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:04,257 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 11:10:04,257 INFO L418 AbstractCegarLoop]: === Iteration 14 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:04,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:04,258 INFO L82 PathProgramCache]: Analyzing trace with hash 139913926, now seen corresponding path program 13 times [2019-08-05 11:10:04,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:04,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:10:04,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:04,657 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:04,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:04,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:10:04,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:10:04,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:10:04,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:10:04,658 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 11:10:04,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:04,700 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 11:10:04,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:10:04,700 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 11:10:04,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:04,701 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:10:04,701 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:10:04,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:10:04,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:10:04,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 11:10:04,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:10:04,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 11:10:04,706 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 11:10:04,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:04,706 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 11:10:04,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:10:04,707 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 11:10:04,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 11:10:04,707 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:04,707 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 11:10:04,708 INFO L418 AbstractCegarLoop]: === Iteration 15 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:04,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:04,708 INFO L82 PathProgramCache]: Analyzing trace with hash 42362464, now seen corresponding path program 14 times [2019-08-05 11:10:04,709 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:04,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:10:04,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:04,971 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:04,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:04,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:10:04,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:10:04,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:10:04,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:04,973 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 11:10:05,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:05,067 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 11:10:05,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:10:05,067 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 11:10:05,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:05,068 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:10:05,068 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:10:05,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:10:05,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:10:05,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 11:10:05,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:10:05,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 11:10:05,071 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 11:10:05,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:05,072 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 11:10:05,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:10:05,072 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 11:10:05,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:10:05,072 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:05,073 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 11:10:05,073 INFO L418 AbstractCegarLoop]: === Iteration 16 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:05,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:05,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234438, now seen corresponding path program 15 times [2019-08-05 11:10:05,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:05,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:05,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:10:05,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:05,560 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:05,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:05,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:10:05,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:10:05,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:10:05,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:10:05,562 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 11:10:05,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:05,597 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 11:10:05,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:10:05,597 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 11:10:05,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:05,598 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:10:05,599 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:10:05,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 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 11:10:05,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:10:05,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 11:10:05,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:10:05,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 11:10:05,602 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 11:10:05,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:05,603 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 11:10:05,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:10:05,603 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 11:10:05,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:10:05,603 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:05,604 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 11:10:05,604 INFO L418 AbstractCegarLoop]: === Iteration 17 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:05,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:05,604 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559968, now seen corresponding path program 16 times [2019-08-05 11:10:05,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:05,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:10:05,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:06,496 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:06,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:06,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:10:06,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:10:06,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:10:06,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:06,498 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 11:10:06,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:06,531 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 11:10:06,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:10:06,531 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 11:10:06,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:06,532 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:10:06,532 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:10:06,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:10:06,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:10:06,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 11:10:06,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:10:06,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 11:10:06,535 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 11:10:06,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:06,536 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 11:10:06,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:10:06,536 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 11:10:06,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 11:10:06,536 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:06,536 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 11:10:06,537 INFO L418 AbstractCegarLoop]: === Iteration 18 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:06,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:06,537 INFO L82 PathProgramCache]: Analyzing trace with hash -702152378, now seen corresponding path program 17 times [2019-08-05 11:10:06,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:06,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:06,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:10:06,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:06,947 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:06,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:06,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:10:06,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:10:06,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:10:06,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:10:06,949 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 11:10:06,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:06,982 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 11:10:06,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:10:06,986 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 11:10:06,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:06,986 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:10:06,986 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:10:06,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 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 11:10:06,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:10:06,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 11:10:06,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:10:06,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 11:10:06,989 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 11:10:06,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:06,990 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 11:10:06,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:10:06,990 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 11:10:06,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:10:06,991 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:06,991 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 11:10:06,991 INFO L418 AbstractCegarLoop]: === Iteration 19 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:06,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:06,991 INFO L82 PathProgramCache]: Analyzing trace with hash -291889184, now seen corresponding path program 18 times [2019-08-05 11:10:06,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:07,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:10:07,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:07,340 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:07,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:07,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:10:07,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:10:07,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:10:07,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:10:07,343 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 11:10:07,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:07,371 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 11:10:07,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:10:07,372 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 11:10:07,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:07,373 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:10:07,373 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:10:07,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 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 11:10:07,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:10:07,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 11:10:07,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 11:10:07,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 11:10:07,377 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 11:10:07,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:07,377 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 11:10:07,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:10:07,378 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 11:10:07,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:10:07,378 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:07,378 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 11:10:07,379 INFO L418 AbstractCegarLoop]: === Iteration 20 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:07,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:07,379 INFO L82 PathProgramCache]: Analyzing trace with hash -458632058, now seen corresponding path program 19 times [2019-08-05 11:10:07,380 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:07,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:07,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:10:07,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:07,813 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:07,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:07,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:10:07,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:10:07,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:10:07,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:10:07,815 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 11:10:07,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:07,856 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 11:10:07,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:10:07,857 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 11:10:07,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:07,857 INFO L225 Difference]: With dead ends: 24 [2019-08-05 11:10:07,858 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 11:10:07,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 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 11:10:07,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 11:10:07,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 11:10:07,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 11:10:07,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 11:10:07,862 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 11:10:07,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:07,862 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 11:10:07,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:10:07,862 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 11:10:07,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 11:10:07,863 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:07,863 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 11:10:07,863 INFO L418 AbstractCegarLoop]: === Iteration 21 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:07,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:07,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693856, now seen corresponding path program 20 times [2019-08-05 11:10:07,865 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:07,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:10:07,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:09,118 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 11:10:09,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:09,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:10:09,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:10:09,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:10:09,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:10:09,120 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 11:10:09,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:09,156 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 11:10:09,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:10:09,157 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 11:10:09,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:09,158 INFO L225 Difference]: With dead ends: 25 [2019-08-05 11:10:09,158 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 11:10:09,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 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 11:10:09,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 11:10:09,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 11:10:09,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 11:10:09,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 11:10:09,162 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 11:10:09,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:09,162 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 11:10:09,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:10:09,163 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 11:10:09,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 11:10:09,163 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:09,164 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 11:10:09,164 INFO L418 AbstractCegarLoop]: === Iteration 22 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:09,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:09,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161478, now seen corresponding path program 21 times [2019-08-05 11:10:09,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:09,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:09,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 11:10:09,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:09,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 11:10:09,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:09,541 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:09,542 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:09,542 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:10:09,588 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_7], 1=[v_bla_b_8]} [2019-08-05 11:10:09,600 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 11:10:09,600 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:09,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:09,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:09,623 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:09,624 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:09,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:09,639 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:09,639 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:10:09,689 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_8], 2=[v_bla_b_9]} [2019-08-05 11:10:09,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:09,712 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:09,713 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:09,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:09,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:09,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:09,733 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:09,734 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:09,745 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:09,745 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:09,746 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:10:09,819 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_9], 3=[v_bla_b_10]} [2019-08-05 11:10:09,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:09,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:09,828 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:09,829 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:09,846 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:09,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:09,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:09,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:09,867 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:09,867 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:09,883 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:09,884 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:09,884 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:10:09,938 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_10], 4=[v_bla_b_11]} [2019-08-05 11:10:09,951 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:09,952 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:09,973 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:09,979 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:10:09,980 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:10,002 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:10,003 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:10,003 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:10:10,060 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:10,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:10,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:10:10,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:10:10,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:10:10,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:10:10,062 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 11:10:10,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:10,686 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 11:10:10,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:10:10,688 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 11:10:10,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:10,688 INFO L225 Difference]: With dead ends: 27 [2019-08-05 11:10:10,688 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 11:10:10,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:10:10,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 11:10:10,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 11:10:10,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 11:10:10,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 11:10:10,691 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 11:10:10,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:10,692 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 11:10:10,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:10:10,692 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 11:10:10,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 11:10:10,693 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:10,693 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 11:10:10,693 INFO L418 AbstractCegarLoop]: === Iteration 23 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:10,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:10,693 INFO L82 PathProgramCache]: Analyzing trace with hash -818603680, now seen corresponding path program 22 times [2019-08-05 11:10:10,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:10,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 11:10:10,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:11,037 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 11:10:11,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:11,042 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:11,042 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:11,042 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:10:11,066 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_11], 1=[v_bla_b_13]} [2019-08-05 11:10:11,069 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 11:10:11,069 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:11,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:11,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:11,083 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:11,083 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:11,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:11,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:11,093 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:10:11,136 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_12], 2=[v_bla_b_14]} [2019-08-05 11:10:11,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:11,142 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:11,142 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:11,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:11,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:11,168 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:11,169 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:11,170 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:11,188 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:11,188 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:11,188 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:10:11,230 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_13], 3=[v_bla_b_15]} [2019-08-05 11:10:11,234 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:11,234 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:11,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:11,257 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:11,258 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:11,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:11,274 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:11,275 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:10:11,333 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_14], 4=[v_bla_b_16]} [2019-08-05 11:10:11,342 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:11,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:11,362 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:11,387 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:10:11,387 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:11,422 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:11,423 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:11,423 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:10:11,472 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:11,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:11,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:10:11,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:11,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:11,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:11,474 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 11:10:12,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:12,047 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 11:10:12,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:10:12,048 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 11:10:12,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:12,048 INFO L225 Difference]: With dead ends: 28 [2019-08-05 11:10:12,049 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 11:10:12,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:12,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 11:10:12,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 11:10:12,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 11:10:12,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 11:10:12,053 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 11:10:12,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:12,054 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 11:10:12,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:12,054 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 11:10:12,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:10:12,054 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:12,055 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 11:10:12,055 INFO L418 AbstractCegarLoop]: === Iteration 24 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:12,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:12,055 INFO L82 PathProgramCache]: Analyzing trace with hash 393087750, now seen corresponding path program 23 times [2019-08-05 11:10:12,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:12,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 11:10:12,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:12,567 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 11:10:12,567 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:12,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:12,571 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:12,571 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:10:12,606 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_15], 1=[v_bla_b_18]} [2019-08-05 11:10:12,609 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 11:10:12,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:12,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:12,619 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:12,620 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:12,620 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:12,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:12,629 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:12,629 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:10:12,675 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_16], 2=[v_bla_b_19]} [2019-08-05 11:10:12,698 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:12,698 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:12,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:12,733 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:12,733 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:12,745 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:12,745 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:12,745 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:10:12,780 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_17], 3=[v_bla_b_20]} [2019-08-05 11:10:12,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:12,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:12,785 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:12,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:12,802 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:12,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:12,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:12,808 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:12,808 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:12,809 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:12,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:12,827 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:12,828 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:10:12,877 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_18], 4=[v_bla_b_21]} [2019-08-05 11:10:12,880 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:12,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:12,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:12,903 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:10:12,903 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:12,919 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:12,920 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:12,920 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:10:12,973 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:12,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:12,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:10:12,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:10:12,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:10:12,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:10:12,976 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 11:10:13,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:13,543 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 11:10:13,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:10:13,544 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 11:10:13,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:13,544 INFO L225 Difference]: With dead ends: 29 [2019-08-05 11:10:13,545 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 11:10:13,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:10:13,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 11:10:13,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 11:10:13,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 11:10:13,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 11:10:13,550 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 11:10:13,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:13,550 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 11:10:13,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:10:13,550 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 11:10:13,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 11:10:13,551 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:13,551 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 11:10:13,551 INFO L418 AbstractCegarLoop]: === Iteration 25 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:13,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:13,552 INFO L82 PathProgramCache]: Analyzing trace with hash -699183584, now seen corresponding path program 24 times [2019-08-05 11:10:13,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:13,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 11:10:13,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:13,881 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 11:10:13,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:13,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:13,888 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:13,888 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:10:13,914 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_19], 1=[v_bla_b_23]} [2019-08-05 11:10:13,916 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 11:10:13,916 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:13,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:13,928 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:13,929 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:13,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:13,937 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:13,937 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:10:13,973 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_20], 2=[v_bla_b_24]} [2019-08-05 11:10:13,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:13,977 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:13,977 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:13,993 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:13,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:13,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:13,999 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:14,000 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:14,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:14,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:14,015 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:10:14,062 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_21], 3=[v_bla_b_25]} [2019-08-05 11:10:14,068 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:14,069 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:14,086 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:14,106 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:14,107 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:14,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:14,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:14,171 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:10:14,295 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_22], 4=[v_bla_b_26]} [2019-08-05 11:10:14,298 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:14,299 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:14,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:14,321 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:10:14,322 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:14,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:14,340 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:14,340 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:10:14,392 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:14,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:14,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:14,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:10:14,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:10:14,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:10:14,394 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 11:10:15,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:15,261 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 11:10:15,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:10:15,262 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 11:10:15,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:15,262 INFO L225 Difference]: With dead ends: 30 [2019-08-05 11:10:15,262 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 11:10:15,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:10:15,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 11:10:15,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 11:10:15,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 11:10:15,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 11:10:15,268 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 11:10:15,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:15,268 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 11:10:15,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:10:15,269 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 11:10:15,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 11:10:15,272 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:15,272 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 11:10:15,273 INFO L418 AbstractCegarLoop]: === Iteration 26 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:15,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:15,273 INFO L82 PathProgramCache]: Analyzing trace with hash -199856570, now seen corresponding path program 25 times [2019-08-05 11:10:15,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:15,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 11:10:15,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:15,679 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 11:10:15,679 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:15,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:15,686 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:15,686 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:10:15,716 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_23], 1=[v_bla_b_28]} [2019-08-05 11:10:15,718 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 11:10:15,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:15,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:15,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:15,729 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:15,730 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:15,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:15,739 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:15,740 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:10:15,773 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_24], 2=[v_bla_b_29]} [2019-08-05 11:10:15,776 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:15,776 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:15,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:15,802 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:15,803 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:15,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:15,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:15,815 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:10:15,854 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_25], 3=[v_bla_b_30]} [2019-08-05 11:10:15,859 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:15,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:15,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:15,881 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:15,881 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:15,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:15,899 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:15,899 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:10:15,947 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_26], 4=[v_bla_b_31]} [2019-08-05 11:10:15,950 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:15,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:15,969 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:15,973 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:10:15,973 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:15,993 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:15,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:15,994 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:10:16,047 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:16,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:16,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:10:16,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:10:16,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:10:16,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:10:16,049 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 11:10:16,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:16,659 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 11:10:16,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:10:16,660 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 11:10:16,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:16,660 INFO L225 Difference]: With dead ends: 31 [2019-08-05 11:10:16,660 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 11:10:16,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:10:16,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 11:10:16,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 11:10:16,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 11:10:16,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 11:10:16,665 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 11:10:16,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:16,665 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 11:10:16,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:10:16,665 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 11:10:16,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 11:10:16,666 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:16,666 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 11:10:16,666 INFO L418 AbstractCegarLoop]: === Iteration 27 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:16,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:16,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588320, now seen corresponding path program 26 times [2019-08-05 11:10:16,667 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:16,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 11:10:16,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:17,634 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 11:10:17,635 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:17,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:17,639 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:17,639 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:10:17,665 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_27], 1=[v_bla_b_33]} [2019-08-05 11:10:17,667 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 11:10:17,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:17,675 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:17,680 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:17,681 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:17,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:17,688 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:17,688 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:10:17,721 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_28], 2=[v_bla_b_34]} [2019-08-05 11:10:17,724 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:17,725 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:17,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:17,740 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:17,741 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:17,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:17,753 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:17,753 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:10:17,817 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_29], 3=[v_bla_b_35]} [2019-08-05 11:10:17,829 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:17,829 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:17,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:17,865 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:17,866 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:17,977 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-08-05 11:10:17,977 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:17,978 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:17,978 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:10:18,042 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_30], 4=[v_bla_b_36]} [2019-08-05 11:10:18,058 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:18,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:18,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:18,082 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:10:18,082 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:18,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:18,109 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:18,109 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:10:18,163 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:18,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:18,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:10:18,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:10:18,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:10:18,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:10:18,165 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 11:10:18,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:18,794 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 11:10:18,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:10:18,794 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 11:10:18,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:18,795 INFO L225 Difference]: With dead ends: 32 [2019-08-05 11:10:18,795 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 11:10:18,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:10:18,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 11:10:18,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 11:10:18,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 11:10:18,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 11:10:18,799 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 11:10:18,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:18,800 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 11:10:18,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:10:18,800 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 11:10:18,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 11:10:18,800 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:18,800 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 11:10:18,801 INFO L418 AbstractCegarLoop]: === Iteration 28 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:18,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:18,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302278, now seen corresponding path program 27 times [2019-08-05 11:10:18,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:18,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:18,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 11:10:18,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:19,187 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 11:10:19,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:19,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:19,193 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:19,193 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:10:19,229 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_31], 1=[v_bla_b_38]} [2019-08-05 11:10:19,231 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 11:10:19,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:19,239 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:19,242 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:19,243 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:19,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:19,251 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:19,252 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:10:19,286 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_32], 2=[v_bla_b_39]} [2019-08-05 11:10:19,288 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:19,289 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:19,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:19,307 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:19,307 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:19,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:19,320 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:19,320 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:10:19,362 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_33], 3=[v_bla_b_40]} [2019-08-05 11:10:19,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:19,366 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:19,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:19,385 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:19,386 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:19,407 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:19,407 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:19,407 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:10:19,455 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_34], 4=[v_bla_b_41]} [2019-08-05 11:10:19,458 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:19,458 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:19,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:19,489 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:10:19,490 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:19,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:19,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:19,514 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:10:19,568 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:19,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:19,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:10:19,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:10:19,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:10:19,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:10:19,570 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 11:10:20,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:20,266 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 11:10:20,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:10:20,266 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 11:10:20,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:20,267 INFO L225 Difference]: With dead ends: 33 [2019-08-05 11:10:20,267 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 11:10:20,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:10:20,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 11:10:20,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 11:10:20,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 11:10:20,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 11:10:20,272 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 11:10:20,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:20,272 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 11:10:20,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:10:20,272 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 11:10:20,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 11:10:20,272 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:20,273 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 11:10:20,273 INFO L418 AbstractCegarLoop]: === Iteration 29 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:20,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:20,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1104336992, now seen corresponding path program 28 times [2019-08-05 11:10:20,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:20,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:20,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 11:10:20,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:20,688 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 11:10:20,689 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:20,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:20,693 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:20,693 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:10:20,722 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_35], 1=[v_bla_b_43]} [2019-08-05 11:10:20,726 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 11:10:20,726 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:20,736 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:20,739 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:20,740 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:20,749 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:20,749 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:20,750 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:10:20,784 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_36], 2=[v_bla_b_44]} [2019-08-05 11:10:20,786 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:20,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:20,799 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:20,802 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:20,803 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:20,814 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:20,814 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:20,815 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:10:20,858 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_37], 3=[v_bla_b_45]} [2019-08-05 11:10:20,861 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:20,861 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:20,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:20,889 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:20,890 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:20,903 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:20,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:20,904 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:10:20,980 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_38], 4=[v_bla_b_46]} [2019-08-05 11:10:20,984 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:20,985 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:21,002 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:21,006 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:10:21,006 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:21,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:21,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:21,024 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:10:21,079 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:21,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:21,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:10:21,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:10:21,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:10:21,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:10:21,081 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 11:10:21,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:21,889 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 11:10:21,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:10:21,890 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 11:10:21,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:21,891 INFO L225 Difference]: With dead ends: 34 [2019-08-05 11:10:21,891 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 11:10:21,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:10:21,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 11:10:21,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 11:10:21,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 11:10:21,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 11:10:21,895 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 11:10:21,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:21,895 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 11:10:21,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:10:21,895 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 11:10:21,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 11:10:21,896 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:21,896 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 11:10:21,896 INFO L418 AbstractCegarLoop]: === Iteration 30 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:21,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:21,896 INFO L82 PathProgramCache]: Analyzing trace with hash 125289670, now seen corresponding path program 29 times [2019-08-05 11:10:21,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:21,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 11:10:21,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:22,681 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 11:10:22,682 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:22,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:22,687 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:22,687 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:10:22,726 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_39], 1=[v_bla_b_48]} [2019-08-05 11:10:22,728 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 11:10:22,728 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:22,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:22,742 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:22,743 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:22,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:22,758 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:22,758 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:10:22,794 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_40], 2=[v_bla_b_49]} [2019-08-05 11:10:22,797 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:22,797 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:22,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:22,815 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:22,816 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:22,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:22,832 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:22,832 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:10:22,877 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_41], 3=[v_bla_b_50]} [2019-08-05 11:10:22,885 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:22,886 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:22,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:22,906 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:22,907 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:22,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:22,923 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:22,923 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:10:23,149 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:10:23,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:23,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:23,173 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:23,173 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:23,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:23,191 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:23,191 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:10:23,245 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:23,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:23,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:10:23,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:10:23,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:10:23,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:10:23,247 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 11:10:23,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:23,986 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 11:10:23,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:10:23,987 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 11:10:23,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:23,987 INFO L225 Difference]: With dead ends: 35 [2019-08-05 11:10:23,987 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 11:10:23,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:10:23,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 11:10:23,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 11:10:23,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 11:10:23,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 11:10:23,991 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 11:10:23,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:23,991 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 11:10:23,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:10:23,992 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 11:10:23,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:10:23,992 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:23,992 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 11:10:23,992 INFO L418 AbstractCegarLoop]: === Iteration 31 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:23,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:23,993 INFO L82 PathProgramCache]: Analyzing trace with hash -410989472, now seen corresponding path program 30 times [2019-08-05 11:10:23,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:24,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 11:10:24,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:24,432 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 11:10:24,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:24,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:24,438 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:24,438 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:10:24,469 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_43], 1=[v_bla_b_53]} [2019-08-05 11:10:24,472 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 11:10:24,472 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:24,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:24,484 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:24,484 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:24,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:24,494 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:24,494 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:10:24,546 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_44], 2=[v_bla_b_54]} [2019-08-05 11:10:24,569 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:24,570 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:24,753 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-08-05 11:10:24,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:24,777 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:24,778 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:24,964 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-08-05 11:10:24,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:24,965 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:24,965 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:10:25,047 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_45], 3=[v_bla_b_55]} [2019-08-05 11:10:25,050 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:25,050 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:25,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:25,071 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:25,072 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:25,088 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:25,088 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:25,089 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:10:25,138 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_46], 4=[v_bla_b_56]} [2019-08-05 11:10:25,141 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:25,141 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:25,159 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:25,163 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:10:25,163 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:25,182 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:25,182 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:25,182 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:10:25,243 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:25,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:25,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:10:25,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:10:25,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:10:25,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:10:25,244 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 11:10:26,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:26,010 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 11:10:26,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:10:26,010 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 11:10:26,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:26,011 INFO L225 Difference]: With dead ends: 36 [2019-08-05 11:10:26,011 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 11:10:26,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:10:26,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 11:10:26,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 11:10:26,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 11:10:26,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 11:10:26,015 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 11:10:26,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:26,015 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 11:10:26,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:10:26,015 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 11:10:26,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 11:10:26,015 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:26,016 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 11:10:26,016 INFO L418 AbstractCegarLoop]: === Iteration 32 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:26,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:26,016 INFO L82 PathProgramCache]: Analyzing trace with hash 144226310, now seen corresponding path program 31 times [2019-08-05 11:10:26,017 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:26,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 11:10:26,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:26,563 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 11:10:26,563 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:26,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:26,568 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:26,568 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:10:26,597 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_47], 1=[v_bla_b_58]} [2019-08-05 11:10:26,600 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 11:10:26,601 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:26,608 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:26,616 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:26,616 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:26,624 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:26,625 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:26,625 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:10:26,659 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_48], 2=[v_bla_b_59]} [2019-08-05 11:10:26,662 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:26,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:26,675 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:26,678 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:26,679 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:26,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:26,690 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:26,691 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:10:26,745 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_49], 3=[v_bla_b_60]} [2019-08-05 11:10:26,748 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:26,749 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:26,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:26,768 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:26,768 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:26,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:26,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:26,784 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:10:26,833 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_50], 4=[v_bla_b_61]} [2019-08-05 11:10:26,835 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:26,835 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:26,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:26,859 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:10:26,860 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:26,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:26,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:26,877 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:10:26,960 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:26,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:26,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:10:26,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:10:26,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:10:26,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:10:26,961 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 11:10:27,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:27,892 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 11:10:27,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:10:27,893 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 11:10:27,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:27,893 INFO L225 Difference]: With dead ends: 37 [2019-08-05 11:10:27,893 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 11:10:27,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:10:27,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 11:10:27,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 11:10:27,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 11:10:27,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 11:10:27,898 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 11:10:27,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:27,898 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 11:10:27,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:10:27,899 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 11:10:27,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 11:10:27,899 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:27,899 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 11:10:27,899 INFO L418 AbstractCegarLoop]: === Iteration 33 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:27,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:27,900 INFO L82 PathProgramCache]: Analyzing trace with hash 176046368, now seen corresponding path program 32 times [2019-08-05 11:10:27,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:27,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 11:10:27,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:29,117 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 11:10:29,118 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:29,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:29,123 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:29,123 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:10:29,159 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_51], 1=[v_bla_b_63]} [2019-08-05 11:10:29,179 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 11:10:29,179 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:29,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:29,206 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:29,207 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:29,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:29,215 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:29,215 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:10:29,257 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_52], 2=[v_bla_b_64]} [2019-08-05 11:10:29,261 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:29,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:29,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:29,283 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:29,284 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:29,299 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:29,299 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:29,300 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:10:29,360 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_53], 3=[v_bla_b_65]} [2019-08-05 11:10:29,364 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:29,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:29,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:29,366 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:29,385 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:29,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:29,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:29,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:29,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:29,391 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:29,407 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:29,408 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:29,408 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:10:29,462 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:10:29,462 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:29,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:29,484 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:29,485 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:29,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:29,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:29,505 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:10:29,562 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:29,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:29,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:10:29,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:10:29,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:10:29,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:10:29,564 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 11:10:30,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:30,414 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 11:10:30,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:10:30,415 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 11:10:30,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:30,415 INFO L225 Difference]: With dead ends: 38 [2019-08-05 11:10:30,416 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 11:10:30,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:10:30,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 11:10:30,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 11:10:30,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 11:10:30,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 11:10:30,419 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 11:10:30,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:30,419 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 11:10:30,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:10:30,420 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 11:10:30,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 11:10:30,420 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:30,420 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 11:10:30,420 INFO L418 AbstractCegarLoop]: === Iteration 34 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:30,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:30,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468166, now seen corresponding path program 33 times [2019-08-05 11:10:30,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:30,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 11:10:30,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:30,956 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 11:10:30,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:30,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:30,963 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:30,963 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:10:30,995 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_55], 1=[v_bla_b_68]} [2019-08-05 11:10:30,998 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 11:10:30,998 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:31,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:31,011 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:31,012 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:31,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:31,021 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:31,021 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:10:31,057 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_56], 2=[v_bla_b_69]} [2019-08-05 11:10:31,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:31,061 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:31,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:31,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:31,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:31,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:31,079 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:31,080 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:31,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:31,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:31,093 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:10:31,137 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_57], 3=[v_bla_b_70]} [2019-08-05 11:10:31,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:31,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:31,144 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:31,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:31,163 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:31,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:31,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:31,168 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:31,169 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:31,169 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:31,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:31,186 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:31,186 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:10:31,239 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_58], 4=[v_bla_b_71]} [2019-08-05 11:10:31,241 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:31,241 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:31,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:31,273 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:10:31,274 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:31,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:31,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:31,289 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:10:31,350 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:31,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:31,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:10:31,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:10:31,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:10:31,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:10:31,351 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 11:10:32,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:32,339 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 11:10:32,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:10:32,340 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 11:10:32,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:32,340 INFO L225 Difference]: With dead ends: 39 [2019-08-05 11:10:32,340 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 11:10:32,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:10:32,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 11:10:32,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 11:10:32,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 11:10:32,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 11:10:32,344 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 11:10:32,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:32,344 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 11:10:32,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:10:32,344 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 11:10:32,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:10:32,344 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:32,344 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 11:10:32,344 INFO L418 AbstractCegarLoop]: === Iteration 35 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:32,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:32,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772832, now seen corresponding path program 34 times [2019-08-05 11:10:32,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:32,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 11:10:32,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:32,988 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 11:10:32,988 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:32,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:32,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:32,994 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:10:33,024 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_59], 1=[v_bla_b_73]} [2019-08-05 11:10:33,026 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 11:10:33,026 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:33,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:33,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:33,039 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:33,040 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:33,051 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:33,051 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:33,052 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:10:33,092 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_60], 2=[v_bla_b_74]} [2019-08-05 11:10:33,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:33,096 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:33,096 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:33,109 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:33,114 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:33,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:33,116 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:33,116 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:33,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:33,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:33,129 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:10:33,185 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_61], 3=[v_bla_b_75]} [2019-08-05 11:10:33,188 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:33,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:33,190 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:33,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:33,208 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:33,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:33,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:33,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:33,214 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:33,214 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:33,233 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:33,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:33,234 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:10:33,288 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_62], 4=[v_bla_b_76]} [2019-08-05 11:10:33,292 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:33,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:33,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:33,320 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:10:33,320 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:33,339 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:33,339 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:33,339 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:10:33,404 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:33,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:33,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:10:33,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:10:33,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:10:33,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:10:33,405 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 11:10:34,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:34,387 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 11:10:34,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:10:34,388 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 11:10:34,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:34,389 INFO L225 Difference]: With dead ends: 40 [2019-08-05 11:10:34,389 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 11:10:34,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:10:34,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 11:10:34,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 11:10:34,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 11:10:34,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 11:10:34,392 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 11:10:34,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:34,393 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 11:10:34,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:10:34,393 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 11:10:34,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 11:10:34,393 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:34,394 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 11:10:34,394 INFO L418 AbstractCegarLoop]: === Iteration 36 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:34,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:34,394 INFO L82 PathProgramCache]: Analyzing trace with hash 440348294, now seen corresponding path program 35 times [2019-08-05 11:10:34,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:34,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 11:10:34,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:34,964 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 11:10:34,964 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:35,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:35,057 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:35,057 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:10:35,117 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_63], 1=[v_bla_b_78]} [2019-08-05 11:10:35,120 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 11:10:35,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:35,130 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:35,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:35,135 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:35,136 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:35,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:35,146 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:35,146 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:10:35,187 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_64], 2=[v_bla_b_79]} [2019-08-05 11:10:35,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:35,192 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:35,192 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:35,205 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:35,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:35,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:35,213 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:35,214 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:35,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:35,248 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:35,248 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:10:35,322 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_65], 3=[v_bla_b_80]} [2019-08-05 11:10:35,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:35,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:35,326 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:35,326 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:35,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:35,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:35,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:35,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:35,349 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:35,349 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:35,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:35,367 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:35,368 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:10:35,433 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_66], 4=[v_bla_b_81]} [2019-08-05 11:10:35,436 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:35,436 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:35,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:35,459 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:10:35,460 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:35,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:35,482 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:35,482 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:10:35,547 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:35,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:35,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:10:35,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:10:35,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:10:35,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:10:35,548 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 11:10:36,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:36,549 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 11:10:36,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 11:10:36,549 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 11:10:36,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:36,550 INFO L225 Difference]: With dead ends: 41 [2019-08-05 11:10:36,550 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 11:10:36,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:10:36,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 11:10:36,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 11:10:36,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 11:10:36,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 11:10:36,553 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 11:10:36,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:36,554 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 11:10:36,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:10:36,554 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 11:10:36,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 11:10:36,554 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:36,554 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 11:10:36,555 INFO L418 AbstractCegarLoop]: === Iteration 37 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:36,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:36,555 INFO L82 PathProgramCache]: Analyzing trace with hash 765893280, now seen corresponding path program 36 times [2019-08-05 11:10:36,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:36,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 11:10:36,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:37,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 11:10:37,670 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:37,675 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:37,675 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:37,675 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:10:37,714 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_67], 1=[v_bla_b_83]} [2019-08-05 11:10:37,717 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 11:10:37,717 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:37,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:37,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:37,728 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:37,729 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:37,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:37,738 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:37,738 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:10:37,777 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_68], 2=[v_bla_b_84]} [2019-08-05 11:10:37,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:37,781 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:37,782 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:37,794 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:37,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:37,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:37,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:37,801 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:37,834 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:37,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:37,835 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:10:37,901 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_69], 3=[v_bla_b_85]} [2019-08-05 11:10:37,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:37,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:37,914 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:37,914 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:37,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:37,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:37,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:37,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:37,938 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:37,938 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:37,956 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:37,956 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:37,956 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:10:38,015 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_70], 4=[v_bla_b_86]} [2019-08-05 11:10:38,017 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:38,017 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:38,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:38,039 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:10:38,040 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:38,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:38,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:38,059 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:10:38,129 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:38,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:38,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:10:38,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:10:38,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:10:38,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:10:38,131 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 11:10:39,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:39,188 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 11:10:39,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:10:39,188 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 11:10:39,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:39,189 INFO L225 Difference]: With dead ends: 42 [2019-08-05 11:10:39,189 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 11:10:39,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:10:39,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 11:10:39,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 11:10:39,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 11:10:39,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 11:10:39,193 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 11:10:39,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:39,193 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 11:10:39,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:10:39,194 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 11:10:39,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:10:39,194 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:39,194 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 11:10:39,195 INFO L418 AbstractCegarLoop]: === Iteration 38 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:39,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:39,195 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114042, now seen corresponding path program 37 times [2019-08-05 11:10:39,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:39,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 11:10:39,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:40,088 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 11:10:40,089 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:40,093 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:40,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:40,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:10:40,127 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_71], 1=[v_bla_b_88]} [2019-08-05 11:10:40,129 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 11:10:40,129 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:40,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:40,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:40,141 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:40,142 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:40,274 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-08-05 11:10:40,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:40,275 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:40,275 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:10:40,390 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_72], 2=[v_bla_b_89]} [2019-08-05 11:10:40,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:40,393 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:40,394 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:40,407 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:40,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:40,411 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:40,412 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:40,412 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:40,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:40,425 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:40,425 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:10:40,474 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_73], 3=[v_bla_b_90]} [2019-08-05 11:10:40,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:40,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:40,480 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:40,480 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:40,496 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:40,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:40,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:40,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:40,502 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:40,503 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:40,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:40,520 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:40,520 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:10:40,578 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_74], 4=[v_bla_b_91]} [2019-08-05 11:10:40,580 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:40,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:40,600 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:40,621 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:10:40,622 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:40,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:40,638 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:40,638 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:10:40,704 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:40,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:40,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 11:10:40,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 11:10:40,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 11:10:40,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:10:40,706 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 11:10:41,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:41,863 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 11:10:41,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 11:10:41,864 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 11:10:41,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:41,865 INFO L225 Difference]: With dead ends: 43 [2019-08-05 11:10:41,865 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 11:10:41,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:10:41,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 11:10:41,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 11:10:41,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 11:10:41,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 11:10:41,868 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 11:10:41,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:41,869 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 11:10:41,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 11:10:41,869 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 11:10:41,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 11:10:41,869 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:41,869 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 11:10:41,870 INFO L418 AbstractCegarLoop]: === Iteration 39 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:41,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:41,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972192, now seen corresponding path program 38 times [2019-08-05 11:10:41,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:41,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:41,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 11:10:41,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:43,015 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 11:10:43,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:43,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:43,022 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:43,022 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:10:43,058 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_75], 1=[v_bla_b_93]} [2019-08-05 11:10:43,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 11:10:43,067 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:43,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:43,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:43,078 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:43,079 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:43,088 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:43,088 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:43,088 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:10:43,131 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_76], 2=[v_bla_b_94]} [2019-08-05 11:10:43,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:43,135 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:43,136 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:43,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:43,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:43,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:43,154 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:43,154 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:43,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:43,167 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:43,167 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:10:43,217 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_77], 3=[v_bla_b_95]} [2019-08-05 11:10:43,220 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:43,220 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:43,239 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:43,257 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:43,258 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:43,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:43,273 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:43,274 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:10:43,332 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_78], 4=[v_bla_b_96]} [2019-08-05 11:10:43,336 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:43,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:43,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:43,369 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:10:43,369 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:43,389 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:43,389 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:43,390 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:10:43,464 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:43,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:43,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:10:43,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 11:10:43,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 11:10:43,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:10:43,465 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 11:10:44,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:44,639 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 11:10:44,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:10:44,639 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 11:10:44,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:44,640 INFO L225 Difference]: With dead ends: 44 [2019-08-05 11:10:44,640 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 11:10:44,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:10:44,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 11:10:44,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 11:10:44,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 11:10:44,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 11:10:44,644 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 11:10:44,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:44,644 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 11:10:44,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 11:10:44,645 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 11:10:44,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 11:10:44,645 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:44,645 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 11:10:44,646 INFO L418 AbstractCegarLoop]: === Iteration 40 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:44,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:44,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495750, now seen corresponding path program 39 times [2019-08-05 11:10:44,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:44,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:44,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 11:10:44,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:45,366 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 11:10:45,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:45,371 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:45,371 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:45,372 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:10:45,418 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_79], 1=[v_bla_b_98]} [2019-08-05 11:10:45,420 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 11:10:45,420 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:45,440 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:45,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:45,444 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:45,445 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:45,454 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:45,454 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:45,454 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:10:45,499 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_80], 2=[v_bla_b_99]} [2019-08-05 11:10:45,521 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:45,521 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:45,686 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-08-05 11:10:45,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:45,711 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:45,712 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:45,883 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-08-05 11:10:45,883 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:45,884 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:45,884 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:10:46,438 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_81], 3=[v_bla_b_100]} [2019-08-05 11:10:46,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:46,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:46,444 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:46,444 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:46,461 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:46,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:46,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:46,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:46,467 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:46,468 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:46,484 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:46,485 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:46,485 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:10:46,542 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_82], 4=[v_bla_b_101]} [2019-08-05 11:10:46,545 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:46,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:46,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:46,567 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:10:46,568 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:46,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:46,587 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:46,588 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:10:46,670 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:46,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:46,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 11:10:46,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 11:10:46,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 11:10:46,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:10:46,671 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 11:10:48,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:48,058 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 11:10:48,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 11:10:48,059 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 11:10:48,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:48,059 INFO L225 Difference]: With dead ends: 45 [2019-08-05 11:10:48,060 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 11:10:48,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:10:48,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 11:10:48,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 11:10:48,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 11:10:48,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 11:10:48,063 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 11:10:48,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:48,063 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 11:10:48,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 11:10:48,063 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 11:10:48,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 11:10:48,064 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:48,064 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 11:10:48,064 INFO L418 AbstractCegarLoop]: === Iteration 41 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:48,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:48,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791456, now seen corresponding path program 40 times [2019-08-05 11:10:48,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:48,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 11:10:48,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:48,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 11:10:48,807 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:48,820 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:48,821 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:48,821 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:10:48,860 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_83], 1=[v_bla_b_103]} [2019-08-05 11:10:48,862 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 11:10:48,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:48,871 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:48,876 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:48,876 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:48,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:48,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:48,886 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:10:48,936 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_84], 2=[v_bla_b_104]} [2019-08-05 11:10:48,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:48,939 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:48,939 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:48,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:48,955 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:48,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:48,956 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:48,957 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:48,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:48,979 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:48,979 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:10:49,033 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_85], 3=[v_bla_b_105]} [2019-08-05 11:10:49,036 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:49,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:49,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:49,056 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:49,057 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:49,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:49,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:49,074 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:10:49,135 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_86], 4=[v_bla_b_106]} [2019-08-05 11:10:49,138 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:49,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:49,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:49,159 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:10:49,160 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:49,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:49,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:49,180 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:10:49,250 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:49,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:49,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:10:49,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 11:10:49,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 11:10:49,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:10:49,252 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 11:10:50,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:50,545 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 11:10:50,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:10:50,546 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 11:10:50,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:50,547 INFO L225 Difference]: With dead ends: 46 [2019-08-05 11:10:50,547 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 11:10:50,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:10:50,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 11:10:50,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 11:10:50,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:10:50,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 11:10:50,550 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 11:10:50,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:50,550 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 11:10:50,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 11:10:50,550 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 11:10:50,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 11:10:50,551 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:50,551 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 11:10:50,551 INFO L418 AbstractCegarLoop]: === Iteration 42 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:50,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:50,552 INFO L82 PathProgramCache]: Analyzing trace with hash -692041658, now seen corresponding path program 41 times [2019-08-05 11:10:50,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:50,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 11:10:50,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:51,296 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 11:10:51,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:51,301 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:51,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:51,301 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:10:51,341 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_87], 1=[v_bla_b_108]} [2019-08-05 11:10:51,344 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 11:10:51,344 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:51,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:51,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:10:51,357 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:51,357 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:51,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:51,367 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:51,367 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:10:51,411 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_88], 2=[v_bla_b_109]} [2019-08-05 11:10:51,414 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:51,414 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:51,427 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:51,430 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:51,431 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:51,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:51,444 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:51,444 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:10:51,646 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_89], 3=[v_bla_b_110]} [2019-08-05 11:10:51,649 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:51,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:51,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:51,673 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:51,673 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:51,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:51,692 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:51,693 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:10:51,786 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_90], 4=[v_bla_b_111]} [2019-08-05 11:10:51,816 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:51,816 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:51,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:51,844 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:10:51,845 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:51,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:51,864 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:51,864 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:10:51,941 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:51,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:51,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 11:10:51,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 11:10:51,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 11:10:51,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:10:51,943 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 11:10:53,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:53,415 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 11:10:53,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 11:10:53,415 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 11:10:53,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:53,416 INFO L225 Difference]: With dead ends: 47 [2019-08-05 11:10:53,416 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 11:10:53,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:10:53,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 11:10:53,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 11:10:53,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 11:10:53,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 11:10:53,419 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 11:10:53,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:53,419 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 11:10:53,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 11:10:53,419 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 11:10:53,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:10:53,419 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:53,419 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 11:10:53,420 INFO L418 AbstractCegarLoop]: === Iteration 43 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:53,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:53,420 INFO L82 PathProgramCache]: Analyzing trace with hash 21543136, now seen corresponding path program 42 times [2019-08-05 11:10:53,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:53,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:53,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 11:10:53,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:54,278 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 11:10:54,278 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:54,284 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:54,284 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:54,284 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:10:54,322 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_91], 1=[v_bla_b_113]} [2019-08-05 11:10:54,325 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 11:10:54,325 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:54,334 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:54,339 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:54,340 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:54,346 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:54,346 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:54,347 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:10:54,394 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_92], 2=[v_bla_b_114]} [2019-08-05 11:10:54,397 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:54,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:54,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:54,414 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:54,415 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:54,426 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:54,426 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:54,426 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:10:54,480 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_93], 3=[v_bla_b_115]} [2019-08-05 11:10:54,483 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:54,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:54,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:54,505 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:54,506 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:54,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:54,523 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:54,523 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:10:54,599 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_94], 4=[v_bla_b_116]} [2019-08-05 11:10:54,602 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:54,602 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:54,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:54,644 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:10:54,645 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:54,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:54,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:54,664 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:10:54,751 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:54,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:54,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:10:54,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 11:10:54,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 11:10:54,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:10:54,753 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 11:10:56,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:56,206 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 11:10:56,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 11:10:56,207 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 11:10:56,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:56,207 INFO L225 Difference]: With dead ends: 48 [2019-08-05 11:10:56,207 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 11:10:56,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:10:56,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 11:10:56,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 11:10:56,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 11:10:56,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 11:10:56,211 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 11:10:56,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:56,211 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 11:10:56,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 11:10:56,211 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 11:10:56,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 11:10:56,212 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:56,212 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 11:10:56,212 INFO L418 AbstractCegarLoop]: === Iteration 44 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:56,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:56,212 INFO L82 PathProgramCache]: Analyzing trace with hash 667835270, now seen corresponding path program 43 times [2019-08-05 11:10:56,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:56,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 11:10:56,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:56,999 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 11:10:56,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:57,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:57,005 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:57,005 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:10:57,053 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_95], 1=[v_bla_b_118]} [2019-08-05 11:10:57,055 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 11:10:57,055 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:57,063 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:57,065 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:57,066 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:57,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:57,075 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:57,075 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:10:57,121 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_96], 2=[v_bla_b_119]} [2019-08-05 11:10:57,123 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:10:57,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:57,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:57,141 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:57,141 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:57,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:57,154 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:57,155 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:10:57,272 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_97], 3=[v_bla_b_120]} [2019-08-05 11:10:57,276 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:10:57,276 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:57,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:57,295 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:57,295 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:57,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:57,314 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:57,315 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:10:57,413 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_98], 4=[v_bla_b_121]} [2019-08-05 11:10:57,421 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:10:57,422 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:57,440 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:57,444 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:10:57,445 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:10:57,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:10:57,496 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:10:57,496 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:10:57,578 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:57,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:57,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 11:10:57,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 11:10:57,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 11:10:57,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:10:57,580 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 11:10:59,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:59,181 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 11:10:59,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 11:10:59,181 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 11:10:59,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:59,182 INFO L225 Difference]: With dead ends: 49 [2019-08-05 11:10:59,182 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 11:10:59,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:10:59,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 11:10:59,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 11:10:59,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 11:10:59,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 11:10:59,185 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 11:10:59,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:59,185 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 11:10:59,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 11:10:59,185 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 11:10:59,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:10:59,186 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:59,186 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 11:10:59,186 INFO L418 AbstractCegarLoop]: === Iteration 45 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:59,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:59,187 INFO L82 PathProgramCache]: Analyzing trace with hash -771945056, now seen corresponding path program 44 times [2019-08-05 11:10:59,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:59,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 11:10:59,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:00,028 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 11:11:00,029 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:00,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:00,034 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:00,034 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:11:00,073 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_99], 1=[v_bla_b_123]} [2019-08-05 11:11:00,075 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 11:11:00,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:00,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:00,087 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:11:00,087 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:00,096 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:00,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:00,096 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:11:00,143 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_100], 2=[v_bla_b_124]} [2019-08-05 11:11:00,147 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:11:00,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:00,160 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:00,163 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:11:00,164 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:00,177 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:00,177 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:00,177 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:11:00,243 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_101], 3=[v_bla_b_125]} [2019-08-05 11:11:00,266 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:11:00,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:00,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:00,285 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:11:00,285 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:00,299 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:00,299 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:00,300 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:11:00,362 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_102], 4=[v_bla_b_126]} [2019-08-05 11:11:00,364 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:11:00,365 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:00,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:00,392 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:11:00,393 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:00,432 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:00,433 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:00,433 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:11:00,510 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:00,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:00,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:11:00,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 11:11:00,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 11:11:00,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:11:00,511 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 11:11:02,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:02,047 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 11:11:02,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:11:02,050 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 11:11:02,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:02,051 INFO L225 Difference]: With dead ends: 50 [2019-08-05 11:11:02,051 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 11:11:02,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:11:02,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 11:11:02,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 11:11:02,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 11:11:02,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 11:11:02,053 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 11:11:02,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:02,053 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 11:11:02,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 11:11:02,053 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 11:11:02,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 11:11:02,053 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:02,053 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 11:11:02,054 INFO L418 AbstractCegarLoop]: === Iteration 46 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:02,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:02,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505094, now seen corresponding path program 45 times [2019-08-05 11:11:02,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:02,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 11:11:02,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:03,289 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 11:11:03,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:03,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:03,296 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:03,296 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:11:03,341 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_103], 1=[v_bla_b_128]} [2019-08-05 11:11:03,345 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 11:11:03,345 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:03,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:03,360 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:11:03,360 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:03,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:03,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:03,370 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:11:03,428 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_104], 2=[v_bla_b_129]} [2019-08-05 11:11:03,431 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:11:03,431 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:03,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:03,447 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:11:03,448 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:03,461 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:03,462 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:03,462 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:11:03,519 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_105], 3=[v_bla_b_130]} [2019-08-05 11:11:03,522 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:11:03,522 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:03,538 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:03,541 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:11:03,542 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:03,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:03,559 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:03,560 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:11:03,627 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_106], 4=[v_bla_b_131]} [2019-08-05 11:11:03,630 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:11:03,630 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:03,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:03,655 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:11:03,656 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:03,695 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:03,696 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:03,696 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:11:03,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:03,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:03,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 11:11:03,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 11:11:03,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 11:11:03,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:11:03,775 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 11:11:05,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:05,403 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 11:11:05,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 11:11:05,404 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 11:11:05,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:05,404 INFO L225 Difference]: With dead ends: 51 [2019-08-05 11:11:05,404 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 11:11:05,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:11:05,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 11:11:05,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 11:11:05,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 11:11:05,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 11:11:05,407 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 11:11:05,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:05,408 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 11:11:05,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 11:11:05,408 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 11:11:05,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 11:11:05,408 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:05,409 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 11:11:05,409 INFO L418 AbstractCegarLoop]: === Iteration 47 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:05,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:05,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081120, now seen corresponding path program 46 times [2019-08-05 11:11:05,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:05,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 11:11:05,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:06,336 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 11:11:06,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:06,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:06,341 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:06,342 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:11:06,382 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_107], 1=[v_bla_b_133]} [2019-08-05 11:11:06,385 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 11:11:06,386 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:06,395 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:06,397 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:11:06,398 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:06,407 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:06,407 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:06,407 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:11:06,566 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_108], 2=[v_bla_b_134]} [2019-08-05 11:11:06,568 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:11:06,568 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:06,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:06,583 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:11:06,583 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:06,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:06,596 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:06,596 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:11:06,654 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_109], 3=[v_bla_b_135]} [2019-08-05 11:11:06,656 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:11:06,656 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:06,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:06,677 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:11:06,677 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:06,694 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:06,694 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:06,694 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:11:06,763 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_110], 4=[v_bla_b_136]} [2019-08-05 11:11:06,765 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:11:06,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:06,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:06,790 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:11:06,790 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:06,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:06,809 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:06,809 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:11:06,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:06,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:06,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 11:11:06,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 11:11:06,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 11:11:06,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:11:06,923 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 11:11:08,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:08,750 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 11:11:08,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 11:11:08,754 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 11:11:08,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:08,755 INFO L225 Difference]: With dead ends: 52 [2019-08-05 11:11:08,755 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 11:11:08,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:11:08,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 11:11:08,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 11:11:08,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 11:11:08,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 11:11:08,757 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 11:11:08,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:08,757 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 11:11:08,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 11:11:08,757 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 11:11:08,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 11:11:08,758 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:08,758 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 11:11:08,758 INFO L418 AbstractCegarLoop]: === Iteration 48 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:08,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:08,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192890, now seen corresponding path program 47 times [2019-08-05 11:11:08,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:08,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 11:11:08,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:09,911 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 11:11:09,911 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:09,916 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:09,917 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:09,917 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:11:09,957 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_111], 1=[v_bla_b_138]} [2019-08-05 11:11:09,959 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 11:11:09,959 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:09,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:09,970 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:11:09,971 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:09,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:09,980 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:09,980 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:11:10,027 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_112], 2=[v_bla_b_139]} [2019-08-05 11:11:10,030 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:11:10,030 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:10,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:10,047 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:11:10,047 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:10,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:10,060 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:10,060 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:11:10,118 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_113], 3=[v_bla_b_140]} [2019-08-05 11:11:10,122 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:11:10,122 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:10,139 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:10,142 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:11:10,142 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:10,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:10,159 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:10,159 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:11:10,231 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_114], 4=[v_bla_b_141]} [2019-08-05 11:11:10,234 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:11:10,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:10,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:10,281 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:11:10,282 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:10,300 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:10,300 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:10,300 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:11:10,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:10,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:10,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 11:11:10,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 11:11:10,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 11:11:10,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:11:10,384 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 11:11:12,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:12,162 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 11:11:12,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 11:11:12,163 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 11:11:12,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:12,164 INFO L225 Difference]: With dead ends: 53 [2019-08-05 11:11:12,164 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 11:11:12,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:11:12,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 11:11:12,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 11:11:12,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 11:11:12,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 11:11:12,168 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 11:11:12,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:12,168 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 11:11:12,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 11:11:12,168 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 11:11:12,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 11:11:12,169 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:12,169 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 11:11:12,169 INFO L418 AbstractCegarLoop]: === Iteration 49 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:12,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:12,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593312, now seen corresponding path program 48 times [2019-08-05 11:11:12,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:12,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 11:11:12,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:13,310 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 11:11:13,310 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:13,321 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:13,321 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:13,322 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:11:13,427 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_115], 1=[v_bla_b_143]} [2019-08-05 11:11:13,431 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 11:11:13,431 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:13,440 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:13,443 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:11:13,443 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:13,452 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:13,452 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:13,453 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:11:13,504 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_116], 2=[v_bla_b_144]} [2019-08-05 11:11:13,507 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:11:13,507 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:13,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:13,522 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:11:13,522 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:13,534 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:13,534 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:13,535 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:11:13,594 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_117], 3=[v_bla_b_145]} [2019-08-05 11:11:13,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:13,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:13,598 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:11:13,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:13,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:13,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:13,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:13,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:13,622 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:11:13,622 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:13,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:13,639 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:13,639 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:11:13,710 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_118], 4=[v_bla_b_146]} [2019-08-05 11:11:13,714 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:11:13,715 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:13,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:13,743 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:11:13,743 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:13,760 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:13,761 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:13,761 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:11:13,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:13,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:13,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 11:11:13,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 11:11:13,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 11:11:13,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:11:13,838 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 11:11:15,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:15,663 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 11:11:15,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 11:11:15,664 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 11:11:15,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:15,665 INFO L225 Difference]: With dead ends: 54 [2019-08-05 11:11:15,665 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 11:11:15,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:11:15,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 11:11:15,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 11:11:15,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:11:15,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 11:11:15,667 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 11:11:15,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:15,668 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 11:11:15,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 11:11:15,668 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 11:11:15,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 11:11:15,668 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:15,668 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 11:11:15,669 INFO L418 AbstractCegarLoop]: === Iteration 50 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:15,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:15,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1250314938, now seen corresponding path program 49 times [2019-08-05 11:11:15,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:15,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:15,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-05 11:11:15,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:16,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 11:11:16,596 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:16,601 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:16,601 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:16,601 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:11:16,642 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_119], 1=[v_bla_b_148]} [2019-08-05 11:11:16,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 11:11:16,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:16,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:16,658 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:11:16,659 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:16,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:16,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:16,668 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:11:16,724 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_120], 2=[v_bla_b_149]} [2019-08-05 11:11:16,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:16,758 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:11:16,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:16,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:16,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:16,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:16,778 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:11:16,778 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:16,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:16,789 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:16,790 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:11:16,850 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_121], 3=[v_bla_b_150]} [2019-08-05 11:11:16,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:16,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:16,854 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:11:16,854 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:16,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:16,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:16,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:16,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:16,877 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:11:16,878 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:16,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:16,895 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:16,895 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:11:17,000 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:11:17,001 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:17,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:17,022 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:11:17,023 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:17,041 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:17,042 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:17,042 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:11:17,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:17,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:17,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 11:11:17,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 11:11:17,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 11:11:17,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:11:17,126 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 11:11:19,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:19,136 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 11:11:19,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 11:11:19,137 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 11:11:19,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:19,138 INFO L225 Difference]: With dead ends: 55 [2019-08-05 11:11:19,138 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 11:11:19,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:11:19,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 11:11:19,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 11:11:19,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 11:11:19,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 11:11:19,140 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 11:11:19,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:19,141 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 11:11:19,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 11:11:19,141 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 11:11:19,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:11:19,141 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:19,142 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 11:11:19,142 INFO L418 AbstractCegarLoop]: === Iteration 51 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:19,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:19,143 INFO L82 PathProgramCache]: Analyzing trace with hash -105059360, now seen corresponding path program 50 times [2019-08-05 11:11:19,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:19,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 122 conjunts are in the unsatisfiable core [2019-08-05 11:11:19,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:20,309 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 11:11:20,309 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:20,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:20,314 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:20,314 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:11:20,359 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_123], 1=[v_bla_b_153]} [2019-08-05 11:11:20,361 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 11:11:20,361 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:20,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:20,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:20,373 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:11:20,374 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:20,383 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:20,384 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:20,384 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:11:20,437 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_124], 2=[v_bla_b_154]} [2019-08-05 11:11:20,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:20,441 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:11:20,442 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:20,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:20,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:20,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:20,461 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:11:20,461 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:20,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:20,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:20,474 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:11:20,535 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_125], 3=[v_bla_b_155]} [2019-08-05 11:11:20,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:20,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:20,539 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:11:20,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:20,557 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:20,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:20,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:20,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:20,563 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:11:20,563 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:20,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:20,581 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:20,581 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:11:20,646 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_126], 4=[v_bla_b_156]} [2019-08-05 11:11:20,649 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:11:20,649 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:20,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:20,673 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:11:20,673 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:20,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:20,693 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:20,693 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:11:20,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:20,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:20,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 11:11:20,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 11:11:20,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 11:11:20,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:11:20,780 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 11:11:22,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:22,748 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 11:11:22,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 11:11:22,749 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 11:11:22,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:22,750 INFO L225 Difference]: With dead ends: 56 [2019-08-05 11:11:22,750 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 11:11:22,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:11:22,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 11:11:22,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 11:11:22,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 11:11:22,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 11:11:22,752 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 11:11:22,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:22,753 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 11:11:22,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 11:11:22,753 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 11:11:22,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:11:22,753 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:22,753 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 11:11:22,754 INFO L418 AbstractCegarLoop]: === Iteration 52 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:22,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:22,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125190, now seen corresponding path program 51 times [2019-08-05 11:11:22,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:22,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 124 conjunts are in the unsatisfiable core [2019-08-05 11:11:22,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:24,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 11:11:24,122 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:24,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:24,128 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:24,128 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:11:24,174 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_127], 1=[v_bla_b_158]} [2019-08-05 11:11:24,176 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 11:11:24,176 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:24,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:24,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:24,188 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:11:24,188 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:24,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:24,198 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:24,198 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:11:24,252 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_128], 2=[v_bla_b_159]} [2019-08-05 11:11:24,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:24,255 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:11:24,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:24,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:24,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:24,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:24,272 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:11:24,273 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:24,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:24,285 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:24,285 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:11:24,348 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_129], 3=[v_bla_b_160]} [2019-08-05 11:11:24,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:24,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:24,352 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:11:24,352 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:24,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:24,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:24,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:24,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:24,375 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:11:24,376 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:24,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:24,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:24,393 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:11:24,463 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_130], 4=[v_bla_b_161]} [2019-08-05 11:11:24,465 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:11:24,465 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:24,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:24,490 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:11:24,490 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:24,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:24,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:24,510 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:11:24,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:24,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:24,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 11:11:24,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 11:11:24,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 11:11:24,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:11:24,594 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 11:11:26,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:26,659 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 11:11:26,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 11:11:26,659 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 11:11:26,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:26,660 INFO L225 Difference]: With dead ends: 57 [2019-08-05 11:11:26,661 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 11:11:26,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:11:26,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 11:11:26,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 11:11:26,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 11:11:26,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 11:11:26,663 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 11:11:26,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:26,664 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 11:11:26,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 11:11:26,664 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 11:11:26,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 11:11:26,664 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:26,664 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 11:11:26,665 INFO L418 AbstractCegarLoop]: === Iteration 53 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:26,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:26,665 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107872, now seen corresponding path program 52 times [2019-08-05 11:11:26,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:26,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:26,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 126 conjunts are in the unsatisfiable core [2019-08-05 11:11:26,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:27,807 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 11:11:27,808 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:27,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:27,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:27,814 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:11:27,861 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_131], 1=[v_bla_b_163]} [2019-08-05 11:11:27,864 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 11:11:27,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:27,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:27,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:27,877 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:11:27,878 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:27,886 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:27,887 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:27,887 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:11:27,943 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_132], 2=[v_bla_b_164]} [2019-08-05 11:11:27,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:27,947 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:11:27,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:27,960 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:27,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:27,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:27,965 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:11:27,965 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:27,978 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:27,978 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:27,978 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:11:28,040 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_133], 3=[v_bla_b_165]} [2019-08-05 11:11:28,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:28,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:28,043 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:11:28,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:28,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:28,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:28,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:28,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:28,064 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:11:28,065 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:28,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:28,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:28,082 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:11:28,160 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:11:28,161 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:28,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:28,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:11:28,184 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:28,201 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:28,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:28,202 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:11:28,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:28,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:28,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 11:11:28,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 11:11:28,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 11:11:28,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:11:28,286 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 11:11:30,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:30,555 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 11:11:30,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:11:30,555 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 11:11:30,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:30,556 INFO L225 Difference]: With dead ends: 58 [2019-08-05 11:11:30,556 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 11:11:30,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:11:30,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 11:11:30,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 11:11:30,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 11:11:30,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 11:11:30,560 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 11:11:30,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:30,560 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 11:11:30,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 11:11:30,560 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 11:11:30,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 11:11:30,561 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:30,561 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 11:11:30,561 INFO L418 AbstractCegarLoop]: === Iteration 54 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:30,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:30,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832646, now seen corresponding path program 53 times [2019-08-05 11:11:30,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:30,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 128 conjunts are in the unsatisfiable core [2019-08-05 11:11:30,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:31,641 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 11:11:31,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:31,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:31,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:31,647 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:11:31,692 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_135], 1=[v_bla_b_168]} [2019-08-05 11:11:31,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 11:11:31,696 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:31,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:31,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:31,708 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:11:31,708 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:31,717 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:31,717 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:31,718 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:11:31,771 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_136], 2=[v_bla_b_169]} [2019-08-05 11:11:31,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:31,779 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:11:31,779 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:31,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:31,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:31,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:31,795 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:11:31,796 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:31,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:31,808 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:31,808 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:11:31,869 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_137], 3=[v_bla_b_170]} [2019-08-05 11:11:31,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:31,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:31,874 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:11:31,875 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:31,891 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:31,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:31,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:31,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:31,897 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:11:31,897 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:31,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:31,913 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:31,914 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:11:31,987 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_138], 4=[v_bla_b_171]} [2019-08-05 11:11:31,990 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:11:31,990 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:32,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:32,019 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:11:32,020 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:32,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:32,037 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:32,037 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:11:32,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:32,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:32,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 11:11:32,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 11:11:32,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 11:11:32,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:11:32,125 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 11:11:34,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:34,460 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 11:11:34,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 11:11:34,460 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 11:11:34,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:34,461 INFO L225 Difference]: With dead ends: 59 [2019-08-05 11:11:34,461 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 11:11:34,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:11:34,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 11:11:34,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 11:11:34,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 11:11:34,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 11:11:34,464 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 11:11:34,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:34,464 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 11:11:34,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 11:11:34,465 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 11:11:34,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 11:11:34,465 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:34,465 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 11:11:34,465 INFO L418 AbstractCegarLoop]: === Iteration 55 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:34,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:34,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895584, now seen corresponding path program 54 times [2019-08-05 11:11:34,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:34,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 130 conjunts are in the unsatisfiable core [2019-08-05 11:11:34,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:35,689 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 11:11:35,689 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:35,695 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:35,695 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:35,695 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:11:35,742 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_139], 1=[v_bla_b_173]} [2019-08-05 11:11:35,744 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 11:11:35,744 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:35,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:35,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:35,755 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:11:35,756 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:35,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:35,765 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:35,765 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:11:35,818 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_140], 2=[v_bla_b_174]} [2019-08-05 11:11:35,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:35,822 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:11:35,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:35,835 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:35,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:35,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:35,840 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:11:35,841 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:35,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:35,853 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:35,854 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:11:35,918 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_141], 3=[v_bla_b_175]} [2019-08-05 11:11:35,942 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:11:35,942 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:36,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:36,007 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:11:36,007 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:36,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:36,021 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:36,021 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:11:36,096 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_142], 4=[v_bla_b_176]} [2019-08-05 11:11:36,099 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:11:36,099 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:36,119 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:36,122 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:11:36,122 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:36,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:36,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:36,142 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:11:36,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:36,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:36,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 11:11:36,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 11:11:36,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 11:11:36,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:11:36,227 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 11:11:38,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:38,510 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 11:11:38,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 11:11:38,511 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 11:11:38,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:38,512 INFO L225 Difference]: With dead ends: 60 [2019-08-05 11:11:38,512 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 11:11:38,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:11:38,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 11:11:38,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 11:11:38,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:11:38,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 11:11:38,515 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 11:11:38,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:38,515 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 11:11:38,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 11:11:38,515 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 11:11:38,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 11:11:38,516 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:38,516 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 11:11:38,516 INFO L418 AbstractCegarLoop]: === Iteration 56 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:38,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:38,516 INFO L82 PathProgramCache]: Analyzing trace with hash -836059386, now seen corresponding path program 55 times [2019-08-05 11:11:38,517 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:38,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 132 conjunts are in the unsatisfiable core [2019-08-05 11:11:38,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:39,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 11:11:39,885 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:39,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:39,890 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:39,890 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:11:39,938 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_143], 1=[v_bla_b_178]} [2019-08-05 11:11:39,941 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 11:11:39,941 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:39,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:39,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:39,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:11:39,954 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:39,961 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:39,962 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:39,962 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:11:40,021 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_144], 2=[v_bla_b_179]} [2019-08-05 11:11:40,024 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:11:40,025 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:40,038 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:40,041 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:11:40,041 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:40,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:40,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:40,053 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:11:40,120 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_145], 3=[v_bla_b_180]} [2019-08-05 11:11:40,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:40,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:40,124 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:11:40,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:40,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:40,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:40,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:40,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:40,148 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:11:40,149 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:40,163 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:40,163 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:40,163 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:11:40,240 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_146], 4=[v_bla_b_181]} [2019-08-05 11:11:40,242 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:11:40,243 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:40,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:40,264 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:11:40,264 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:40,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:40,284 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:40,284 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:11:40,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:40,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:40,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 11:11:40,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 11:11:40,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 11:11:40,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:11:40,378 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 11:11:42,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:42,730 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 11:11:42,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 11:11:42,730 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 11:11:42,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:42,731 INFO L225 Difference]: With dead ends: 61 [2019-08-05 11:11:42,731 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 11:11:42,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:11:42,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 11:11:42,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 11:11:42,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 11:11:42,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 11:11:42,734 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 11:11:42,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:42,734 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 11:11:42,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 11:11:42,734 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 11:11:42,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 11:11:42,735 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:42,735 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 11:11:42,735 INFO L418 AbstractCegarLoop]: === Iteration 57 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:42,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:42,735 INFO L82 PathProgramCache]: Analyzing trace with hash -148039136, now seen corresponding path program 56 times [2019-08-05 11:11:42,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:42,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 134 conjunts are in the unsatisfiable core [2019-08-05 11:11:42,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:44,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 11:11:44,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:44,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:44,142 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:44,142 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:11:44,191 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_147], 1=[v_bla_b_183]} [2019-08-05 11:11:44,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 11:11:44,195 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:44,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:44,206 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:11:44,206 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:44,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:44,215 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:44,216 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:11:44,284 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_148], 2=[v_bla_b_184]} [2019-08-05 11:11:44,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:44,288 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:11:44,289 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:44,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:44,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:44,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:44,307 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:11:44,307 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:44,320 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:44,321 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:44,321 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:11:44,386 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_149], 3=[v_bla_b_185]} [2019-08-05 11:11:44,388 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:11:44,388 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:44,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:44,409 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:11:44,410 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:44,426 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:44,426 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:44,427 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:11:44,503 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_150], 4=[v_bla_b_186]} [2019-08-05 11:11:44,506 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:11:44,507 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:44,527 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:44,529 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:11:44,530 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:44,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:44,549 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:44,549 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:11:44,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:44,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:44,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 11:11:44,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 11:11:44,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 11:11:44,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:11:44,647 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 11:11:47,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:47,075 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 11:11:47,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 11:11:47,076 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 11:11:47,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:47,076 INFO L225 Difference]: With dead ends: 62 [2019-08-05 11:11:47,077 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 11:11:47,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:11:47,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 11:11:47,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 11:11:47,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:11:47,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 11:11:47,080 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 11:11:47,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:47,081 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 11:11:47,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 11:11:47,081 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 11:11:47,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 11:11:47,081 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:47,081 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 11:11:47,082 INFO L418 AbstractCegarLoop]: === Iteration 58 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:47,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:47,082 INFO L82 PathProgramCache]: Analyzing trace with hash -294247866, now seen corresponding path program 57 times [2019-08-05 11:11:47,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:47,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:47,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 136 conjunts are in the unsatisfiable core [2019-08-05 11:11:47,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:48,331 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 11:11:48,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:48,337 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:48,337 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:48,337 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:11:48,388 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_151], 1=[v_bla_b_188]} [2019-08-05 11:11:48,390 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 11:11:48,390 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:48,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:48,401 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:11:48,402 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:11:48,402 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:48,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:48,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:48,410 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:11:48,467 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_152], 2=[v_bla_b_189]} [2019-08-05 11:11:48,469 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:11:48,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:48,482 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:48,485 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:11:48,485 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:48,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:48,498 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:48,499 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:11:48,565 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_153], 3=[v_bla_b_190]} [2019-08-05 11:11:48,569 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:11:48,569 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:48,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:48,592 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:11:48,592 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:48,610 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:48,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:48,611 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:11:48,687 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_154], 4=[v_bla_b_191]} [2019-08-05 11:11:48,690 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:11:48,690 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:48,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:48,713 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:11:48,714 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:48,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:48,733 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:48,733 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:11:48,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:48,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:48,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 11:11:48,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 11:11:48,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 11:11:48,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:11:48,831 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 11:11:51,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:51,465 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 11:11:51,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 11:11:51,466 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 11:11:51,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:51,467 INFO L225 Difference]: With dead ends: 63 [2019-08-05 11:11:51,467 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 11:11:51,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:11:51,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 11:11:51,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 11:11:51,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 11:11:51,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 11:11:51,470 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 11:11:51,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:51,471 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 11:11:51,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 11:11:51,471 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 11:11:51,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:51,471 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:51,471 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 11:11:51,472 INFO L418 AbstractCegarLoop]: === Iteration 59 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:51,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:51,472 INFO L82 PathProgramCache]: Analyzing trace with hash -531751200, now seen corresponding path program 58 times [2019-08-05 11:11:51,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:51,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 138 conjunts are in the unsatisfiable core [2019-08-05 11:11:51,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:52,740 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 11:11:52,740 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:52,745 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:52,746 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:52,746 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:11:52,796 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_155], 1=[v_bla_b_193]} [2019-08-05 11:11:52,798 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 11:11:52,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:52,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:52,810 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:11:52,810 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:52,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:52,820 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:52,820 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:11:52,881 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_156], 2=[v_bla_b_194]} [2019-08-05 11:11:52,883 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:11:52,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:52,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:52,899 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:11:52,900 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:52,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:52,912 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:52,913 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:11:53,009 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_157], 3=[v_bla_b_195]} [2019-08-05 11:11:53,035 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:11:53,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:53,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:53,077 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:11:53,077 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:53,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:53,095 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:53,095 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:11:53,176 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_158], 4=[v_bla_b_196]} [2019-08-05 11:11:53,178 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:11:53,179 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:53,198 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:53,201 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:11:53,201 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:53,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:53,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:53,220 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:11:53,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:53,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:53,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 11:11:53,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 11:11:53,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 11:11:53,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:11:53,317 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 11:11:56,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:56,048 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 11:11:56,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 11:11:56,048 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 11:11:56,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:56,049 INFO L225 Difference]: With dead ends: 64 [2019-08-05 11:11:56,049 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 11:11:56,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:11:56,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 11:11:56,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 11:11:56,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:11:56,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 11:11:56,051 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 11:11:56,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:56,051 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 11:11:56,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 11:11:56,051 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 11:11:56,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 11:11:56,052 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:56,052 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 11:11:56,052 INFO L418 AbstractCegarLoop]: === Iteration 60 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:56,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:56,052 INFO L82 PathProgramCache]: Analyzing trace with hash 695580038, now seen corresponding path program 59 times [2019-08-05 11:11:56,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:56,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 140 conjunts are in the unsatisfiable core [2019-08-05 11:11:56,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:57,418 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 11:11:57,418 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:57,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:57,424 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:57,424 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:11:57,481 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_159], 1=[v_bla_b_198]} [2019-08-05 11:11:57,483 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 11:11:57,483 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:57,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:57,512 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:11:57,512 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:57,521 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:57,521 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:57,522 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:11:57,584 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_160], 2=[v_bla_b_199]} [2019-08-05 11:11:57,587 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:11:57,587 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:57,601 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:57,603 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:11:57,604 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:57,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:57,616 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:57,617 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:11:57,681 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_161], 3=[v_bla_b_200]} [2019-08-05 11:11:57,685 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:11:57,686 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:57,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:57,708 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:11:57,708 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:57,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:57,725 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:57,725 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:11:57,873 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:11:57,874 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:58,023 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-08-05 11:11:58,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:58,034 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:11:58,034 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:11:58,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:11:58,051 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:11:58,051 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:11:58,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:58,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:58,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 11:11:58,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 11:11:58,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 11:11:58,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:11:58,147 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 11:12:01,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:01,030 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 11:12:01,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 11:12:01,031 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 11:12:01,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:01,032 INFO L225 Difference]: With dead ends: 65 [2019-08-05 11:12:01,032 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 11:12:01,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:12:01,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 11:12:01,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 11:12:01,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 11:12:01,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 11:12:01,034 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 11:12:01,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:01,035 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 11:12:01,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 11:12:01,035 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 11:12:01,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 11:12:01,036 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:01,036 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 11:12:01,036 INFO L418 AbstractCegarLoop]: === Iteration 61 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:01,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:01,036 INFO L82 PathProgramCache]: Analyzing trace with hash 88142752, now seen corresponding path program 60 times [2019-08-05 11:12:01,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:01,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 142 conjunts are in the unsatisfiable core [2019-08-05 11:12:01,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:02,412 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 11:12:02,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:02,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:02,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:02,418 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:12:02,471 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_163], 1=[v_bla_b_203]} [2019-08-05 11:12:02,473 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 11:12:02,473 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:02,482 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:02,485 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:12:02,485 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:02,494 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:02,494 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:02,495 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:12:02,554 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_164], 2=[v_bla_b_204]} [2019-08-05 11:12:02,557 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:12:02,557 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:02,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:02,573 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:12:02,574 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:02,586 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:02,587 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:02,587 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:12:02,659 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_165], 3=[v_bla_b_205]} [2019-08-05 11:12:02,661 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:12:02,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:02,678 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:02,681 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:12:02,681 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:02,696 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:02,697 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:02,697 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:12:02,797 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_166], 4=[v_bla_b_206]} [2019-08-05 11:12:02,801 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:12:02,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:02,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:02,824 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:12:02,825 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:02,852 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:02,852 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:02,852 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:12:02,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:02,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:02,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 11:12:02,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 11:12:02,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 11:12:02,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:12:02,951 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 11:12:05,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:05,856 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 11:12:05,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 11:12:05,857 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 11:12:05,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:05,857 INFO L225 Difference]: With dead ends: 66 [2019-08-05 11:12:05,858 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 11:12:05,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:12:05,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 11:12:05,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 11:12:05,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:12:05,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 11:12:05,860 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 11:12:05,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:05,860 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 11:12:05,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 11:12:05,861 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 11:12:05,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 11:12:05,861 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:05,861 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 11:12:05,861 INFO L418 AbstractCegarLoop]: === Iteration 62 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:05,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:05,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543930, now seen corresponding path program 61 times [2019-08-05 11:12:05,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:05,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:05,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 144 conjunts are in the unsatisfiable core [2019-08-05 11:12:05,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:07,280 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 11:12:07,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:07,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:07,286 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:07,286 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:12:07,340 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_167], 1=[v_bla_b_208]} [2019-08-05 11:12:07,342 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 11:12:07,342 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:07,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:07,353 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:12:07,354 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:07,362 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:07,363 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:07,363 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:12:07,425 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_168], 2=[v_bla_b_209]} [2019-08-05 11:12:07,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:12:07,428 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:07,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:07,443 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:12:07,444 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:07,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:07,456 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:07,457 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:12:07,541 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_169], 3=[v_bla_b_210]} [2019-08-05 11:12:07,543 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:12:07,543 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:07,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:07,561 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:12:07,562 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:07,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:07,579 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:07,579 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:12:07,659 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_170], 4=[v_bla_b_211]} [2019-08-05 11:12:07,662 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:12:07,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:07,682 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:07,684 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:12:07,685 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:07,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:07,704 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:07,705 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:12:07,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:07,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:07,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 11:12:07,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 11:12:07,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 11:12:07,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:12:07,806 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 11:12:10,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:10,826 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 11:12:10,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 11:12:10,827 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 11:12:10,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:10,828 INFO L225 Difference]: With dead ends: 67 [2019-08-05 11:12:10,828 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 11:12:10,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:12:10,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 11:12:10,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 11:12:10,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 11:12:10,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 11:12:10,831 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 11:12:10,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:10,831 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 11:12:10,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 11:12:10,832 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 11:12:10,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 11:12:10,832 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:10,832 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 11:12:10,832 INFO L418 AbstractCegarLoop]: === Iteration 63 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:10,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:10,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223520, now seen corresponding path program 62 times [2019-08-05 11:12:10,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:10,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 146 conjunts are in the unsatisfiable core [2019-08-05 11:12:10,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:12,285 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 11:12:12,285 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:12,290 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:12,290 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:12,290 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:12:12,351 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_171], 1=[v_bla_b_213]} [2019-08-05 11:12:12,353 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 11:12:12,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:12,371 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:12,374 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:12:12,374 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:12,383 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:12,383 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:12,383 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:12:12,444 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_172], 2=[v_bla_b_214]} [2019-08-05 11:12:12,446 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:12:12,447 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:12,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:12,469 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:12:12,469 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:12,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:12,482 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:12,482 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:12:12,556 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_173], 3=[v_bla_b_215]} [2019-08-05 11:12:12,560 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:12:12,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:12,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:12,584 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:12:12,584 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:12,601 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:12,602 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:12,602 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:12:12,687 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_174], 4=[v_bla_b_216]} [2019-08-05 11:12:12,689 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:12:12,690 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:12,711 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:12,723 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:12:12,723 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:12,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:12,742 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:12,742 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:12:12,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:12,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:12,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 11:12:12,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 11:12:12,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 11:12:12,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:12:12,848 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 11:12:16,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:16,004 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 11:12:16,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 11:12:16,004 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 11:12:16,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:16,005 INFO L225 Difference]: With dead ends: 68 [2019-08-05 11:12:16,005 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 11:12:16,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:12:16,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 11:12:16,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 11:12:16,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 11:12:16,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 11:12:16,008 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 11:12:16,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:16,008 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 11:12:16,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 11:12:16,009 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 11:12:16,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 11:12:16,009 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:16,009 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 11:12:16,009 INFO L418 AbstractCegarLoop]: === Iteration 64 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:16,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:16,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774598, now seen corresponding path program 63 times [2019-08-05 11:12:16,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:16,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 148 conjunts are in the unsatisfiable core [2019-08-05 11:12:16,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:17,514 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 11:12:17,515 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:17,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:17,521 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:17,521 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:12:17,576 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_175], 1=[v_bla_b_218]} [2019-08-05 11:12:17,578 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 11:12:17,578 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:17,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:17,590 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:12:17,590 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:17,599 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:17,600 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:17,600 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:12:17,663 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_176], 2=[v_bla_b_219]} [2019-08-05 11:12:17,667 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:12:17,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:17,681 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:17,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:12:17,687 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:17,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:17,707 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:17,707 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:12:17,780 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_177], 3=[v_bla_b_220]} [2019-08-05 11:12:17,790 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:12:17,791 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:17,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:17,812 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:12:17,813 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:17,830 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:17,830 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:17,831 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:12:17,916 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_178], 4=[v_bla_b_221]} [2019-08-05 11:12:17,918 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:12:17,918 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:17,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:17,942 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:12:17,943 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:17,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:17,964 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:17,964 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:12:18,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:18,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:18,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 11:12:18,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 11:12:18,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 11:12:18,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:12:18,069 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 11:12:21,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:21,243 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 11:12:21,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 11:12:21,244 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 11:12:21,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:21,245 INFO L225 Difference]: With dead ends: 69 [2019-08-05 11:12:21,245 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 11:12:21,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:12:21,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 11:12:21,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 11:12:21,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 11:12:21,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 11:12:21,248 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 11:12:21,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:21,248 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 11:12:21,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 11:12:21,249 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 11:12:21,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 11:12:21,249 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:21,249 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 11:12:21,249 INFO L418 AbstractCegarLoop]: === Iteration 65 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:21,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:21,250 INFO L82 PathProgramCache]: Analyzing trace with hash -892596960, now seen corresponding path program 64 times [2019-08-05 11:12:21,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:21,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 150 conjunts are in the unsatisfiable core [2019-08-05 11:12:21,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:22,798 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 11:12:22,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:22,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:22,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:22,804 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:12:22,858 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_179], 1=[v_bla_b_223]} [2019-08-05 11:12:22,860 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 11:12:22,860 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:22,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:22,871 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:12:22,872 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:22,880 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:22,881 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:22,881 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:12:22,945 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_180], 2=[v_bla_b_224]} [2019-08-05 11:12:22,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:12:22,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:22,961 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:22,963 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:12:22,964 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:22,976 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:22,976 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:22,977 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:12:23,047 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_181], 3=[v_bla_b_225]} [2019-08-05 11:12:23,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:23,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:23,053 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:12:23,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:23,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:23,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:23,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:23,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:23,077 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:12:23,078 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:23,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:23,095 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:23,096 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:12:23,199 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_182], 4=[v_bla_b_226]} [2019-08-05 11:12:23,205 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:12:23,205 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:23,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:23,227 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:12:23,228 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:23,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:23,247 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:23,248 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:12:23,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:23,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:23,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 11:12:23,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 11:12:23,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 11:12:23,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:12:23,357 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 11:12:26,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:26,674 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 11:12:26,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 11:12:26,674 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 11:12:26,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:26,675 INFO L225 Difference]: With dead ends: 70 [2019-08-05 11:12:26,675 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 11:12:26,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:12:26,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 11:12:26,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 11:12:26,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:12:26,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 11:12:26,678 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 11:12:26,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:26,678 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 11:12:26,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 11:12:26,678 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 11:12:26,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:12:26,679 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:26,679 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 11:12:26,679 INFO L418 AbstractCegarLoop]: === Iteration 66 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:26,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:26,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703930, now seen corresponding path program 65 times [2019-08-05 11:12:26,680 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:26,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 152 conjunts are in the unsatisfiable core [2019-08-05 11:12:26,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:28,275 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 11:12:28,275 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:28,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:28,281 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:28,281 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:12:28,359 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_183], 1=[v_bla_b_228]} [2019-08-05 11:12:28,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 11:12:28,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:28,518 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 11:12:28,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:28,541 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:12:28,542 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:28,664 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-08-05 11:12:28,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:28,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:28,664 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:12:28,731 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_184], 2=[v_bla_b_229]} [2019-08-05 11:12:28,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:28,735 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:12:28,736 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:28,749 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:28,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:28,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:28,753 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:12:28,754 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:28,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:28,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:28,767 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:12:28,844 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_185], 3=[v_bla_b_230]} [2019-08-05 11:12:28,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:28,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:28,848 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:12:28,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:28,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:28,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:28,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:28,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:28,871 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:12:28,871 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:28,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:28,888 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:28,888 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:12:28,974 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_186], 4=[v_bla_b_231]} [2019-08-05 11:12:28,977 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:12:28,977 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:28,998 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:29,001 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:12:29,002 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:29,020 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:29,021 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:29,021 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:12:29,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:29,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:29,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 11:12:29,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 11:12:29,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 11:12:29,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:12:29,129 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 11:12:32,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:32,497 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 11:12:32,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 11:12:32,497 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 11:12:32,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:32,498 INFO L225 Difference]: With dead ends: 71 [2019-08-05 11:12:32,498 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 11:12:32,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:12:32,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 11:12:32,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 11:12:32,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 11:12:32,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 11:12:32,502 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 11:12:32,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:32,502 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 11:12:32,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 11:12:32,502 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 11:12:32,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:12:32,503 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:32,503 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 11:12:32,503 INFO L418 AbstractCegarLoop]: === Iteration 67 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:32,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:32,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718368, now seen corresponding path program 66 times [2019-08-05 11:12:32,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:32,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 154 conjunts are in the unsatisfiable core [2019-08-05 11:12:32,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:36,793 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 11:12:36,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:36,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:36,798 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:36,798 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:12:36,856 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_187], 1=[v_bla_b_233]} [2019-08-05 11:12:36,858 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 11:12:36,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:36,867 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:36,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:36,871 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:12:36,871 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:36,880 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:36,880 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:36,881 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:12:36,945 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_188], 2=[v_bla_b_234]} [2019-08-05 11:12:36,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:36,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:12:36,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:36,961 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:36,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:36,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:36,966 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:12:36,966 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:36,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:36,979 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:36,979 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:12:37,050 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_189], 3=[v_bla_b_235]} [2019-08-05 11:12:37,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:37,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:37,055 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:12:37,056 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:37,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:37,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:37,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:37,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:37,078 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:12:37,079 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:37,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:37,095 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:37,096 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:12:37,181 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_190], 4=[v_bla_b_236]} [2019-08-05 11:12:37,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:12:37,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:37,204 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:37,207 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:12:37,207 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:37,226 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:37,226 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:37,227 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:12:37,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:37,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:37,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 11:12:37,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 11:12:37,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 11:12:37,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:12:37,336 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 11:12:40,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:40,828 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 11:12:40,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 11:12:40,829 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 11:12:40,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:40,829 INFO L225 Difference]: With dead ends: 72 [2019-08-05 11:12:40,829 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 11:12:40,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:12:40,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 11:12:40,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 11:12:40,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:12:40,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 11:12:40,832 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 11:12:40,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:40,832 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 11:12:40,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 11:12:40,832 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 11:12:40,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 11:12:40,833 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:40,833 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 11:12:40,833 INFO L418 AbstractCegarLoop]: === Iteration 68 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:40,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:40,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438202, now seen corresponding path program 67 times [2019-08-05 11:12:40,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:40,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 156 conjunts are in the unsatisfiable core [2019-08-05 11:12:40,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:42,569 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 11:12:42,569 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:42,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:42,573 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:42,573 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:12:42,631 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_191], 1=[v_bla_b_238]} [2019-08-05 11:12:42,633 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 11:12:42,633 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:42,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:42,645 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:42,645 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:12:42,645 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:42,654 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:42,654 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:42,654 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:12:42,722 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_192], 2=[v_bla_b_239]} [2019-08-05 11:12:42,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:42,724 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:12:42,725 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:42,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:42,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:42,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:42,743 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:12:42,743 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:42,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:42,756 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:42,756 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:12:42,843 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_193], 3=[v_bla_b_240]} [2019-08-05 11:12:42,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:42,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:42,851 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:12:42,851 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:42,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:42,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:42,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:42,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:42,875 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:12:42,876 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:42,892 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:42,892 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:42,893 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:12:42,995 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_194], 4=[v_bla_b_241]} [2019-08-05 11:12:42,999 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:12:42,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:43,020 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:43,023 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:12:43,023 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:43,042 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:43,042 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:43,043 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:12:43,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:43,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:43,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 11:12:43,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 11:12:43,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 11:12:43,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:12:43,149 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 11:12:46,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:46,726 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 11:12:46,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 11:12:46,726 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 11:12:46,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:46,727 INFO L225 Difference]: With dead ends: 73 [2019-08-05 11:12:46,727 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 11:12:46,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:12:46,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 11:12:46,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 11:12:46,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 11:12:46,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 11:12:46,730 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 11:12:46,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:46,730 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 11:12:46,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 11:12:46,730 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 11:12:46,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 11:12:46,731 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:46,731 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 11:12:46,731 INFO L418 AbstractCegarLoop]: === Iteration 69 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:46,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:46,731 INFO L82 PathProgramCache]: Analyzing trace with hash 976119456, now seen corresponding path program 68 times [2019-08-05 11:12:46,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:46,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 158 conjunts are in the unsatisfiable core [2019-08-05 11:12:46,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:48,492 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 11:12:48,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:48,497 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:48,498 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:48,498 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:12:48,558 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_195], 1=[v_bla_b_243]} [2019-08-05 11:12:48,559 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 11:12:48,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:48,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:48,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:48,572 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:12:48,572 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:48,581 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:48,581 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:48,581 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:12:48,651 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_196], 2=[v_bla_b_244]} [2019-08-05 11:12:48,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:48,654 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:12:48,654 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:48,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:48,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:48,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:48,672 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:12:48,672 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:48,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:48,685 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:48,686 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:12:48,762 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_197], 3=[v_bla_b_245]} [2019-08-05 11:12:48,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:48,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:48,775 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:12:48,775 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:48,792 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:48,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:48,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:48,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:48,798 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:12:48,798 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:48,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:48,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:48,815 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:12:48,904 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_198], 4=[v_bla_b_246]} [2019-08-05 11:12:48,906 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:12:48,907 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:48,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:48,930 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:12:48,930 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:48,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:48,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:48,951 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:12:49,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:49,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:49,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 11:12:49,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 11:12:49,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 11:12:49,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:12:49,061 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 11:12:52,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:52,811 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 11:12:52,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 11:12:52,812 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 11:12:52,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:52,813 INFO L225 Difference]: With dead ends: 74 [2019-08-05 11:12:52,813 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 11:12:52,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:12:52,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 11:12:52,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 11:12:52,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:12:52,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 11:12:52,817 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 11:12:52,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:52,817 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 11:12:52,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 11:12:52,817 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 11:12:52,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 11:12:52,818 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:52,818 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 11:12:52,818 INFO L418 AbstractCegarLoop]: === Iteration 70 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:52,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:52,818 INFO L82 PathProgramCache]: Analyzing trace with hash 194930118, now seen corresponding path program 69 times [2019-08-05 11:12:52,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:52,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:53,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 160 conjunts are in the unsatisfiable core [2019-08-05 11:12:53,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:54,668 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 11:12:54,669 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:54,674 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:54,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:54,675 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:12:54,734 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_199], 1=[v_bla_b_248]} [2019-08-05 11:12:54,737 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 11:12:54,737 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:54,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:54,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:54,750 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:12:54,750 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:54,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:54,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:54,760 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:12:54,829 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_200], 2=[v_bla_b_249]} [2019-08-05 11:12:54,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:54,833 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:12:54,833 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:54,846 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:54,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:54,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:54,851 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:12:54,851 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:54,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:54,864 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:54,865 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:12:54,959 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_201], 3=[v_bla_b_250]} [2019-08-05 11:12:54,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:54,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:54,963 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:12:54,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:54,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:54,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:54,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:54,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:12:54,986 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:12:54,986 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:55,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:55,004 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:55,004 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:12:55,092 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_202], 4=[v_bla_b_251]} [2019-08-05 11:12:55,094 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:12:55,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:55,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:55,118 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:12:55,118 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:55,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:55,137 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:12:55,137 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:12:55,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:55,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:55,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 11:12:55,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 11:12:55,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 11:12:55,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:12:55,251 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 11:12:59,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:59,139 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 11:12:59,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 11:12:59,139 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 11:12:59,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:59,140 INFO L225 Difference]: With dead ends: 75 [2019-08-05 11:12:59,141 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 11:12:59,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:12:59,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 11:12:59,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 11:12:59,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 11:12:59,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 11:12:59,144 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 11:12:59,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:59,144 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 11:12:59,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 11:12:59,145 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 11:12:59,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 11:12:59,145 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:59,145 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 11:12:59,145 INFO L418 AbstractCegarLoop]: === Iteration 71 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:59,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:59,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864416, now seen corresponding path program 70 times [2019-08-05 11:12:59,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:59,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 162 conjunts are in the unsatisfiable core [2019-08-05 11:12:59,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:01,628 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 11:13:01,628 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:01,633 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:01,634 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:01,634 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:13:01,694 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_203], 1=[v_bla_b_253]} [2019-08-05 11:13:01,696 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 11:13:01,696 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:01,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:01,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:13:01,709 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:13:01,710 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:01,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:01,719 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:01,719 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:13:01,786 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_204], 2=[v_bla_b_254]} [2019-08-05 11:13:01,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:13:01,790 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:13:01,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:01,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:01,808 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:13:01,808 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:13:01,809 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:13:01,809 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:01,822 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:01,823 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:01,823 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:13:01,902 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_205], 3=[v_bla_b_255]} [2019-08-05 11:13:01,905 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:13:01,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:01,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:01,925 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:13:01,926 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:01,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:01,943 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:01,943 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:13:02,036 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:13:02,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:02,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:02,058 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:13:02,059 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:02,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:02,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:02,078 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:13:02,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:02,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:02,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 11:13:02,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 11:13:02,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 11:13:02,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:13:02,194 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 11:13:06,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:06,464 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 11:13:06,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 11:13:06,464 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 11:13:06,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:06,465 INFO L225 Difference]: With dead ends: 76 [2019-08-05 11:13:06,466 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 11:13:06,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:13:06,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 11:13:06,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 11:13:06,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:13:06,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 11:13:06,469 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 11:13:06,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:06,469 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 11:13:06,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 11:13:06,469 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 11:13:06,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 11:13:06,470 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:06,470 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 11:13:06,470 INFO L418 AbstractCegarLoop]: === Iteration 72 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:06,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:06,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779898, now seen corresponding path program 71 times [2019-08-05 11:13:06,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:06,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 164 conjunts are in the unsatisfiable core [2019-08-05 11:13:06,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:08,363 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 11:13:08,364 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:08,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:08,368 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:08,369 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:13:08,441 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_207], 1=[v_bla_b_258]} [2019-08-05 11:13:08,443 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 11:13:08,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:08,452 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:08,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:13:08,455 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:13:08,455 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:08,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:08,464 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:08,465 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:13:08,534 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_208], 2=[v_bla_b_259]} [2019-08-05 11:13:08,537 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:13:08,537 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:08,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:08,553 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:13:08,554 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:08,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:08,567 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:08,567 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:13:08,646 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_209], 3=[v_bla_b_260]} [2019-08-05 11:13:08,649 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:13:08,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:08,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:08,670 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:13:08,671 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:08,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:08,687 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:08,688 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:13:08,777 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_210], 4=[v_bla_b_261]} [2019-08-05 11:13:08,779 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:13:08,779 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:08,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:08,801 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:13:08,802 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:08,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:08,819 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:08,819 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:13:08,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:08,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:08,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 11:13:08,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 11:13:08,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 11:13:08,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:13:08,931 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 11:13:12,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:12,922 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 11:13:12,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 11:13:12,922 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 11:13:12,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:12,923 INFO L225 Difference]: With dead ends: 77 [2019-08-05 11:13:12,923 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 11:13:12,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:13:12,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 11:13:12,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 11:13:12,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 11:13:12,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 11:13:12,926 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 11:13:12,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:12,927 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 11:13:12,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 11:13:12,927 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 11:13:12,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 11:13:12,927 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:12,927 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 11:13:12,928 INFO L418 AbstractCegarLoop]: === Iteration 73 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:12,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:12,928 INFO L82 PathProgramCache]: Analyzing trace with hash 365428768, now seen corresponding path program 72 times [2019-08-05 11:13:12,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:13,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 166 conjunts are in the unsatisfiable core [2019-08-05 11:13:13,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:15,081 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 11:13:15,081 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:15,085 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:15,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:15,086 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:13:15,148 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_211], 1=[v_bla_b_263]} [2019-08-05 11:13:15,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 11:13:15,151 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:15,160 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:15,163 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:13:15,163 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:15,177 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:15,178 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:15,178 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:13:15,248 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_212], 2=[v_bla_b_264]} [2019-08-05 11:13:15,251 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:13:15,251 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:15,265 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:15,267 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:13:15,267 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:15,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:15,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:15,280 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:13:15,379 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_213], 3=[v_bla_b_265]} [2019-08-05 11:13:15,408 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:13:15,408 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:15,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:15,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:13:15,428 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:15,445 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:15,446 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:15,446 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:13:15,628 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_214], 4=[v_bla_b_266]} [2019-08-05 11:13:15,631 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:13:15,631 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:15,649 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:15,652 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:13:15,652 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:15,757 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-08-05 11:13:15,757 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:15,758 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:15,758 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:13:15,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:15,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:15,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 11:13:15,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 11:13:15,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 11:13:15,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:13:15,879 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 11:13:20,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:20,277 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 11:13:20,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 11:13:20,277 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 11:13:20,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:20,278 INFO L225 Difference]: With dead ends: 78 [2019-08-05 11:13:20,278 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 11:13:20,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:13:20,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 11:13:20,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 11:13:20,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:13:20,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 11:13:20,281 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 11:13:20,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:20,281 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 11:13:20,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 11:13:20,281 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 11:13:20,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 11:13:20,282 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:20,282 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 11:13:20,282 INFO L418 AbstractCegarLoop]: === Iteration 74 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:20,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:20,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1556612026, now seen corresponding path program 73 times [2019-08-05 11:13:20,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:20,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 168 conjunts are in the unsatisfiable core [2019-08-05 11:13:20,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:23,016 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 11:13:23,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:23,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:23,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:23,023 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:13:23,086 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_215], 1=[v_bla_b_268]} [2019-08-05 11:13:23,089 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 11:13:23,089 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:23,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:23,103 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:13:23,104 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:23,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:23,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:23,111 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:13:23,187 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_216], 2=[v_bla_b_269]} [2019-08-05 11:13:23,190 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:13:23,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:23,205 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:23,208 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:13:23,208 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:23,222 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:23,222 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:23,222 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:13:23,308 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_217], 3=[v_bla_b_270]} [2019-08-05 11:13:23,311 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:13:23,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:23,328 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:23,331 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:13:23,332 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:23,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:23,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:23,350 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:13:23,447 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_218], 4=[v_bla_b_271]} [2019-08-05 11:13:23,449 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:13:23,450 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:23,468 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:23,473 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:13:23,473 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:23,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:23,493 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:23,493 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:13:23,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:23,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:23,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 11:13:23,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 11:13:23,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 11:13:23,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:13:23,627 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 11:13:28,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:28,071 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 11:13:28,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 11:13:28,072 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 11:13:28,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:28,073 INFO L225 Difference]: With dead ends: 79 [2019-08-05 11:13:28,073 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 11:13:28,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:13:28,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 11:13:28,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 11:13:28,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 11:13:28,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 11:13:28,077 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 11:13:28,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:28,077 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 11:13:28,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 11:13:28,077 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 11:13:28,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:13:28,078 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:28,078 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 11:13:28,078 INFO L418 AbstractCegarLoop]: === Iteration 75 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:28,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:28,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334496, now seen corresponding path program 74 times [2019-08-05 11:13:28,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:28,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 170 conjunts are in the unsatisfiable core [2019-08-05 11:13:28,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:30,248 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 11:13:30,249 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:30,255 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:30,256 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:30,256 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:13:30,317 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_219], 1=[v_bla_b_273]} [2019-08-05 11:13:30,320 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 11:13:30,321 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:30,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:30,330 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:13:30,330 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:30,339 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:30,339 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:30,339 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:13:30,413 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_220], 2=[v_bla_b_274]} [2019-08-05 11:13:30,420 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:13:30,421 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:30,435 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:30,437 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:13:30,438 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:30,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:30,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:30,455 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:13:30,541 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_221], 3=[v_bla_b_275]} [2019-08-05 11:13:30,544 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:13:30,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:30,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:30,566 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:13:30,567 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:30,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:30,585 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:30,585 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:13:30,685 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_222], 4=[v_bla_b_276]} [2019-08-05 11:13:30,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:13:30,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:30,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:30,710 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:13:30,711 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:30,731 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:30,732 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:30,732 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:13:30,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:30,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:30,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 11:13:30,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 11:13:30,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 11:13:30,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:13:30,851 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 11:13:35,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:35,431 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 11:13:35,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 11:13:35,431 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 11:13:35,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:35,432 INFO L225 Difference]: With dead ends: 80 [2019-08-05 11:13:35,432 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 11:13:35,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:13:35,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 11:13:35,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 11:13:35,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:13:35,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 11:13:35,435 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 11:13:35,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:35,435 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 11:13:35,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 11:13:35,436 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 11:13:35,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 11:13:35,436 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:35,436 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 11:13:35,437 INFO L418 AbstractCegarLoop]: === Iteration 76 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:35,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:35,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600250, now seen corresponding path program 75 times [2019-08-05 11:13:35,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:35,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 172 conjunts are in the unsatisfiable core [2019-08-05 11:13:35,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:37,971 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 11:13:37,971 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:37,977 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:37,977 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:37,977 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:13:38,051 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_223], 1=[v_bla_b_278]} [2019-08-05 11:13:38,053 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 11:13:38,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:38,063 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:38,066 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:13:38,066 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:38,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:38,076 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:38,076 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:13:38,152 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_224], 2=[v_bla_b_279]} [2019-08-05 11:13:38,154 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:13:38,155 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:38,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:38,171 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:13:38,172 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:38,185 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:38,186 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:38,186 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:13:38,275 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_225], 3=[v_bla_b_280]} [2019-08-05 11:13:38,277 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:13:38,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:38,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:38,298 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:13:38,298 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:38,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:38,317 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:38,317 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:13:38,414 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_226], 4=[v_bla_b_281]} [2019-08-05 11:13:38,416 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:13:38,417 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:38,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:38,441 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:13:38,442 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:38,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:38,462 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:38,462 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:13:38,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:38,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:38,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 11:13:38,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 11:13:38,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 11:13:38,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:13:38,582 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 11:13:43,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:43,214 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 11:13:43,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 11:13:43,215 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 11:13:43,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:43,216 INFO L225 Difference]: With dead ends: 81 [2019-08-05 11:13:43,216 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 11:13:43,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:13:43,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 11:13:43,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 11:13:43,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 11:13:43,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 11:13:43,218 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 11:13:43,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:43,218 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 11:13:43,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 11:13:43,218 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 11:13:43,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 11:13:43,219 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:43,219 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 11:13:43,219 INFO L418 AbstractCegarLoop]: === Iteration 77 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:43,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:43,219 INFO L82 PathProgramCache]: Analyzing trace with hash -268904032, now seen corresponding path program 76 times [2019-08-05 11:13:43,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:43,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 174 conjunts are in the unsatisfiable core [2019-08-05 11:13:43,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:46,483 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 11:13:46,483 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:46,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:46,489 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:46,490 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:13:46,555 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_227], 1=[v_bla_b_283]} [2019-08-05 11:13:46,557 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 11:13:46,558 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:46,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:46,570 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:13:46,571 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:46,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:46,581 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:46,581 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:13:46,770 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_228], 2=[v_bla_b_284]} [2019-08-05 11:13:46,772 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:13:46,773 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:46,792 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:46,796 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:13:46,796 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:46,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:46,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:46,815 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:13:46,970 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_229], 3=[v_bla_b_285]} [2019-08-05 11:13:46,972 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:13:46,972 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:46,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:46,993 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:13:46,993 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:47,009 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:47,010 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:47,010 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:13:47,140 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:13:47,140 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:47,161 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:47,163 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:13:47,164 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:47,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:47,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:47,184 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:13:47,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:47,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:47,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 11:13:47,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 11:13:47,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 11:13:47,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:13:47,308 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-05 11:13:52,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:52,037 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 11:13:52,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 11:13:52,038 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 11:13:52,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:52,038 INFO L225 Difference]: With dead ends: 82 [2019-08-05 11:13:52,039 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 11:13:52,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:13:52,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 11:13:52,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 11:13:52,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:13:52,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 11:13:52,041 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 11:13:52,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:52,041 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 11:13:52,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 11:13:52,041 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 11:13:52,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 11:13:52,042 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:52,042 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 11:13:52,042 INFO L418 AbstractCegarLoop]: === Iteration 78 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:52,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:52,043 INFO L82 PathProgramCache]: Analyzing trace with hash 253907654, now seen corresponding path program 77 times [2019-08-05 11:13:52,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:52,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:52,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 704 conjuncts, 176 conjunts are in the unsatisfiable core [2019-08-05 11:13:52,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:54,365 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 11:13:54,366 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:54,371 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:54,372 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:54,372 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:13:54,435 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_231], 1=[v_bla_b_288]} [2019-08-05 11:13:54,436 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 11:13:54,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:54,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:54,448 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:13:54,448 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:54,457 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:54,458 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:54,458 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:13:54,533 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_232], 2=[v_bla_b_289]} [2019-08-05 11:13:54,536 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:13:54,536 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:54,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:54,552 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:13:54,553 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:54,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:54,566 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:54,566 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:13:54,654 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_233], 3=[v_bla_b_290]} [2019-08-05 11:13:54,656 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:13:54,657 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:54,675 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:54,678 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:13:54,679 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:54,696 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:54,697 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:54,697 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:13:54,804 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_234], 4=[v_bla_b_291]} [2019-08-05 11:13:54,807 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:13:54,807 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:54,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:54,832 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:13:54,833 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:54,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:54,854 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:13:54,854 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:13:54,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:54,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:54,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 11:13:54,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 11:13:54,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 11:13:54,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 11:13:54,984 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-05 11:13:59,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:59,958 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 11:13:59,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 11:13:59,959 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-05 11:13:59,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:59,960 INFO L225 Difference]: With dead ends: 83 [2019-08-05 11:13:59,960 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 11:13:59,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 11:13:59,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 11:13:59,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 11:13:59,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 11:13:59,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 11:13:59,963 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 11:13:59,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:59,963 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 11:13:59,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 11:13:59,963 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 11:13:59,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 11:13:59,964 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:59,964 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-05 11:13:59,964 INFO L418 AbstractCegarLoop]: === Iteration 79 === [blaErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:59,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:59,965 INFO L82 PathProgramCache]: Analyzing trace with hash -718799264, now seen corresponding path program 78 times [2019-08-05 11:13:59,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:00,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:00,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 178 conjunts are in the unsatisfiable core [2019-08-05 11:14:00,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:02,831 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 11:14:02,831 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:02,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:02,836 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:14:02,837 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:14:02,902 INFO L392 ElimStorePlain]: Different costs {0=[v_bla_a_235], 1=[v_bla_b_293]} [2019-08-05 11:14:02,905 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 11:14:02,905 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:02,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:02,920 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:14:02,920 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:02,929 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:02,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:14:02,929 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-08-05 11:14:03,010 INFO L392 ElimStorePlain]: Different costs {1=[v_bla_a_236], 2=[v_bla_b_294]} [2019-08-05 11:14:03,013 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:14:03,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:03,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:03,030 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:14:03,030 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:03,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:03,044 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:14:03,044 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-08-05 11:14:03,135 INFO L392 ElimStorePlain]: Different costs {2=[v_bla_a_237], 3=[v_bla_b_295]} [2019-08-05 11:14:03,138 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:14:03,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:03,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:03,158 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:14:03,159 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:03,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:03,176 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:14:03,176 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2019-08-05 11:14:03,274 INFO L392 ElimStorePlain]: Different costs {3=[v_bla_a_238], 4=[v_bla_b_296]} [2019-08-05 11:14:03,276 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:14:03,276 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:03,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:03,301 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:14:03,301 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:03,321 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:03,322 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:14:03,322 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2019-08-05 11:14:03,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:03,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:03,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 11:14:03,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 11:14:03,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 11:14:03,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:14:03,447 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. Received shutdown request... [2019-08-05 11:14:04,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:14:04,408 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 11:14:04,416 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 11:14:04,416 INFO L202 PluginConnector]: Adding new model unboundedStoreChain02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:14:04 BoogieIcfgContainer [2019-08-05 11:14:04,416 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:14:04,418 INFO L168 Benchmark]: Toolchain (without parser) took 245007.00 ms. Allocated memory was 140.0 MB in the beginning and 1.0 GB in the end (delta: 874.0 MB). Free memory was 108.3 MB in the beginning and 487.5 MB in the end (delta: -379.2 MB). Peak memory consumption was 494.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:14:04,418 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 140.0 MB. Free memory is still 109.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:14:04,418 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.40 ms. Allocated memory is still 140.0 MB. Free memory was 107.9 MB in the beginning and 106.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:14:04,418 INFO L168 Benchmark]: Boogie Preprocessor took 26.41 ms. Allocated memory is still 140.0 MB. Free memory was 106.2 MB in the beginning and 104.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:14:04,418 INFO L168 Benchmark]: RCFGBuilder took 330.98 ms. Allocated memory is still 140.0 MB. Free memory was 104.9 MB in the beginning and 95.6 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:14:04,418 INFO L168 Benchmark]: TraceAbstraction took 244600.16 ms. Allocated memory was 140.0 MB in the beginning and 1.0 GB in the end (delta: 874.0 MB). Free memory was 95.2 MB in the beginning and 487.5 MB in the end (delta: -392.3 MB). Peak memory consumption was 481.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:14:04,419 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 140.0 MB. Free memory is still 109.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.40 ms. Allocated memory is still 140.0 MB. Free memory was 107.9 MB in the beginning and 106.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.41 ms. Allocated memory is still 140.0 MB. Free memory was 106.2 MB in the beginning and 104.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 330.98 ms. Allocated memory is still 140.0 MB. Free memory was 104.9 MB in the beginning and 95.6 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 244600.16 ms. Allocated memory was 140.0 MB in the beginning and 1.0 GB in the end (delta: 874.0 MB). Free memory was 95.2 MB in the beginning and 487.5 MB in the end (delta: -392.3 MB). Peak memory consumption was 481.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 27). Cancelled while BasicCegarLoop was constructing difference of abstraction (82states) and FLOYD_HOARE automaton (currently 18 states, 81 states before enhancement),while ReachableStatesComputation was computing reachable states (16 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 244.5s OverallTime, 79 OverallIterations, 78 TraceHistogramMax, 128.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 236 SDtfs, 0 SDslu, 5498 SDs, 0 SdLazy, 162660 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 107.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3239 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 3160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 93.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=78, 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, 78 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 6.3s SatisfiabilityAnalysisTime, 108.7s InterpolantComputationTime, 3318 NumberOfCodeBlocks, 3318 NumberOfCodeBlocksAsserted, 79 NumberOfCheckSat, 3239 ConstructedInterpolants, 0 QuantifiedInterpolants, 1096857 SizeOfPredicates, 100 NumberOfNonLiveVariables, 28598 ConjunctsInSsa, 7291 ConjunctsInUnsatCore, 79 InterpolantComputations, 1 PerfectInterpolantSequences, 0/82160 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown