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/20181010-MemSafetyPathprograms/standard_strcpy_original_false-valid-deref.i_9.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:00:05,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:00:05,998 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:00:06,009 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:00:06,009 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:00:06,010 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:00:06,012 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:00:06,014 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:00:06,015 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:00:06,016 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:00:06,017 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:00:06,017 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:00:06,018 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:00:06,019 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:00:06,020 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:00:06,021 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:00:06,022 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:00:06,023 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:00:06,025 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:00:06,027 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:00:06,029 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:00:06,030 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:00:06,031 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:00:06,032 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:00:06,035 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:00:06,035 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:00:06,035 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:00:06,036 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:00:06,037 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:00:06,038 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:00:06,038 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:00:06,039 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:00:06,040 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:00:06,041 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:00:06,042 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:00:06,042 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:00:06,044 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:00:06,045 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:00:06,045 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:00:06,046 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:00:06,050 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:00:06,089 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:00:06,104 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:00:06,109 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:00:06,110 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:00:06,111 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:00:06,112 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/standard_strcpy_original_false-valid-deref.i_9.bpl [2019-08-05 11:00:06,112 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/standard_strcpy_original_false-valid-deref.i_9.bpl' [2019-08-05 11:00:06,174 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:00:06,176 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:00:06,176 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:00:06,177 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:00:06,177 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:00:06,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "standard_strcpy_original_false-valid-deref.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:06" (1/1) ... [2019-08-05 11:00:06,210 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "standard_strcpy_original_false-valid-deref.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:06" (1/1) ... [2019-08-05 11:00:06,220 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:00:06,221 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:00:06,221 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:00:06,221 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:00:06,233 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:06" (1/1) ... [2019-08-05 11:00:06,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:06" (1/1) ... [2019-08-05 11:00:06,237 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:06" (1/1) ... [2019-08-05 11:00:06,237 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:06" (1/1) ... [2019-08-05 11:00:06,246 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:06" (1/1) ... [2019-08-05 11:00:06,253 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:06" (1/1) ... [2019-08-05 11:00:06,259 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:06" (1/1) ... [2019-08-05 11:00:06,261 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:00:06,262 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:00:06,262 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:00:06,262 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:00:06,265 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "standard_strcpy_original_false-valid-deref.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:06" (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:00:06,335 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:00:06,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:00:06,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:00:06,592 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:00:06,592 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:00:06,593 INFO L202 PluginConnector]: Adding new model standard_strcpy_original_false-valid-deref.i_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:00:06 BoogieIcfgContainer [2019-08-05 11:00:06,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:00:06,595 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:00:06,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:00:06,599 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:00:06,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "standard_strcpy_original_false-valid-deref.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:06" (1/2) ... [2019-08-05 11:00:06,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@767a42d2 and model type standard_strcpy_original_false-valid-deref.i_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:00:06, skipping insertion in model container [2019-08-05 11:00:06,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "standard_strcpy_original_false-valid-deref.i_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:00:06" (2/2) ... [2019-08-05 11:00:06,602 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_strcpy_original_false-valid-deref.i_9.bpl [2019-08-05 11:00:06,613 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:00:06,622 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:00:06,638 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:00:06,665 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:00:06,666 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:00:06,666 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:00:06,666 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:00:06,666 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:00:06,667 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:00:06,667 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:00:06,667 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:00:06,667 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:00:06,679 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 11:00:06,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:00:06,687 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:06,688 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:00:06,690 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:06,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:06,697 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2019-08-05 11:00:06,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:06,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:00:06,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:06,924 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:00:06,925 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:07,056 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 11:00:07,057 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:07,058 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:07,059 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:00:07,171 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:00:07,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:00:07,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:00:07,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:00:07,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:00:07,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:00:07,191 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2019-08-05 11:00:07,451 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 11:00:07,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:07,582 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:00:07,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:00:07,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 11:00:07,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:07,595 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:00:07,596 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:00:07,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:00:07,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:00:07,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-08-05 11:00:07,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:00:07,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 11:00:07,632 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2019-08-05 11:00:07,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:07,633 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 11:00:07,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:00:07,633 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 11:00:07,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:00:07,634 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:07,634 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 11:00:07,634 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:07,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:07,635 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2019-08-05 11:00:07,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:07,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:00:07,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:07,755 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:00:07,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:07,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:07,830 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:07,832 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:00:07,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:07,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:07,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:00:08,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:00:08,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:00:08,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:00:08,001 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2019-08-05 11:00:08,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:08,276 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 11:00:08,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:00:08,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 11:00:08,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:08,277 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:00:08,278 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:00:08,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:00:08,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:00:08,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-08-05 11:00:08,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:00:08,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 11:00:08,281 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2019-08-05 11:00:08,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:08,282 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 11:00:08,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:00:08,282 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 11:00:08,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:00:08,283 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:08,283 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2019-08-05 11:00:08,283 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:08,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:08,284 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2019-08-05 11:00:08,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:08,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:00:08,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:08,386 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:00:08,386 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:08,415 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:08,415 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:08,416 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:00:08,765 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:00:08,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:08,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:00:08,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:00:08,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:00:08,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:00:08,768 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2019-08-05 11:00:09,231 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-08-05 11:00:09,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:09,418 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 11:00:09,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:00:09,419 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-08-05 11:00:09,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:09,420 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:00:09,420 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:00:09,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:00:09,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:00:09,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-08-05 11:00:09,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:00:09,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 11:00:09,423 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-08-05 11:00:09,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:09,424 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 11:00:09,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:00:09,424 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 11:00:09,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:00:09,424 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:09,425 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2019-08-05 11:00:09,425 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:09,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:09,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2019-08-05 11:00:09,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:09,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:00:09,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:09,574 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:00:09,575 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:09,693 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 11:00:09,694 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:09,694 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:09,695 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:00:09,935 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:09,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:09,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:00:09,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:00:09,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:00:09,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:00:09,937 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2019-08-05 11:00:10,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:10,266 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 11:00:10,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:00:10,267 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-08-05 11:00:10,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:10,268 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:00:10,268 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:00:10,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:00:10,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:00:10,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-08-05 11:00:10,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:00:10,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 11:00:10,274 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-08-05 11:00:10,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:10,274 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 11:00:10,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:00:10,274 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 11:00:10,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:00:10,275 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:10,275 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2019-08-05 11:00:10,276 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:10,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:10,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2019-08-05 11:00:10,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:10,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:00:10,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:10,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:00:10,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:10,432 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:10,432 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:10,433 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:00:10,735 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:10,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:10,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:00:10,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:00:10,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:00:10,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:00:10,736 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 9 states. [2019-08-05 11:00:11,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:11,088 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 11:00:11,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:00:11,088 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-08-05 11:00:11,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:11,089 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:00:11,089 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:00:11,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:00:11,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:00:11,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-08-05 11:00:11,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:00:11,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 11:00:11,092 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-08-05 11:00:11,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:11,093 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 11:00:11,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:00:11,093 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 11:00:11,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:00:11,094 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:11,094 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2019-08-05 11:00:11,094 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:11,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:11,095 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2019-08-05 11:00:11,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:11,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:00:11,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:11,216 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:00:11,217 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:11,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:11,262 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:11,263 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:00:11,524 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:11,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:11,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:00:11,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:00:11,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:00:11,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:00:11,526 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 10 states. [2019-08-05 11:00:11,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:11,979 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 11:00:11,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:00:11,981 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-08-05 11:00:11,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:11,982 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:00:11,982 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:00:11,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:00:11,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:00:11,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-08-05 11:00:11,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:00:11,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 11:00:11,987 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-08-05 11:00:11,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:11,987 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 11:00:11,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:00:11,987 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 11:00:11,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:00:11,988 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:11,988 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2019-08-05 11:00:11,988 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:11,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:11,989 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2019-08-05 11:00:11,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:12,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:00:12,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:12,127 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:00:12,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:12,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:12,169 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:12,169 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:00:12,364 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:12,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:12,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:00:12,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:00:12,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:00:12,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:00:12,366 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 11 states. [2019-08-05 11:00:12,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:12,828 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 11:00:12,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:00:12,828 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-08-05 11:00:12,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:12,829 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:00:12,829 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:00:12,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:00:12,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:00:12,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-08-05 11:00:12,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:00:12,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 11:00:12,833 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-08-05 11:00:12,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:12,833 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 11:00:12,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:00:12,833 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 11:00:12,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:00:12,834 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:12,834 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2019-08-05 11:00:12,834 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:12,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:12,835 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2019-08-05 11:00:12,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:12,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:00:12,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:12,951 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:00:12,952 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:13,054 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 11:00:13,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:13,055 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:13,055 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:00:13,296 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:13,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:13,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:00:13,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:00:13,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:00:13,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:00:13,298 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 12 states. [2019-08-05 11:00:13,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:13,778 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 11:00:13,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:00:13,780 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-08-05 11:00:13,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:13,781 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:00:13,782 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:00:13,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:00:13,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:00:13,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-08-05 11:00:13,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:00:13,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 11:00:13,786 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2019-08-05 11:00:13,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:13,786 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 11:00:13,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:00:13,786 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 11:00:13,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 11:00:13,787 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:13,787 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2019-08-05 11:00:13,787 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:13,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:13,788 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2019-08-05 11:00:13,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:13,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:00:13,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:13,899 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:00:13,899 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:14,022 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 11:00:14,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:14,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:14,023 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:00:14,214 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:14,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:14,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:00:14,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:00:14,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:00:14,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:00:14,216 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 13 states. [2019-08-05 11:00:14,707 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2019-08-05 11:00:14,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:14,838 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 11:00:14,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:00:14,842 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2019-08-05 11:00:14,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:14,843 INFO L225 Difference]: With dead ends: 24 [2019-08-05 11:00:14,843 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 11:00:14,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=170, Invalid=336, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:00:14,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 11:00:14,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-08-05 11:00:14,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 11:00:14,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 11:00:14,847 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-08-05 11:00:14,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:14,847 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 11:00:14,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:00:14,847 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 11:00:14,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:00:14,848 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:14,848 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2019-08-05 11:00:14,849 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:14,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:14,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1767155375, now seen corresponding path program 9 times [2019-08-05 11:00:14,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:15,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:00:15,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:15,128 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:00:15,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:15,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:15,194 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:15,194 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:00:15,621 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:15,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:15,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:00:15,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:00:15,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:00:15,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:00:15,623 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 14 states. [2019-08-05 11:00:16,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:16,166 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 11:00:16,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:00:16,167 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-08-05 11:00:16,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:16,167 INFO L225 Difference]: With dead ends: 26 [2019-08-05 11:00:16,168 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 11:00:16,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=203, Invalid=397, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:00:16,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 11:00:16,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-08-05 11:00:16,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 11:00:16,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 11:00:16,173 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-08-05 11:00:16,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:16,173 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 11:00:16,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:00:16,173 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 11:00:16,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 11:00:16,174 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:16,174 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2019-08-05 11:00:16,174 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:16,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:16,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1724181365, now seen corresponding path program 10 times [2019-08-05 11:00:16,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:16,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:00:16,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:16,316 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:00:16,317 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:16,436 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 11:00:16,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:16,440 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:16,440 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:00:16,572 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 11:00:17,468 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:17,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:17,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:00:17,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:00:17,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:00:17,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:00:17,471 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 15 states. [2019-08-05 11:00:18,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:18,334 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 11:00:18,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:00:18,335 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2019-08-05 11:00:18,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:18,335 INFO L225 Difference]: With dead ends: 28 [2019-08-05 11:00:18,335 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 11:00:18,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=239, Invalid=463, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:00:18,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 11:00:18,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-08-05 11:00:18,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 11:00:18,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 11:00:18,339 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-08-05 11:00:18,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:18,340 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 11:00:18,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:00:18,340 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 11:00:18,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:00:18,341 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:18,341 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2019-08-05 11:00:18,341 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:18,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:18,342 INFO L82 PathProgramCache]: Analyzing trace with hash 919136581, now seen corresponding path program 11 times [2019-08-05 11:00:18,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:18,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:18,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:00:18,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:18,513 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:00:18,514 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:18,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:18,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:18,545 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:00:18,780 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:18,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:18,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:00:18,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:00:18,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:00:18,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:00:18,781 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 16 states. [2019-08-05 11:00:19,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:19,445 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 11:00:19,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:00:19,446 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-08-05 11:00:19,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:19,447 INFO L225 Difference]: With dead ends: 30 [2019-08-05 11:00:19,447 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 11:00:19,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=278, Invalid=534, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:00:19,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 11:00:19,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-08-05 11:00:19,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 11:00:19,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 11:00:19,453 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-08-05 11:00:19,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:19,453 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 11:00:19,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:00:19,453 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 11:00:19,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 11:00:19,454 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:19,454 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2019-08-05 11:00:19,454 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:19,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:19,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1472956545, now seen corresponding path program 12 times [2019-08-05 11:00:19,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:19,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 11:00:19,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:19,673 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:00:19,674 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:19,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:19,729 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:19,729 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:00:20,016 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:20,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:20,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:00:20,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:00:20,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:00:20,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:00:20,018 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 17 states. [2019-08-05 11:00:20,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:20,846 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 11:00:20,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:00:20,846 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2019-08-05 11:00:20,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:20,847 INFO L225 Difference]: With dead ends: 32 [2019-08-05 11:00:20,848 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 11:00:20,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=320, Invalid=610, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:00:20,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 11:00:20,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-08-05 11:00:20,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 11:00:20,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 11:00:20,854 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2019-08-05 11:00:20,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:20,854 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 11:00:20,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:00:20,854 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 11:00:20,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 11:00:20,855 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:20,855 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2019-08-05 11:00:20,855 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:20,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:20,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1828020025, now seen corresponding path program 13 times [2019-08-05 11:00:20,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:20,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 11:00:20,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:21,039 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:00:21,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:21,130 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:21,131 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:21,131 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:00:21,408 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:21,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:21,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:00:21,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:00:21,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:00:21,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:00:21,410 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 18 states. [2019-08-05 11:00:22,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:22,366 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 11:00:22,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:00:22,370 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2019-08-05 11:00:22,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:22,371 INFO L225 Difference]: With dead ends: 34 [2019-08-05 11:00:22,371 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 11:00:22,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=365, Invalid=691, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:00:22,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 11:00:22,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-08-05 11:00:22,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 11:00:22,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 11:00:22,375 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2019-08-05 11:00:22,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:22,376 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 11:00:22,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:00:22,376 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 11:00:22,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 11:00:22,377 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:22,377 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2019-08-05 11:00:22,377 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:22,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:22,377 INFO L82 PathProgramCache]: Analyzing trace with hash 85672051, now seen corresponding path program 14 times [2019-08-05 11:00:22,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:22,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:00:22,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:22,575 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:00:22,575 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:22,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:22,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:22,674 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:00:23,303 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 11:00:23,726 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:00:23,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:23,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:00:23,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:00:23,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:00:23,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:00:23,727 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 19 states. [2019-08-05 11:00:24,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:24,773 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 11:00:24,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:00:24,773 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2019-08-05 11:00:24,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:24,774 INFO L225 Difference]: With dead ends: 36 [2019-08-05 11:00:24,775 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 11:00:24,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=413, Invalid=777, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:00:24,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 11:00:24,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-08-05 11:00:24,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 11:00:24,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 11:00:24,779 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2019-08-05 11:00:24,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:24,779 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 11:00:24,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:00:24,779 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 11:00:24,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 11:00:24,780 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:24,780 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2019-08-05 11:00:24,781 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:24,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:24,781 INFO L82 PathProgramCache]: Analyzing trace with hash 726514477, now seen corresponding path program 15 times [2019-08-05 11:00:24,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:24,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:00:24,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:25,034 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:00:25,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:25,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:25,124 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:25,124 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:00:26,091 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:26,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:26,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:00:26,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:00:26,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:00:26,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=237, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:00:26,092 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 20 states. [2019-08-05 11:00:27,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:27,045 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 11:00:27,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:00:27,047 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 34 [2019-08-05 11:00:27,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:27,048 INFO L225 Difference]: With dead ends: 38 [2019-08-05 11:00:27,048 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 11:00:27,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=464, Invalid=868, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:00:27,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 11:00:27,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-08-05 11:00:27,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 11:00:27,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 11:00:27,052 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2019-08-05 11:00:27,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:27,053 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 11:00:27,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:00:27,053 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 11:00:27,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 11:00:27,053 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:27,054 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2019-08-05 11:00:27,054 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:27,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:27,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1899204761, now seen corresponding path program 16 times [2019-08-05 11:00:27,055 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:27,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:00:27,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:27,785 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:00:27,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:27,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:27,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:27,874 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:00:29,163 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:29,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:29,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:00:29,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:00:29,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:00:29,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=260, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:00:29,165 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 21 states. [2019-08-05 11:00:30,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:30,135 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 11:00:30,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:00:30,136 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 36 [2019-08-05 11:00:30,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:30,136 INFO L225 Difference]: With dead ends: 40 [2019-08-05 11:00:30,137 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 11:00:30,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=518, Invalid=964, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:00:30,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 11:00:30,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-08-05 11:00:30,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 11:00:30,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 11:00:30,142 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2019-08-05 11:00:30,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:30,142 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 11:00:30,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:00:30,142 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 11:00:30,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 11:00:30,143 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:30,143 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2019-08-05 11:00:30,143 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:30,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:30,144 INFO L82 PathProgramCache]: Analyzing trace with hash 225377569, now seen corresponding path program 17 times [2019-08-05 11:00:30,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:31,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:00:31,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:31,053 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_7|], 2=[|v_#valid_7|]} [2019-08-05 11:00:31,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:00:31,105 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:00:31,105 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:31,247 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-08-05 11:00:31,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:31,323 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2019-08-05 11:00:31,323 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:31,355 INFO L567 ElimStorePlain]: treesize reduction 12, result has 63.6 percent of original size [2019-08-05 11:00:31,355 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:31,356 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:21 [2019-08-05 11:00:32,228 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:32,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:32,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:00:32,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:00:32,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:00:32,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:00:32,230 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 23 states. [2019-08-05 11:00:33,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:33,911 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 11:00:33,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:00:33,912 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 38 [2019-08-05 11:00:33,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:33,913 INFO L225 Difference]: With dead ends: 42 [2019-08-05 11:00:33,913 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 11:00:33,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=597, Invalid=1125, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:00:33,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 11:00:33,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-08-05 11:00:33,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 11:00:33,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 11:00:33,918 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2019-08-05 11:00:33,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:33,918 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 11:00:33,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:00:33,918 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 11:00:33,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:00:33,919 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:33,919 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2019-08-05 11:00:33,919 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:33,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:33,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1839531099, now seen corresponding path program 18 times [2019-08-05 11:00:33,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:34,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:00:34,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:34,131 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:00:34,132 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:34,249 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 11:00:34,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:34,250 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:34,251 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:00:35,010 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 11:00:35,033 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:35,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:35,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:00:35,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:00:35,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:00:35,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:00:35,036 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 23 states. [2019-08-05 11:00:35,449 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2019-08-05 11:00:35,662 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2019-08-05 11:00:36,284 WARN L188 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2019-08-05 11:00:37,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:37,182 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 11:00:37,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:00:37,182 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 40 [2019-08-05 11:00:37,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:37,183 INFO L225 Difference]: With dead ends: 44 [2019-08-05 11:00:37,183 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 11:00:37,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=635, Invalid=1171, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:00:37,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 11:00:37,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-08-05 11:00:37,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 11:00:37,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 11:00:37,188 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2019-08-05 11:00:37,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:37,188 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 11:00:37,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:00:37,188 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 11:00:37,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 11:00:37,189 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:37,189 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2019-08-05 11:00:37,189 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:37,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:37,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1737087723, now seen corresponding path program 19 times [2019-08-05 11:00:37,190 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:37,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:00:37,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:37,372 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:00:37,372 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:37,467 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:37,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:37,468 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:00:38,140 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-08-05 11:00:38,572 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 11:00:38,592 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:38,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:38,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:00:38,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:00:38,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:00:38,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=335, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:00:38,593 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 24 states. [2019-08-05 11:00:40,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:40,140 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 11:00:40,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:00:40,140 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2019-08-05 11:00:40,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:40,141 INFO L225 Difference]: With dead ends: 46 [2019-08-05 11:00:40,141 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 11:00:40,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=698, Invalid=1282, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:00:40,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 11:00:40,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-08-05 11:00:40,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:00:40,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 11:00:40,147 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2019-08-05 11:00:40,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:40,148 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 11:00:40,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:00:40,148 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 11:00:40,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 11:00:40,149 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:40,149 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2019-08-05 11:00:40,149 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:40,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:40,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1401028431, now seen corresponding path program 20 times [2019-08-05 11:00:40,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:40,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:00:40,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:40,477 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:00:40,477 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:40,521 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:40,521 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:40,521 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:00:40,887 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:40,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:40,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:00:40,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:00:40,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:00:40,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=362, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:00:40,889 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 25 states. [2019-08-05 11:00:42,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:42,151 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 11:00:42,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:00:42,152 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 44 [2019-08-05 11:00:42,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:42,153 INFO L225 Difference]: With dead ends: 48 [2019-08-05 11:00:42,153 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 11:00:42,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=764, Invalid=1398, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:00:42,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 11:00:42,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-08-05 11:00:42,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 11:00:42,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 11:00:42,157 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2019-08-05 11:00:42,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:42,158 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 11:00:42,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:00:42,158 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 11:00:42,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 11:00:42,158 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:42,158 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2019-08-05 11:00:42,159 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:42,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:42,159 INFO L82 PathProgramCache]: Analyzing trace with hash 2063610633, now seen corresponding path program 21 times [2019-08-05 11:00:42,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:43,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:43,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 11:00:43,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:43,175 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_8|], 2=[|v_#valid_8|]} [2019-08-05 11:00:43,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:00:43,245 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:00:43,246 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:43,394 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-08-05 11:00:43,395 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:43,472 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-08-05 11:00:43,473 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:43,792 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2019-08-05 11:00:43,793 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 11:00:43,793 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:43,794 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:21 [2019-08-05 11:00:43,974 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-08-05 11:00:44,164 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 11:00:44,926 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-08-05 11:00:44,926 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:44,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:44,937 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:00:44,937 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:21 [2019-08-05 11:00:45,315 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:45,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:45,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:00:45,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:00:45,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:00:45,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=692, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:00:45,317 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 30 states. [2019-08-05 11:00:46,637 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2019-08-05 11:00:47,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:47,917 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 11:00:47,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:00:47,919 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 46 [2019-08-05 11:00:47,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:47,920 INFO L225 Difference]: With dead ends: 50 [2019-08-05 11:00:47,920 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 11:00:47,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=831, Invalid=2031, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:00:47,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 11:00:47,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-08-05 11:00:47,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 11:00:47,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 11:00:47,924 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2019-08-05 11:00:47,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:47,924 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 11:00:47,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:00:47,924 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 11:00:47,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 11:00:47,925 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:47,925 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2019-08-05 11:00:47,925 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:47,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:47,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1145020349, now seen corresponding path program 22 times [2019-08-05 11:00:47,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:48,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:00:48,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:48,132 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:00:48,133 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:48,229 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:48,230 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:48,230 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:00:49,034 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:49,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:49,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:00:49,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:00:49,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:00:49,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=419, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:00:49,035 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 27 states. [2019-08-05 11:00:50,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:50,514 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 11:00:50,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:00:50,518 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 48 [2019-08-05 11:00:50,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:50,519 INFO L225 Difference]: With dead ends: 52 [2019-08-05 11:00:50,519 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 11:00:50,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=905, Invalid=1645, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:00:50,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 11:00:50,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-08-05 11:00:50,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 11:00:50,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 11:00:50,523 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2019-08-05 11:00:50,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:50,523 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 11:00:50,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:00:50,526 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 11:00:50,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 11:00:50,527 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:50,527 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2019-08-05 11:00:50,527 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:50,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:50,528 INFO L82 PathProgramCache]: Analyzing trace with hash -852875523, now seen corresponding path program 23 times [2019-08-05 11:00:50,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:50,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 912 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:00:50,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:50,808 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:00:50,809 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:50,899 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:50,900 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:50,900 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:00:52,414 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:52,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:52,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:00:52,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:00:52,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:00:52,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=449, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:00:52,415 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 28 states. [2019-08-05 11:00:54,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:54,180 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 11:00:54,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:00:54,180 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 50 [2019-08-05 11:00:54,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:54,181 INFO L225 Difference]: With dead ends: 54 [2019-08-05 11:00:54,181 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 11:00:54,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=980, Invalid=1776, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:00:54,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 11:00:54,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-08-05 11:00:54,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:00:54,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 11:00:54,186 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2019-08-05 11:00:54,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:54,186 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 11:00:54,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:00:54,186 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 11:00:54,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 11:00:54,187 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:54,187 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2019-08-05 11:00:54,187 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:54,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:54,187 INFO L82 PathProgramCache]: Analyzing trace with hash 725428023, now seen corresponding path program 24 times [2019-08-05 11:00:54,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:54,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 949 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:00:54,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:54,673 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:00:54,673 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:54,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:54,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:54,773 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:00:56,414 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:56,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:56,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:00:56,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:00:56,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:00:56,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=480, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:00:56,416 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 29 states. [2019-08-05 11:00:58,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:58,034 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 11:00:58,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:00:58,035 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 52 [2019-08-05 11:00:58,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:58,035 INFO L225 Difference]: With dead ends: 56 [2019-08-05 11:00:58,036 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 11:00:58,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1058, Invalid=1912, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:00:58,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 11:00:58,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-08-05 11:00:58,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 11:00:58,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 11:00:58,040 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2019-08-05 11:00:58,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:58,040 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 11:00:58,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:00:58,041 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 11:00:58,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:00:58,041 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:58,041 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2019-08-05 11:00:58,042 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:58,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:58,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1351680241, now seen corresponding path program 25 times [2019-08-05 11:00:58,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:58,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 11:00:58,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:58,409 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:00:58,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:58,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:58,499 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:58,500 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:00:59,581 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:59,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:59,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:00:59,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:00:59,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:00:59,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=512, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:00:59,583 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 30 states. [2019-08-05 11:01:01,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:01,210 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 11:01:01,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:01:01,210 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 54 [2019-08-05 11:01:01,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:01,211 INFO L225 Difference]: With dead ends: 58 [2019-08-05 11:01:01,211 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 11:01:01,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1139, Invalid=2053, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:01:01,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 11:01:01,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-08-05 11:01:01,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 11:01:01,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 11:01:01,217 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2019-08-05 11:01:01,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:01,217 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 11:01:01,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:01:01,217 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 11:01:01,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 11:01:01,218 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:01,218 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2019-08-05 11:01:01,218 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:01,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:01,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1884640299, now seen corresponding path program 26 times [2019-08-05 11:01:01,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:02,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 1023 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 11:01:02,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:02,784 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:01:02,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:02,871 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:02,871 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:02,871 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:01:03,752 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:03,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:03,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:01:03,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:01:03,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:01:03,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=545, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:01:03,754 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 31 states. [2019-08-05 11:01:05,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:05,637 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 11:01:05,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:01:05,638 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 56 [2019-08-05 11:01:05,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:05,639 INFO L225 Difference]: With dead ends: 60 [2019-08-05 11:01:05,639 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 11:01:05,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1223, Invalid=2199, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:01:05,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 11:01:05,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-08-05 11:01:05,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:01:05,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 11:01:05,643 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2019-08-05 11:01:05,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:05,644 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 11:01:05,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:01:05,644 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 11:01:05,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 11:01:05,645 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:05,645 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2019-08-05 11:01:05,645 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:05,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:05,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1336819483, now seen corresponding path program 27 times [2019-08-05 11:01:05,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:06,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:06,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 11:01:06,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:06,384 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:01:06,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:06,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:06,414 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:06,414 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:01:07,060 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:07,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:07,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:01:07,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:01:07,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:01:07,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=579, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:01:07,062 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 32 states. [2019-08-05 11:01:08,312 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2019-08-05 11:01:09,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:09,098 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 11:01:09,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:01:09,098 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 58 [2019-08-05 11:01:09,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:09,098 INFO L225 Difference]: With dead ends: 62 [2019-08-05 11:01:09,099 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 11:01:09,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1310, Invalid=2350, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:01:09,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 11:01:09,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-08-05 11:01:09,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:01:09,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 11:01:09,103 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2019-08-05 11:01:09,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:09,103 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 11:01:09,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:01:09,103 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 11:01:09,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 11:01:09,104 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:09,104 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2019-08-05 11:01:09,104 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:09,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:09,104 INFO L82 PathProgramCache]: Analyzing trace with hash -488249569, now seen corresponding path program 28 times [2019-08-05 11:01:09,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:09,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 1097 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 11:01:09,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:09,394 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:01:09,394 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:09,421 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:09,422 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:09,422 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:01:10,299 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:10,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:10,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:01:10,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:01:10,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:01:10,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=614, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:01:10,300 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 33 states. [2019-08-05 11:01:12,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:12,224 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 11:01:12,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:01:12,224 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 60 [2019-08-05 11:01:12,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:12,225 INFO L225 Difference]: With dead ends: 64 [2019-08-05 11:01:12,225 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 11:01:12,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1400, Invalid=2506, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:01:12,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 11:01:12,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-08-05 11:01:12,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:01:12,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 11:01:12,229 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2019-08-05 11:01:12,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:12,230 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 11:01:12,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:01:12,230 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 11:01:12,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 11:01:12,230 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:12,231 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2019-08-05 11:01:12,231 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:12,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:12,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1056348455, now seen corresponding path program 29 times [2019-08-05 11:01:12,232 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:12,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:12,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 1134 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 11:01:12,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:12,760 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:01:12,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:12,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:12,778 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:12,779 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:01:13,411 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:13,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:13,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:01:13,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:01:13,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:01:13,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=650, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:01:13,412 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 34 states. [2019-08-05 11:01:15,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:15,676 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 11:01:15,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:01:15,677 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 62 [2019-08-05 11:01:15,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:15,677 INFO L225 Difference]: With dead ends: 66 [2019-08-05 11:01:15,677 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 11:01:15,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1493, Invalid=2667, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:01:15,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 11:01:15,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-08-05 11:01:15,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:01:15,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 11:01:15,682 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2019-08-05 11:01:15,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:15,682 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 11:01:15,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:01:15,682 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 11:01:15,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 11:01:15,682 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:15,683 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2019-08-05 11:01:15,683 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:15,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:15,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1538531309, now seen corresponding path program 30 times [2019-08-05 11:01:15,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:15,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 1171 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:01:15,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:15,922 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:01:15,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:15,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:15,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:15,939 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:01:16,632 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:16,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:16,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:01:16,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:01:16,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:01:16,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=503, Invalid=687, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:01:16,634 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 35 states. [2019-08-05 11:01:18,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:18,778 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 11:01:18,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:01:18,778 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 64 [2019-08-05 11:01:18,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:18,779 INFO L225 Difference]: With dead ends: 68 [2019-08-05 11:01:18,779 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 11:01:18,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1589, Invalid=2833, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:01:18,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 11:01:18,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-08-05 11:01:18,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 11:01:18,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 11:01:18,783 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2019-08-05 11:01:18,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:18,784 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 11:01:18,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:01:18,784 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 11:01:18,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 11:01:18,785 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:18,785 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2019-08-05 11:01:18,785 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:18,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:18,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1059786035, now seen corresponding path program 31 times [2019-08-05 11:01:18,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:18,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 1208 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:01:18,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:18,986 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:01:18,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:19,009 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:19,009 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:19,010 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:01:19,919 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:19,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:19,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:01:19,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:01:19,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:01:19,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=535, Invalid=725, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:01:19,921 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 36 states. [2019-08-05 11:01:22,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:22,170 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 11:01:22,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:01:22,171 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 66 [2019-08-05 11:01:22,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:22,172 INFO L225 Difference]: With dead ends: 70 [2019-08-05 11:01:22,172 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 11:01:22,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1688, Invalid=3004, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:01:22,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 11:01:22,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-08-05 11:01:22,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:01:22,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 11:01:22,177 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2019-08-05 11:01:22,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:22,177 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 11:01:22,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:01:22,177 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 11:01:22,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:01:22,178 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:22,178 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2019-08-05 11:01:22,178 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:22,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:22,178 INFO L82 PathProgramCache]: Analyzing trace with hash -547078393, now seen corresponding path program 32 times [2019-08-05 11:01:22,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:23,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 1245 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 11:01:23,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:23,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:01:23,941 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:23,961 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:23,961 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:23,961 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:01:24,711 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 11:01:25,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:25,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:25,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:01:25,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:01:25,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:01:25,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=568, Invalid=764, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:01:25,619 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 37 states. [2019-08-05 11:01:27,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:27,968 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 11:01:27,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 11:01:27,969 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 68 [2019-08-05 11:01:27,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:27,970 INFO L225 Difference]: With dead ends: 72 [2019-08-05 11:01:27,970 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 11:01:27,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1790, Invalid=3180, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:01:27,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 11:01:27,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-08-05 11:01:27,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:01:27,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 11:01:27,975 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2019-08-05 11:01:27,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:27,975 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 11:01:27,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:01:27,976 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 11:01:27,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 11:01:27,976 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:27,976 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2019-08-05 11:01:27,977 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:27,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:27,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1756273471, now seen corresponding path program 33 times [2019-08-05 11:01:27,978 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:28,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:28,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 1282 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 11:01:28,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:28,643 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:01:28,643 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:28,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:28,744 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:28,744 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:01:29,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:29,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:29,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:01:29,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:01:29,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:01:29,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=804, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:01:29,975 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 38 states. [2019-08-05 11:01:32,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:32,474 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 11:01:32,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:01:32,474 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 70 [2019-08-05 11:01:32,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:32,475 INFO L225 Difference]: With dead ends: 74 [2019-08-05 11:01:32,476 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 11:01:32,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1895, Invalid=3361, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:01:32,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 11:01:32,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-08-05 11:01:32,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:01:32,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 11:01:32,479 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2019-08-05 11:01:32,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:32,480 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 11:01:32,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:01:32,480 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 11:01:32,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 11:01:32,480 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:32,480 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2019-08-05 11:01:32,481 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:32,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:32,481 INFO L82 PathProgramCache]: Analyzing trace with hash 143393787, now seen corresponding path program 34 times [2019-08-05 11:01:32,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:32,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:32,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 1319 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 11:01:32,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:32,710 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:01:32,710 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:32,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:32,738 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:32,738 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:01:33,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:33,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:33,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 11:01:33,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:01:33,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:01:33,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=845, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:01:33,585 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 39 states. [2019-08-05 11:01:36,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:36,211 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 11:01:36,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 11:01:36,212 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 72 [2019-08-05 11:01:36,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:36,213 INFO L225 Difference]: With dead ends: 76 [2019-08-05 11:01:36,213 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 11:01:36,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2003, Invalid=3547, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:01:36,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 11:01:36,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-08-05 11:01:36,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:01:36,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 11:01:36,217 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2019-08-05 11:01:36,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:36,217 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 11:01:36,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:01:36,217 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 11:01:36,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 11:01:36,218 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:36,218 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2019-08-05 11:01:36,218 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:36,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:36,218 INFO L82 PathProgramCache]: Analyzing trace with hash 362527925, now seen corresponding path program 35 times [2019-08-05 11:01:36,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:36,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 1356 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:01:36,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:36,895 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:01:36,895 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:36,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:36,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:36,985 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:01:37,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:37,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:37,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:01:37,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 11:01:37,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 11:01:37,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=887, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:01:37,855 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 40 states. [2019-08-05 11:01:40,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:40,619 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 11:01:40,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:01:40,620 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 74 [2019-08-05 11:01:40,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:40,621 INFO L225 Difference]: With dead ends: 78 [2019-08-05 11:01:40,621 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 11:01:40,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2114, Invalid=3738, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:01:40,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 11:01:40,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-08-05 11:01:40,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:01:40,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 11:01:40,624 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2019-08-05 11:01:40,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:40,625 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 11:01:40,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 11:01:40,625 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 11:01:40,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 11:01:40,625 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:40,625 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2019-08-05 11:01:40,625 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:40,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:40,626 INFO L82 PathProgramCache]: Analyzing trace with hash 497037039, now seen corresponding path program 36 times [2019-08-05 11:01:40,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:40,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 1393 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 11:01:40,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:40,910 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:01:40,910 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:40,930 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:40,930 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:40,930 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:01:41,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:41,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:41,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 11:01:41,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 11:01:41,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 11:01:41,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=710, Invalid=930, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:01:41,819 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 41 states. [2019-08-05 11:01:44,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:44,561 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 11:01:44,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 11:01:44,562 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 76 [2019-08-05 11:01:44,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:44,563 INFO L225 Difference]: With dead ends: 80 [2019-08-05 11:01:44,563 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 11:01:44,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2228, Invalid=3934, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:01:44,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 11:01:44,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-08-05 11:01:44,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:01:44,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 11:01:44,567 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2019-08-05 11:01:44,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:44,568 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 11:01:44,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 11:01:44,568 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 11:01:44,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 11:01:44,568 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:44,568 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2019-08-05 11:01:44,569 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:44,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:44,569 INFO L82 PathProgramCache]: Analyzing trace with hash 911276713, now seen corresponding path program 37 times [2019-08-05 11:01:44,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:47,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 1430 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 11:01:47,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:47,212 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:01:47,212 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:47,222 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:47,222 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:47,223 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:01:48,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:48,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:48,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:01:48,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 11:01:48,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 11:01:48,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=974, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:01:48,178 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 42 states. [2019-08-05 11:01:51,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:51,326 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 11:01:51,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:01:51,326 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 78 [2019-08-05 11:01:51,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:51,327 INFO L225 Difference]: With dead ends: 82 [2019-08-05 11:01:51,327 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 11:01:51,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2345, Invalid=4135, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:01:51,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 11:01:51,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-08-05 11:01:51,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:01:51,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 11:01:51,331 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2019-08-05 11:01:51,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:51,331 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 11:01:51,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 11:01:51,332 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 11:01:51,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 11:01:51,332 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:51,332 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2019-08-05 11:01:51,333 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:51,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:51,333 INFO L82 PathProgramCache]: Analyzing trace with hash -436355101, now seen corresponding path program 38 times [2019-08-05 11:01:51,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:51,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 1467 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 11:01:51,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:51,649 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:01:51,649 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:51,672 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:51,672 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:51,672 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:01:52,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:52,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:52,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 11:01:52,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 11:01:52,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 11:01:52,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=787, Invalid=1019, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:01:52,648 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 43 states. [2019-08-05 11:01:55,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:55,866 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 11:01:55,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 11:01:55,866 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 80 [2019-08-05 11:01:55,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:55,867 INFO L225 Difference]: With dead ends: 84 [2019-08-05 11:01:55,867 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 11:01:55,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2465, Invalid=4341, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:01:55,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 11:01:55,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-08-05 11:01:55,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:01:55,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 11:01:55,871 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2019-08-05 11:01:55,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:55,872 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 11:01:55,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 11:01:55,872 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 11:01:55,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 11:01:55,873 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:55,873 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2019-08-05 11:01:55,873 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:55,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:55,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1569595037, now seen corresponding path program 39 times [2019-08-05 11:01:55,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:57,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 1504 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 11:01:57,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:57,276 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:01:57,276 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:57,337 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:57,338 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:57,338 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:01:58,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:58,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:58,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:01:58,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 11:01:58,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 11:01:58,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=827, Invalid=1065, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:01:58,433 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 44 states. [2019-08-05 11:02:01,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:01,757 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 11:02:01,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 11:02:01,757 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 82 [2019-08-05 11:02:01,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:01,758 INFO L225 Difference]: With dead ends: 86 [2019-08-05 11:02:01,758 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 11:02:01,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2588, Invalid=4552, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:02:01,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 11:02:01,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-08-05 11:02:01,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:02:01,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 11:02:01,762 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2019-08-05 11:02:01,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:01,762 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 11:02:01,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 11:02:01,762 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 11:02:01,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 11:02:01,763 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:01,763 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2019-08-05 11:02:01,763 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:01,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:01,764 INFO L82 PathProgramCache]: Analyzing trace with hash 847361751, now seen corresponding path program 40 times [2019-08-05 11:02:01,764 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:03,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:03,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 1541 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:02:03,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:03,405 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:02:03,405 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:03,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:03,439 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:03,439 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:02:04,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:04,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:04,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 11:02:04,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 11:02:04,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 11:02:04,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=868, Invalid=1112, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:02:04,498 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 45 states. [2019-08-05 11:02:07,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:07,758 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 11:02:07,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 11:02:07,759 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 84 [2019-08-05 11:02:07,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:07,760 INFO L225 Difference]: With dead ends: 88 [2019-08-05 11:02:07,760 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 11:02:07,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 980 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2714, Invalid=4768, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:02:07,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 11:02:07,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-08-05 11:02:07,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 11:02:07,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 11:02:07,763 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2019-08-05 11:02:07,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:07,764 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 11:02:07,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 11:02:07,764 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 11:02:07,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 11:02:07,765 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:07,765 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2019-08-05 11:02:07,765 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:07,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:07,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1729091439, now seen corresponding path program 41 times [2019-08-05 11:02:07,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:08,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:08,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 1578 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 11:02:08,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:08,357 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:02:08,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:08,385 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:08,386 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:08,386 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:02:09,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:09,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:09,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:02:09,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 11:02:09,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 11:02:09,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=910, Invalid=1160, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:02:09,516 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 46 states. [2019-08-05 11:02:13,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:13,081 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 11:02:13,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:02:13,084 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 86 [2019-08-05 11:02:13,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:13,085 INFO L225 Difference]: With dead ends: 90 [2019-08-05 11:02:13,085 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 11:02:13,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2843, Invalid=4989, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:02:13,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 11:02:13,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-08-05 11:02:13,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 11:02:13,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 11:02:13,088 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2019-08-05 11:02:13,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:13,088 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 11:02:13,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 11:02:13,088 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 11:02:13,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 11:02:13,089 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:13,089 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2019-08-05 11:02:13,089 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:13,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:13,089 INFO L82 PathProgramCache]: Analyzing trace with hash 495522763, now seen corresponding path program 42 times [2019-08-05 11:02:13,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:13,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 1615 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:02:13,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:13,417 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:02:13,417 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:13,484 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:13,484 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:13,484 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:02:14,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:14,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:14,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 11:02:14,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 11:02:14,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 11:02:14,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=953, Invalid=1209, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:02:14,702 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 47 states. [2019-08-05 11:02:18,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:18,171 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 11:02:18,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 11:02:18,172 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 88 [2019-08-05 11:02:18,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:18,173 INFO L225 Difference]: With dead ends: 92 [2019-08-05 11:02:18,173 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 11:02:18,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1071 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2975, Invalid=5215, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:02:18,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 11:02:18,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-08-05 11:02:18,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:02:18,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 11:02:18,176 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2019-08-05 11:02:18,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:18,176 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 11:02:18,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 11:02:18,176 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 11:02:18,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 11:02:18,177 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:18,177 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2019-08-05 11:02:18,177 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:18,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:18,177 INFO L82 PathProgramCache]: Analyzing trace with hash -543942523, now seen corresponding path program 43 times [2019-08-05 11:02:18,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:18,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 1652 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 11:02:18,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:18,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:02:18,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:18,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:18,707 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:18,707 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:02:19,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:19,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:19,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 11:02:19,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 11:02:19,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 11:02:19,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=997, Invalid=1259, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:02:19,983 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 48 states. [2019-08-05 11:02:23,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:23,714 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 11:02:23,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 11:02:23,714 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 90 [2019-08-05 11:02:23,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:23,715 INFO L225 Difference]: With dead ends: 94 [2019-08-05 11:02:23,716 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 11:02:23,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1118 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3110, Invalid=5446, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:02:23,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 11:02:23,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-08-05 11:02:23,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:02:23,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 11:02:23,719 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2019-08-05 11:02:23,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:23,720 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 11:02:23,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 11:02:23,720 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 11:02:23,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 11:02:23,721 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:23,721 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2019-08-05 11:02:23,721 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:23,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:23,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1257297599, now seen corresponding path program 44 times [2019-08-05 11:02:23,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:24,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 1689 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 11:02:24,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:24,152 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:02:24,152 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:24,178 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:24,178 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:24,179 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:02:25,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:25,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:25,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 11:02:25,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 11:02:25,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 11:02:25,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1042, Invalid=1310, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:02:25,475 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 49 states. [2019-08-05 11:02:29,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:29,182 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 11:02:29,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 11:02:29,182 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 92 [2019-08-05 11:02:29,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:29,183 INFO L225 Difference]: With dead ends: 96 [2019-08-05 11:02:29,183 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 11:02:29,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3248, Invalid=5682, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:02:29,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 11:02:29,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-08-05 11:02:29,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:02:29,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 11:02:29,188 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2019-08-05 11:02:29,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:29,188 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 11:02:29,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 11:02:29,188 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 11:02:29,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 11:02:29,189 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:29,189 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2019-08-05 11:02:29,189 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:29,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:29,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1377234553, now seen corresponding path program 45 times [2019-08-05 11:02:29,190 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:30,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 1726 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 11:02:30,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:30,803 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:02:30,803 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:30,825 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:30,826 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:30,826 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:02:32,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:32,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:32,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 11:02:32,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 11:02:32,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 11:02:32,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=1362, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:02:32,564 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 50 states. [2019-08-05 11:02:36,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:36,450 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 11:02:36,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 11:02:36,451 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 94 [2019-08-05 11:02:36,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:36,452 INFO L225 Difference]: With dead ends: 98 [2019-08-05 11:02:36,452 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 11:02:36,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1215 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=3389, Invalid=5923, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:02:36,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 11:02:36,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-08-05 11:02:36,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:02:36,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 11:02:36,455 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2019-08-05 11:02:36,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:36,456 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 11:02:36,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 11:02:36,456 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 11:02:36,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 11:02:36,456 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:36,456 INFO L399 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2019-08-05 11:02:36,456 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:36,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:36,457 INFO L82 PathProgramCache]: Analyzing trace with hash 672530355, now seen corresponding path program 46 times [2019-08-05 11:02:36,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:36,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 1763 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 11:02:36,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:36,966 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:02:36,966 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:36,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:36,980 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:36,980 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:02:39,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:39,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:39,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 11:02:39,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 11:02:39,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 11:02:39,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1135, Invalid=1415, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:02:39,408 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 51 states. [2019-08-05 11:02:43,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:43,464 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 11:02:43,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 11:02:43,464 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 96 [2019-08-05 11:02:43,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:43,465 INFO L225 Difference]: With dead ends: 100 [2019-08-05 11:02:43,466 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 11:02:43,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1265 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=3533, Invalid=6169, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:02:43,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 11:02:43,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2019-08-05 11:02:43,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:02:43,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-05 11:02:43,469 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2019-08-05 11:02:43,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:43,470 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-05 11:02:43,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 11:02:43,470 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-05 11:02:43,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 11:02:43,470 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:43,470 INFO L399 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2019-08-05 11:02:43,470 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:43,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:43,471 INFO L82 PathProgramCache]: Analyzing trace with hash 2056628845, now seen corresponding path program 47 times [2019-08-05 11:02:43,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:43,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:43,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 1800 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 11:02:43,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:43,933 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:02:43,934 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:43,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:43,950 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:43,950 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:02:45,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:45,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:45,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 11:02:45,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 11:02:45,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 11:02:45,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1183, Invalid=1469, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:02:45,417 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 52 states. [2019-08-05 11:02:49,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:49,543 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 11:02:49,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 11:02:49,544 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 98 [2019-08-05 11:02:49,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:49,545 INFO L225 Difference]: With dead ends: 102 [2019-08-05 11:02:49,545 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 11:02:49,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1316 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=3680, Invalid=6420, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:02:49,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 11:02:49,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-08-05 11:02:49,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:02:49,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 11:02:49,549 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2019-08-05 11:02:49,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:49,550 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 11:02:49,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 11:02:49,550 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 11:02:49,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 11:02:49,550 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:49,550 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2019-08-05 11:02:49,550 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:49,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:49,551 INFO L82 PathProgramCache]: Analyzing trace with hash 735415975, now seen corresponding path program 48 times [2019-08-05 11:02:49,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:49,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 1837 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 11:02:49,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:49,982 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:02:49,983 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:49,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:49,995 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:49,996 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:02:51,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:51,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:51,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 11:02:51,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 11:02:51,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 11:02:51,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1232, Invalid=1524, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:02:51,629 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 53 states. [2019-08-05 11:02:55,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:55,716 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 11:02:55,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 11:02:55,716 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 100 [2019-08-05 11:02:55,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:55,717 INFO L225 Difference]: With dead ends: 104 [2019-08-05 11:02:55,718 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 11:02:55,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1368 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=3830, Invalid=6676, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 11:02:55,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 11:02:55,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-08-05 11:02:55,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:02:55,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-05 11:02:55,722 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2019-08-05 11:02:55,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:55,722 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-05 11:02:55,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 11:02:55,722 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-05 11:02:55,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 11:02:55,723 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:55,723 INFO L399 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2019-08-05 11:02:55,723 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:55,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:55,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1934799775, now seen corresponding path program 49 times [2019-08-05 11:02:55,724 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:58,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 1874 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 11:02:58,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:58,167 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:02:58,167 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:58,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:58,203 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:58,203 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:02:59,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:59,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:59,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 11:02:59,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 11:02:59,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 11:02:59,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1282, Invalid=1580, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:02:59,780 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 54 states. [2019-08-05 11:03:04,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:04,241 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 11:03:04,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:03:04,242 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 102 [2019-08-05 11:03:04,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:04,243 INFO L225 Difference]: With dead ends: 106 [2019-08-05 11:03:04,243 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 11:03:04,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1421 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=3983, Invalid=6937, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 11:03:04,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 11:03:04,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-08-05 11:03:04,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:03:04,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-05 11:03:04,247 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2019-08-05 11:03:04,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:04,247 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-05 11:03:04,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 11:03:04,248 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-05 11:03:04,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 11:03:04,248 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:04,248 INFO L399 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2019-08-05 11:03:04,249 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:04,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:04,249 INFO L82 PathProgramCache]: Analyzing trace with hash 378307483, now seen corresponding path program 50 times [2019-08-05 11:03:04,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:05,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 1911 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 11:03:05,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:05,306 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:03:05,306 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:05,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:05,386 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:03:05,386 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:03:05,515 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 11:03:08,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:08,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:08,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 11:03:08,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 11:03:08,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 11:03:08,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1333, Invalid=1637, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:03:08,270 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 55 states. [2019-08-05 11:03:12,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:12,837 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-05 11:03:12,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 11:03:12,838 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 104 [2019-08-05 11:03:12,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:12,840 INFO L225 Difference]: With dead ends: 108 [2019-08-05 11:03:12,840 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 11:03:12,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1475 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=4139, Invalid=7203, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 11:03:12,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 11:03:12,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-08-05 11:03:12,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:03:12,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-08-05 11:03:12,844 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2019-08-05 11:03:12,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:12,845 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-08-05 11:03:12,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 11:03:12,845 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-08-05 11:03:12,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 11:03:12,846 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:12,846 INFO L399 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2019-08-05 11:03:12,846 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:12,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:12,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1518676907, now seen corresponding path program 51 times [2019-08-05 11:03:12,848 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:13,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:13,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 1948 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 11:03:13,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:13,334 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:03:13,335 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:13,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:13,349 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:03:13,349 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:03:14,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:14,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:14,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 11:03:14,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 11:03:14,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 11:03:14,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1385, Invalid=1695, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:03:14,970 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 56 states. [2019-08-05 11:03:19,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:19,732 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-05 11:03:19,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 11:03:19,733 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 106 [2019-08-05 11:03:19,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:19,734 INFO L225 Difference]: With dead ends: 110 [2019-08-05 11:03:19,734 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 11:03:19,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1530 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=4298, Invalid=7474, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 11:03:19,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 11:03:19,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-08-05 11:03:19,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:03:19,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-05 11:03:19,739 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2019-08-05 11:03:19,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:19,739 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-05 11:03:19,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 11:03:19,740 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-05 11:03:19,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 11:03:19,740 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:19,740 INFO L399 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2019-08-05 11:03:19,741 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:19,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:19,741 INFO L82 PathProgramCache]: Analyzing trace with hash 840425103, now seen corresponding path program 52 times [2019-08-05 11:03:19,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:20,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 1985 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 11:03:20,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:20,521 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:03:20,521 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:20,538 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:20,538 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:03:20,538 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:03:22,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:22,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:22,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 11:03:22,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 11:03:22,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 11:03:22,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1438, Invalid=1754, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:03:22,410 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 57 states. [2019-08-05 11:03:27,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:27,242 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-08-05 11:03:27,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 11:03:27,243 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 108 [2019-08-05 11:03:27,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:27,243 INFO L225 Difference]: With dead ends: 112 [2019-08-05 11:03:27,243 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 11:03:27,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1586 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=4460, Invalid=7750, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 11:03:27,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 11:03:27,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-08-05 11:03:27,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:03:27,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-08-05 11:03:27,246 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2019-08-05 11:03:27,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:27,247 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-08-05 11:03:27,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 11:03:27,247 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-08-05 11:03:27,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 11:03:27,247 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:27,247 INFO L399 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1] [2019-08-05 11:03:27,247 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:27,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:27,248 INFO L82 PathProgramCache]: Analyzing trace with hash 194724425, now seen corresponding path program 53 times [2019-08-05 11:03:27,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:27,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 2022 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 11:03:27,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:27,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:03:27,831 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:27,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:27,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:03:27,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:03:29,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:29,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:29,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 11:03:29,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 11:03:29,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 11:03:29,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1492, Invalid=1814, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:03:29,790 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 58 states. [2019-08-05 11:03:34,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:34,806 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-08-05 11:03:34,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 11:03:34,807 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 110 [2019-08-05 11:03:34,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:34,808 INFO L225 Difference]: With dead ends: 114 [2019-08-05 11:03:34,808 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 11:03:34,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1643 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=4625, Invalid=8031, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 11:03:34,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 11:03:34,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-08-05 11:03:34,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:03:34,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-05 11:03:34,813 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2019-08-05 11:03:34,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:34,813 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-05 11:03:34,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 11:03:34,813 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-05 11:03:34,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 11:03:34,814 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:34,814 INFO L399 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1] [2019-08-05 11:03:34,814 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:34,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:34,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1848336509, now seen corresponding path program 54 times [2019-08-05 11:03:34,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:41,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 2059 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 11:03:41,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:41,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:03:41,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:41,336 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:41,336 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:03:41,336 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:03:43,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:43,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:43,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 11:03:43,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 11:03:43,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 11:03:43,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1547, Invalid=1875, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:03:43,407 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 59 states. [2019-08-05 11:03:48,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:48,651 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-05 11:03:48,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 11:03:48,652 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 112 [2019-08-05 11:03:48,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:48,653 INFO L225 Difference]: With dead ends: 116 [2019-08-05 11:03:48,653 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 11:03:48,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1701 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=4793, Invalid=8317, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 11:03:48,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 11:03:48,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-08-05 11:03:48,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:03:48,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-08-05 11:03:48,656 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2019-08-05 11:03:48,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:48,657 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-08-05 11:03:48,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 11:03:48,657 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-08-05 11:03:48,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 11:03:48,658 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:48,658 INFO L399 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1] [2019-08-05 11:03:48,658 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:48,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:48,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1865127485, now seen corresponding path program 55 times [2019-08-05 11:03:48,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:49,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 2096 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 11:03:49,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:49,445 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:03:49,445 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:49,471 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:49,471 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:03:49,471 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-05 11:03:51,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:51,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:51,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 11:03:51,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 11:03:51,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 11:03:51,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1603, Invalid=1937, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:03:51,279 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 60 states. [2019-08-05 11:03:56,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:56,526 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-08-05 11:03:56,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 11:03:56,527 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 114 [2019-08-05 11:03:56,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:56,528 INFO L225 Difference]: With dead ends: 118 [2019-08-05 11:03:56,528 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 11:03:56,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1760 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=4964, Invalid=8608, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 11:03:56,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 11:03:56,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-08-05 11:03:56,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:03:56,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-08-05 11:03:56,532 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2019-08-05 11:03:56,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:56,532 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-08-05 11:03:56,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 11:03:56,532 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-08-05 11:03:56,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 11:03:56,533 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:56,533 INFO L399 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1] [2019-08-05 11:03:56,533 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:56,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:56,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1386202743, now seen corresponding path program 56 times [2019-08-05 11:03:56,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:01,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:01,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 2133 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 11:04:01,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:01,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:04:01,386 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:01,393 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:01,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:01,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 Received shutdown request... [2019-08-05 11:04:01,784 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 11:04:01,784 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 11:04:01,790 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 11:04:01,790 INFO L202 PluginConnector]: Adding new model standard_strcpy_original_false-valid-deref.i_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:04:01 BoogieIcfgContainer [2019-08-05 11:04:01,790 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:04:01,791 INFO L168 Benchmark]: Toolchain (without parser) took 235616.21 ms. Allocated memory was 141.0 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 110.3 MB in the beginning and 359.8 MB in the end (delta: -249.5 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-08-05 11:04:01,791 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 141.0 MB. Free memory is still 111.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:04:01,792 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.10 ms. Allocated memory is still 141.0 MB. Free memory was 110.3 MB in the beginning and 108.6 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:04:01,792 INFO L168 Benchmark]: Boogie Preprocessor took 40.32 ms. Allocated memory is still 141.0 MB. Free memory was 108.6 MB in the beginning and 107.3 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:04:01,792 INFO L168 Benchmark]: RCFGBuilder took 332.18 ms. Allocated memory is still 141.0 MB. Free memory was 107.3 MB in the beginning and 94.9 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. [2019-08-05 11:04:01,793 INFO L168 Benchmark]: TraceAbstraction took 235194.74 ms. Allocated memory was 141.0 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 94.9 MB in the beginning and 359.8 MB in the end (delta: -264.9 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-08-05 11:04:01,794 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.23 ms. Allocated memory is still 141.0 MB. Free memory is still 111.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.10 ms. Allocated memory is still 141.0 MB. Free memory was 110.3 MB in the beginning and 108.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.32 ms. Allocated memory is still 141.0 MB. Free memory was 108.6 MB in the beginning and 107.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 332.18 ms. Allocated memory is still 141.0 MB. Free memory was 107.3 MB in the beginning and 94.9 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 235194.74 ms. Allocated memory was 141.0 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 94.9 MB in the beginning and 359.8 MB in the end (delta: -264.9 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 107). Cancelled while BasicCegarLoop was analyzing trace of length 117 with TraceHistMax 57,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 235.1s OverallTime, 57 OverallIterations, 57 TraceHistogramMax, 129.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 168 SDtfs, 59 SDslu, 440 SDs, 0 SdLazy, 4409 SolverSat, 6273 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4898 GetRequests, 1537 SyntacticMatches, 0 SemanticMatches, 3361 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35653 ImplicationChecksByTransitivity, 169.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 56 MinimizatonAttempts, 56 StatesRemovedByMinimization, 56 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 33.0s SatisfiabilityAnalysisTime, 66.0s InterpolantComputationTime, 3304 NumberOfCodeBlocks, 3304 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 3248 ConstructedInterpolants, 126 QuantifiedInterpolants, 3050360 SizeOfPredicates, 717 NumberOfNonLiveVariables, 60396 ConjunctsInSsa, 2574 ConjunctsInUnsatCore, 56 InterpolantComputations, 1 PerfectInterpolantSequences, 0/58520 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown