java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 15:25:34,189 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 15:25:34,191 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 15:25:34,202 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 15:25:34,202 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 15:25:34,203 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 15:25:34,204 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 15:25:34,209 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 15:25:34,211 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 15:25:34,216 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 15:25:34,217 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 15:25:34,217 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 15:25:34,221 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 15:25:34,222 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 15:25:34,223 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 15:25:34,226 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 15:25:34,227 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 15:25:34,232 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 15:25:34,234 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 15:25:34,235 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 15:25:34,239 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 15:25:34,240 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 15:25:34,245 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 15:25:34,245 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 15:25:34,245 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 15:25:34,247 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 15:25:34,248 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 15:25:34,249 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 15:25:34,249 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 15:25:34,250 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 15:25:34,251 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 15:25:34,251 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 15:25:34,251 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 15:25:34,251 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 15:25:34,254 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 15:25:34,254 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 15:25:34,254 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-10 15:25:34,269 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 15:25:34,269 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 15:25:34,270 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 15:25:34,270 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 15:25:34,270 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 15:25:34,271 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 15:25:34,271 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 15:25:34,271 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 15:25:34,272 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 15:25:34,272 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 15:25:34,272 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 15:25:34,272 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 15:25:34,273 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 15:25:34,273 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 15:25:34,274 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 15:25:34,338 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 15:25:34,354 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 15:25:34,362 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 15:25:34,364 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 15:25:34,364 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 15:25:34,365 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl [2018-10-10 15:25:34,365 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl' [2018-10-10 15:25:34,428 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 15:25:34,432 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-10 15:25:34,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 15:25:34,434 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 15:25:34,434 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 15:25:34,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:25:34" (1/1) ... [2018-10-10 15:25:34,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:25:34" (1/1) ... [2018-10-10 15:25:34,482 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:25:34" (1/1) ... [2018-10-10 15:25:34,483 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:25:34" (1/1) ... [2018-10-10 15:25:34,494 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:25:34" (1/1) ... [2018-10-10 15:25:34,497 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:25:34" (1/1) ... [2018-10-10 15:25:34,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:25:34" (1/1) ... [2018-10-10 15:25:34,501 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 15:25:34,508 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 15:25:34,508 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 15:25:34,509 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 15:25:34,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:25:34" (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 [2018-10-10 15:25:34,586 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 15:25:34,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 15:25:34,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 15:25:35,144 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 15:25:35,145 INFO L202 PluginConnector]: Adding new model ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:25:35 BoogieIcfgContainer [2018-10-10 15:25:35,145 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 15:25:35,146 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 15:25:35,146 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 15:25:35,149 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 15:25:35,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:25:34" (1/2) ... [2018-10-10 15:25:35,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e4ed0b and model type ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 03:25:35, skipping insertion in model container [2018-10-10 15:25:35,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:25:35" (2/2) ... [2018-10-10 15:25:35,153 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl [2018-10-10 15:25:35,161 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 15:25:35,169 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 15:25:35,183 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 15:25:35,212 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 15:25:35,213 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 15:25:35,213 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 15:25:35,214 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 15:25:35,214 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 15:25:35,214 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 15:25:35,214 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 15:25:35,214 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 15:25:35,214 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 15:25:35,233 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-10-10 15:25:35,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-10 15:25:35,242 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:25:35,243 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:25:35,244 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:25:35,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:25:35,251 INFO L82 PathProgramCache]: Analyzing trace with hash 842605047, now seen corresponding path program 1 times [2018-10-10 15:25:35,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:25:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:25:35,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:25:35,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:25:35,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 15:25:35,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 15:25:35,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 15:25:35,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-10 15:25:35,582 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 7 states. [2018-10-10 15:25:36,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:25:36,208 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2018-10-10 15:25:36,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 15:25:36,210 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-10-10 15:25:36,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:25:36,223 INFO L225 Difference]: With dead ends: 160 [2018-10-10 15:25:36,224 INFO L226 Difference]: Without dead ends: 160 [2018-10-10 15:25:36,226 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-10-10 15:25:36,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-10 15:25:36,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 80. [2018-10-10 15:25:36,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-10 15:25:36,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-10-10 15:25:36,273 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 39 [2018-10-10 15:25:36,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:25:36,274 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-10-10 15:25:36,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 15:25:36,275 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-10-10 15:25:36,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-10 15:25:36,276 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:25:36,277 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:25:36,277 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:25:36,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:25:36,277 INFO L82 PathProgramCache]: Analyzing trace with hash -19162818, now seen corresponding path program 1 times [2018-10-10 15:25:36,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:25:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:25:36,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:25:36,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:25:36,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 15:25:36,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 15:25:36,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 15:25:36,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:25:36,489 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 8 states. [2018-10-10 15:25:37,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:25:37,056 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2018-10-10 15:25:37,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 15:25:37,060 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-10-10 15:25:37,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:25:37,062 INFO L225 Difference]: With dead ends: 114 [2018-10-10 15:25:37,062 INFO L226 Difference]: Without dead ends: 114 [2018-10-10 15:25:37,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-10-10 15:25:37,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-10 15:25:37,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 95. [2018-10-10 15:25:37,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-10 15:25:37,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2018-10-10 15:25:37,076 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 54 [2018-10-10 15:25:37,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:25:37,079 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2018-10-10 15:25:37,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 15:25:37,080 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2018-10-10 15:25:37,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-10 15:25:37,083 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:25:37,083 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:25:37,083 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:25:37,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:25:37,084 INFO L82 PathProgramCache]: Analyzing trace with hash 899570805, now seen corresponding path program 1 times [2018-10-10 15:25:37,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:25:37,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:25:37,278 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-10 15:25:37,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:25:37,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-10 15:25:37,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 15:25:37,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 15:25:37,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 15:25:37,280 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand 5 states. [2018-10-10 15:25:37,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:25:37,744 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2018-10-10 15:25:37,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 15:25:37,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-10-10 15:25:37,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:25:37,750 INFO L225 Difference]: With dead ends: 160 [2018-10-10 15:25:37,752 INFO L226 Difference]: Without dead ends: 160 [2018-10-10 15:25:37,752 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-10 15:25:37,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-10 15:25:37,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 110. [2018-10-10 15:25:37,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-10 15:25:37,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 113 transitions. [2018-10-10 15:25:37,775 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 113 transitions. Word has length 94 [2018-10-10 15:25:37,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:25:37,776 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 113 transitions. [2018-10-10 15:25:37,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 15:25:37,776 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2018-10-10 15:25:37,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-10 15:25:37,778 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:25:37,779 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:25:37,780 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:25:37,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:25:37,780 INFO L82 PathProgramCache]: Analyzing trace with hash 921064192, now seen corresponding path program 2 times [2018-10-10 15:25:37,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:25:37,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:25:38,093 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 5 proven. 58 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-10 15:25:38,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:25:38,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 15:25:38,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 15:25:38,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 15:25:38,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:25:38,095 INFO L87 Difference]: Start difference. First operand 110 states and 113 transitions. Second operand 12 states. [2018-10-10 15:25:38,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:25:38,925 INFO L93 Difference]: Finished difference Result 203 states and 208 transitions. [2018-10-10 15:25:38,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-10 15:25:38,926 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 109 [2018-10-10 15:25:38,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:25:38,929 INFO L225 Difference]: With dead ends: 203 [2018-10-10 15:25:38,929 INFO L226 Difference]: Without dead ends: 203 [2018-10-10 15:25:38,930 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=274, Invalid=916, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 15:25:38,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-10-10 15:25:38,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 165. [2018-10-10 15:25:38,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-10 15:25:38,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 170 transitions. [2018-10-10 15:25:38,942 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 170 transitions. Word has length 109 [2018-10-10 15:25:38,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:25:38,943 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 170 transitions. [2018-10-10 15:25:38,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 15:25:38,943 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 170 transitions. [2018-10-10 15:25:38,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-10 15:25:38,945 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:25:38,946 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:25:38,946 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:25:38,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:25:38,947 INFO L82 PathProgramCache]: Analyzing trace with hash 2132717150, now seen corresponding path program 3 times [2018-10-10 15:25:38,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:25:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:25:39,139 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 71 proven. 11 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-10 15:25:39,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:25:39,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 15:25:39,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 15:25:39,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 15:25:39,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:25:39,141 INFO L87 Difference]: Start difference. First operand 165 states and 170 transitions. Second operand 8 states. [2018-10-10 15:25:39,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:25:39,424 INFO L93 Difference]: Finished difference Result 184 states and 188 transitions. [2018-10-10 15:25:39,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 15:25:39,425 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 134 [2018-10-10 15:25:39,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:25:39,427 INFO L225 Difference]: With dead ends: 184 [2018-10-10 15:25:39,427 INFO L226 Difference]: Without dead ends: 184 [2018-10-10 15:25:39,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:25:39,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-10 15:25:39,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 165. [2018-10-10 15:25:39,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-10 15:25:39,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 169 transitions. [2018-10-10 15:25:39,439 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 169 transitions. Word has length 134 [2018-10-10 15:25:39,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:25:39,439 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 169 transitions. [2018-10-10 15:25:39,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 15:25:39,440 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2018-10-10 15:25:39,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-10 15:25:39,442 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:25:39,443 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:25:39,443 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:25:39,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:25:39,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1313866263, now seen corresponding path program 4 times [2018-10-10 15:25:39,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:25:39,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:25:39,711 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 103 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-10 15:25:39,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:25:39,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 15:25:39,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 15:25:39,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 15:25:39,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:25:39,713 INFO L87 Difference]: Start difference. First operand 165 states and 169 transitions. Second operand 10 states. [2018-10-10 15:25:40,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:25:40,224 INFO L93 Difference]: Finished difference Result 184 states and 187 transitions. [2018-10-10 15:25:40,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 15:25:40,226 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 149 [2018-10-10 15:25:40,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:25:40,228 INFO L225 Difference]: With dead ends: 184 [2018-10-10 15:25:40,228 INFO L226 Difference]: Without dead ends: 184 [2018-10-10 15:25:40,229 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2018-10-10 15:25:40,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-10 15:25:40,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 165. [2018-10-10 15:25:40,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-10 15:25:40,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 168 transitions. [2018-10-10 15:25:40,237 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 168 transitions. Word has length 149 [2018-10-10 15:25:40,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:25:40,238 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 168 transitions. [2018-10-10 15:25:40,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 15:25:40,238 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 168 transitions. [2018-10-10 15:25:40,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-10 15:25:40,241 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:25:40,241 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:25:40,241 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:25:40,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:25:40,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1755989758, now seen corresponding path program 5 times [2018-10-10 15:25:40,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:25:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:25:40,797 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 2 proven. 195 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-10 15:25:40,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:25:40,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-10 15:25:40,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 15:25:40,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 15:25:40,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-10-10 15:25:40,799 INFO L87 Difference]: Start difference. First operand 165 states and 168 transitions. Second operand 15 states. [2018-10-10 15:25:42,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:25:42,178 INFO L93 Difference]: Finished difference Result 290 states and 296 transitions. [2018-10-10 15:25:42,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-10 15:25:42,179 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 164 [2018-10-10 15:25:42,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:25:42,183 INFO L225 Difference]: With dead ends: 290 [2018-10-10 15:25:42,183 INFO L226 Difference]: Without dead ends: 290 [2018-10-10 15:25:42,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=469, Invalid=1787, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 15:25:42,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-10-10 15:25:42,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 204. [2018-10-10 15:25:42,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-10-10 15:25:42,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 208 transitions. [2018-10-10 15:25:42,195 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 208 transitions. Word has length 164 [2018-10-10 15:25:42,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:25:42,196 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 208 transitions. [2018-10-10 15:25:42,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 15:25:42,196 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 208 transitions. [2018-10-10 15:25:42,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-10 15:25:42,199 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:25:42,199 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:25:42,199 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:25:42,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:25:42,200 INFO L82 PathProgramCache]: Analyzing trace with hash -566062048, now seen corresponding path program 6 times [2018-10-10 15:25:42,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:25:42,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:25:42,389 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 177 proven. 4 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-10-10 15:25:42,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:25:42,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 15:25:42,389 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 15:25:42,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 15:25:42,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:25:42,390 INFO L87 Difference]: Start difference. First operand 204 states and 208 transitions. Second operand 10 states. [2018-10-10 15:25:42,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:25:42,664 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2018-10-10 15:25:42,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 15:25:42,665 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 189 [2018-10-10 15:25:42,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:25:42,666 INFO L225 Difference]: With dead ends: 225 [2018-10-10 15:25:42,666 INFO L226 Difference]: Without dead ends: 218 [2018-10-10 15:25:42,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-10-10 15:25:42,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-10 15:25:42,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 205. [2018-10-10 15:25:42,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-10 15:25:42,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 208 transitions. [2018-10-10 15:25:42,672 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 208 transitions. Word has length 189 [2018-10-10 15:25:42,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:25:42,672 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 208 transitions. [2018-10-10 15:25:42,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 15:25:42,673 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 208 transitions. [2018-10-10 15:25:42,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-10 15:25:42,675 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:25:42,676 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:25:42,676 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:25:42,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:25:42,676 INFO L82 PathProgramCache]: Analyzing trace with hash 875535335, now seen corresponding path program 7 times [2018-10-10 15:25:42,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:25:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:25:43,193 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 197 proven. 126 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-10-10 15:25:43,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:25:43,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 15:25:43,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 15:25:43,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 15:25:43,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:25:43,195 INFO L87 Difference]: Start difference. First operand 205 states and 208 transitions. Second operand 12 states. [2018-10-10 15:25:43,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:25:43,585 INFO L93 Difference]: Finished difference Result 245 states and 247 transitions. [2018-10-10 15:25:43,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 15:25:43,586 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 204 [2018-10-10 15:25:43,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:25:43,588 INFO L225 Difference]: With dead ends: 245 [2018-10-10 15:25:43,588 INFO L226 Difference]: Without dead ends: 245 [2018-10-10 15:25:43,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-10-10 15:25:43,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-10 15:25:43,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 220. [2018-10-10 15:25:43,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-10-10 15:25:43,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 222 transitions. [2018-10-10 15:25:43,594 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 222 transitions. Word has length 204 [2018-10-10 15:25:43,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:25:43,594 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 222 transitions. [2018-10-10 15:25:43,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 15:25:43,594 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 222 transitions. [2018-10-10 15:25:43,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-10 15:25:43,596 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:25:43,596 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:25:43,596 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:25:43,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:25:43,597 INFO L82 PathProgramCache]: Analyzing trace with hash -65589952, now seen corresponding path program 8 times [2018-10-10 15:25:43,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:25:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:25:44,616 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 229 proven. 189 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-10-10 15:25:44,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:25:44,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-10 15:25:44,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 15:25:44,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 15:25:44,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:25:44,617 INFO L87 Difference]: Start difference. First operand 220 states and 222 transitions. Second operand 14 states. [2018-10-10 15:25:45,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:25:45,138 INFO L93 Difference]: Finished difference Result 249 states and 251 transitions. [2018-10-10 15:25:45,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 15:25:45,139 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 219 [2018-10-10 15:25:45,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:25:45,140 INFO L225 Difference]: With dead ends: 249 [2018-10-10 15:25:45,141 INFO L226 Difference]: Without dead ends: 249 [2018-10-10 15:25:45,141 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=181, Invalid=689, Unknown=0, NotChecked=0, Total=870 [2018-10-10 15:25:45,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-10-10 15:25:45,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2018-10-10 15:25:45,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-10 15:25:45,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 251 transitions. [2018-10-10 15:25:45,147 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 251 transitions. Word has length 219 [2018-10-10 15:25:45,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:25:45,148 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 251 transitions. [2018-10-10 15:25:45,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 15:25:45,148 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 251 transitions. [2018-10-10 15:25:45,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-10 15:25:45,149 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:25:45,149 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:25:45,150 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:25:45,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:25:45,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1817076025, now seen corresponding path program 9 times [2018-10-10 15:25:45,151 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:25:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:25:45,822 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 201 proven. 19 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-10-10 15:25:45,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:25:45,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-10 15:25:45,823 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 15:25:45,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 15:25:45,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-10 15:25:45,824 INFO L87 Difference]: Start difference. First operand 249 states and 251 transitions. Second operand 7 states. [2018-10-10 15:25:46,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:25:46,021 INFO L93 Difference]: Finished difference Result 275 states and 277 transitions. [2018-10-10 15:25:46,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 15:25:46,021 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 234 [2018-10-10 15:25:46,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:25:46,024 INFO L225 Difference]: With dead ends: 275 [2018-10-10 15:25:46,024 INFO L226 Difference]: Without dead ends: 275 [2018-10-10 15:25:46,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-10 15:25:46,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-10 15:25:46,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 250. [2018-10-10 15:25:46,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-10-10 15:25:46,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 252 transitions. [2018-10-10 15:25:46,042 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 252 transitions. Word has length 234 [2018-10-10 15:25:46,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:25:46,042 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 252 transitions. [2018-10-10 15:25:46,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 15:25:46,043 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 252 transitions. [2018-10-10 15:25:46,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-10-10 15:25:46,044 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:25:46,044 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:25:46,044 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:25:46,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:25:46,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1818223214, now seen corresponding path program 10 times [2018-10-10 15:25:46,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:25:46,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:25:46,323 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 607 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-10-10 15:25:46,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:25:46,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-10 15:25:46,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 15:25:46,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 15:25:46,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-10-10 15:25:46,324 INFO L87 Difference]: Start difference. First operand 250 states and 252 transitions. Second operand 15 states. [2018-10-10 15:25:47,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:25:47,505 INFO L93 Difference]: Finished difference Result 340 states and 343 transitions. [2018-10-10 15:25:47,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-10 15:25:47,505 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 249 [2018-10-10 15:25:47,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:25:47,508 INFO L225 Difference]: With dead ends: 340 [2018-10-10 15:25:47,508 INFO L226 Difference]: Without dead ends: 340 [2018-10-10 15:25:47,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=686, Invalid=2284, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 15:25:47,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-10 15:25:47,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 320. [2018-10-10 15:25:47,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-10-10 15:25:47,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 323 transitions. [2018-10-10 15:25:47,516 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 323 transitions. Word has length 249 [2018-10-10 15:25:47,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:25:47,517 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 323 transitions. [2018-10-10 15:25:47,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 15:25:47,517 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 323 transitions. [2018-10-10 15:25:47,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-10-10 15:25:47,519 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:25:47,519 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:25:47,519 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:25:47,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:25:47,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1828338245, now seen corresponding path program 11 times [2018-10-10 15:25:47,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:25:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:25:47,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1252 backedges. 646 proven. 489 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-10-10 15:25:47,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:25:47,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-10 15:25:47,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-10 15:25:47,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-10 15:25:47,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:25:47,885 INFO L87 Difference]: Start difference. First operand 320 states and 323 transitions. Second operand 18 states. [2018-10-10 15:25:48,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:25:48,735 INFO L93 Difference]: Finished difference Result 349 states and 352 transitions. [2018-10-10 15:25:48,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-10 15:25:48,735 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 319 [2018-10-10 15:25:48,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:25:48,738 INFO L225 Difference]: With dead ends: 349 [2018-10-10 15:25:48,738 INFO L226 Difference]: Without dead ends: 349 [2018-10-10 15:25:48,739 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=310, Invalid=1250, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 15:25:48,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-10-10 15:25:48,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2018-10-10 15:25:48,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-10-10 15:25:48,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 352 transitions. [2018-10-10 15:25:48,748 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 352 transitions. Word has length 319 [2018-10-10 15:25:48,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:25:48,749 INFO L481 AbstractCegarLoop]: Abstraction has 349 states and 352 transitions. [2018-10-10 15:25:48,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-10 15:25:48,749 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 352 transitions. [2018-10-10 15:25:48,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-10-10 15:25:48,750 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:25:48,751 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:25:48,751 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:25:48,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:25:48,752 INFO L82 PathProgramCache]: Analyzing trace with hash 2108574974, now seen corresponding path program 12 times [2018-10-10 15:25:48,752 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:25:48,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:25:49,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1438 backedges. 29 proven. 1230 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2018-10-10 15:25:49,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:25:49,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-10 15:25:49,609 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 15:25:49,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 15:25:49,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-10-10 15:25:49,610 INFO L87 Difference]: Start difference. First operand 349 states and 352 transitions. Second operand 17 states. [2018-10-10 15:25:50,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:25:50,698 INFO L93 Difference]: Finished difference Result 453 states and 457 transitions. [2018-10-10 15:25:50,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-10 15:25:50,699 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 334 [2018-10-10 15:25:50,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:25:50,703 INFO L225 Difference]: With dead ends: 453 [2018-10-10 15:25:50,703 INFO L226 Difference]: Without dead ends: 453 [2018-10-10 15:25:50,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1016, Invalid=3016, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 15:25:50,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-10-10 15:25:50,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 434. [2018-10-10 15:25:50,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-10-10 15:25:50,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 438 transitions. [2018-10-10 15:25:50,712 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 438 transitions. Word has length 334 [2018-10-10 15:25:50,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:25:50,712 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 438 transitions. [2018-10-10 15:25:50,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 15:25:50,713 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 438 transitions. [2018-10-10 15:25:50,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-10-10 15:25:50,715 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:25:50,715 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:25:50,716 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:25:50,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:25:50,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1231789166, now seen corresponding path program 13 times [2018-10-10 15:25:50,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:25:50,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:25:51,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2459 backedges. 0 proven. 2188 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2018-10-10 15:25:51,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:25:51,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-10 15:25:51,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 15:25:51,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 15:25:51,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-10-10 15:25:51,166 INFO L87 Difference]: Start difference. First operand 434 states and 438 transitions. Second operand 19 states. [2018-10-10 15:25:52,316 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 15:25:54,532 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-10 15:25:54,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:25:54,807 INFO L93 Difference]: Finished difference Result 538 states and 543 transitions. [2018-10-10 15:25:54,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-10 15:25:54,808 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 419 [2018-10-10 15:25:54,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:25:54,813 INFO L225 Difference]: With dead ends: 538 [2018-10-10 15:25:54,813 INFO L226 Difference]: Without dead ends: 538 [2018-10-10 15:25:54,815 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2141 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1354, Invalid=4808, Unknown=0, NotChecked=0, Total=6162 [2018-10-10 15:25:54,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2018-10-10 15:25:54,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 519. [2018-10-10 15:25:54,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2018-10-10 15:25:54,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 524 transitions. [2018-10-10 15:25:54,830 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 524 transitions. Word has length 419 [2018-10-10 15:25:54,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:25:54,831 INFO L481 AbstractCegarLoop]: Abstraction has 519 states and 524 transitions. [2018-10-10 15:25:54,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 15:25:54,831 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 524 transitions. [2018-10-10 15:25:54,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2018-10-10 15:25:54,836 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:25:54,836 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:25:54,837 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:25:54,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:25:54,837 INFO L82 PathProgramCache]: Analyzing trace with hash -940911874, now seen corresponding path program 14 times [2018-10-10 15:25:54,838 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:25:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:25:55,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3753 backedges. 870 proven. 51 refuted. 0 times theorem prover too weak. 2832 trivial. 0 not checked. [2018-10-10 15:25:55,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:25:55,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-10 15:25:55,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 15:25:55,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 15:25:55,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-10 15:25:55,474 INFO L87 Difference]: Start difference. First operand 519 states and 524 transitions. Second operand 9 states. [2018-10-10 15:25:55,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:25:55,764 INFO L93 Difference]: Finished difference Result 618 states and 624 transitions. [2018-10-10 15:25:55,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 15:25:55,764 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 504 [2018-10-10 15:25:55,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:25:55,768 INFO L225 Difference]: With dead ends: 618 [2018-10-10 15:25:55,768 INFO L226 Difference]: Without dead ends: 618 [2018-10-10 15:25:55,769 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-10-10 15:25:55,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-10-10 15:25:55,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 520. [2018-10-10 15:25:55,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-10 15:25:55,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 525 transitions. [2018-10-10 15:25:55,778 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 525 transitions. Word has length 504 [2018-10-10 15:25:55,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:25:55,779 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 525 transitions. [2018-10-10 15:25:55,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 15:25:55,779 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 525 transitions. [2018-10-10 15:25:55,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2018-10-10 15:25:55,782 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:25:55,783 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:25:55,783 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:25:55,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:25:55,783 INFO L82 PathProgramCache]: Analyzing trace with hash 913234263, now seen corresponding path program 15 times [2018-10-10 15:25:55,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:25:55,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:25:59,867 INFO L134 CoverageAnalysis]: Checked inductivity of 4076 backedges. 0 proven. 3680 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2018-10-10 15:25:59,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:25:59,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-10 15:25:59,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 15:25:59,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 15:25:59,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2018-10-10 15:25:59,870 INFO L87 Difference]: Start difference. First operand 520 states and 525 transitions. Second operand 21 states. [2018-10-10 15:26:01,417 WARN L178 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2018-10-10 15:26:02,357 WARN L178 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-10 15:26:02,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:26:02,850 INFO L93 Difference]: Finished difference Result 625 states and 631 transitions. [2018-10-10 15:26:02,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-10 15:26:02,851 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 519 [2018-10-10 15:26:02,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:26:02,856 INFO L225 Difference]: With dead ends: 625 [2018-10-10 15:26:02,856 INFO L226 Difference]: Without dead ends: 625 [2018-10-10 15:26:02,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2937 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=1769, Invalid=6421, Unknown=0, NotChecked=0, Total=8190 [2018-10-10 15:26:02,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-10-10 15:26:02,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 605. [2018-10-10 15:26:02,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2018-10-10 15:26:02,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 611 transitions. [2018-10-10 15:26:02,867 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 611 transitions. Word has length 519 [2018-10-10 15:26:02,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:26:02,868 INFO L481 AbstractCegarLoop]: Abstraction has 605 states and 611 transitions. [2018-10-10 15:26:02,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 15:26:02,868 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 611 transitions. [2018-10-10 15:26:02,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2018-10-10 15:26:02,872 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:26:02,872 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:26:02,872 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:26:02,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:26:02,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1581938713, now seen corresponding path program 16 times [2018-10-10 15:26:02,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:26:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:26:03,571 INFO L134 CoverageAnalysis]: Checked inductivity of 5704 backedges. 3595 proven. 1663 refuted. 0 times theorem prover too weak. 446 trivial. 0 not checked. [2018-10-10 15:26:03,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:26:03,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-10 15:26:03,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-10 15:26:03,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-10 15:26:03,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2018-10-10 15:26:03,573 INFO L87 Difference]: Start difference. First operand 605 states and 611 transitions. Second operand 26 states. [2018-10-10 15:26:05,049 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-10 15:26:05,474 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-10 15:26:05,825 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 15:26:06,290 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-10 15:26:06,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:26:06,450 INFO L93 Difference]: Finished difference Result 662 states and 668 transitions. [2018-10-10 15:26:06,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-10 15:26:06,451 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 604 [2018-10-10 15:26:06,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:26:06,456 INFO L225 Difference]: With dead ends: 662 [2018-10-10 15:26:06,456 INFO L226 Difference]: Without dead ends: 662 [2018-10-10 15:26:06,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=554, Invalid=2308, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 15:26:06,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2018-10-10 15:26:06,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 634. [2018-10-10 15:26:06,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2018-10-10 15:26:06,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 640 transitions. [2018-10-10 15:26:06,466 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 640 transitions. Word has length 604 [2018-10-10 15:26:06,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:26:06,466 INFO L481 AbstractCegarLoop]: Abstraction has 634 states and 640 transitions. [2018-10-10 15:26:06,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-10 15:26:06,467 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 640 transitions. [2018-10-10 15:26:06,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2018-10-10 15:26:06,471 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:26:06,471 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:26:06,471 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:26:06,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:26:06,472 INFO L82 PathProgramCache]: Analyzing trace with hash 921423296, now seen corresponding path program 17 times [2018-10-10 15:26:06,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:26:06,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:26:08,255 INFO L134 CoverageAnalysis]: Checked inductivity of 6103 backedges. 75 proven. 5506 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2018-10-10 15:26:08,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:26:08,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-10 15:26:08,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-10 15:26:08,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-10 15:26:08,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2018-10-10 15:26:08,257 INFO L87 Difference]: Start difference. First operand 634 states and 640 transitions. Second operand 25 states. [2018-10-10 15:26:11,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:26:11,261 INFO L93 Difference]: Finished difference Result 753 states and 760 transitions. [2018-10-10 15:26:11,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-10-10 15:26:11,262 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 619 [2018-10-10 15:26:11,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:26:11,266 INFO L225 Difference]: With dead ends: 753 [2018-10-10 15:26:11,266 INFO L226 Difference]: Without dead ends: 753 [2018-10-10 15:26:11,270 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5669 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3182, Invalid=11338, Unknown=0, NotChecked=0, Total=14520 [2018-10-10 15:26:11,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2018-10-10 15:26:11,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 734. [2018-10-10 15:26:11,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-10-10 15:26:11,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 741 transitions. [2018-10-10 15:26:11,280 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 741 transitions. Word has length 619 [2018-10-10 15:26:11,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:26:11,280 INFO L481 AbstractCegarLoop]: Abstraction has 734 states and 741 transitions. [2018-10-10 15:26:11,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-10 15:26:11,281 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 741 transitions. [2018-10-10 15:26:11,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 720 [2018-10-10 15:26:11,286 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:26:11,286 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:26:11,287 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:26:11,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:26:11,287 INFO L82 PathProgramCache]: Analyzing trace with hash 318814633, now seen corresponding path program 18 times [2018-10-10 15:26:11,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:26:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:26:14,283 INFO L134 CoverageAnalysis]: Checked inductivity of 8540 backedges. 0 proven. 7834 refuted. 0 times theorem prover too weak. 706 trivial. 0 not checked. [2018-10-10 15:26:14,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:26:14,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-10 15:26:14,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-10 15:26:14,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-10 15:26:14,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2018-10-10 15:26:14,286 INFO L87 Difference]: Start difference. First operand 734 states and 741 transitions. Second operand 25 states. [2018-10-10 15:26:17,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:26:17,531 INFO L93 Difference]: Finished difference Result 853 states and 861 transitions. [2018-10-10 15:26:17,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-10 15:26:17,531 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 719 [2018-10-10 15:26:17,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:26:17,535 INFO L225 Difference]: With dead ends: 853 [2018-10-10 15:26:17,535 INFO L226 Difference]: Without dead ends: 853 [2018-10-10 15:26:17,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4904 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=2761, Invalid=10349, Unknown=0, NotChecked=0, Total=13110 [2018-10-10 15:26:17,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2018-10-10 15:26:17,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 834. [2018-10-10 15:26:17,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 834 states. [2018-10-10 15:26:17,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 842 transitions. [2018-10-10 15:26:17,549 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 842 transitions. Word has length 719 [2018-10-10 15:26:17,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:26:17,550 INFO L481 AbstractCegarLoop]: Abstraction has 834 states and 842 transitions. [2018-10-10 15:26:17,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-10 15:26:17,550 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 842 transitions. [2018-10-10 15:26:17,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2018-10-10 15:26:17,556 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:26:17,557 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:26:17,557 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:26:17,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:26:17,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1051450642, now seen corresponding path program 19 times [2018-10-10 15:26:17,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:26:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:26:18,576 INFO L134 CoverageAnalysis]: Checked inductivity of 11387 backedges. 6071 proven. 973 refuted. 0 times theorem prover too weak. 4343 trivial. 0 not checked. [2018-10-10 15:26:18,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:26:18,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-10 15:26:18,577 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 15:26:18,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 15:26:18,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2018-10-10 15:26:18,578 INFO L87 Difference]: Start difference. First operand 834 states and 842 transitions. Second operand 22 states. [2018-10-10 15:26:19,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:26:19,596 INFO L93 Difference]: Finished difference Result 864 states and 872 transitions. [2018-10-10 15:26:19,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-10 15:26:19,596 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 819 [2018-10-10 15:26:19,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:26:19,601 INFO L225 Difference]: With dead ends: 864 [2018-10-10 15:26:19,601 INFO L226 Difference]: Without dead ends: 864 [2018-10-10 15:26:19,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=477, Invalid=1973, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 15:26:19,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2018-10-10 15:26:19,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 864. [2018-10-10 15:26:19,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2018-10-10 15:26:19,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 872 transitions. [2018-10-10 15:26:19,612 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 872 transitions. Word has length 819 [2018-10-10 15:26:19,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:26:19,612 INFO L481 AbstractCegarLoop]: Abstraction has 864 states and 872 transitions. [2018-10-10 15:26:19,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 15:26:19,612 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 872 transitions. [2018-10-10 15:26:19,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 850 [2018-10-10 15:26:19,619 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:26:19,620 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:26:19,620 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:26:19,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:26:19,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1836060772, now seen corresponding path program 20 times [2018-10-10 15:26:19,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:26:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:26:21,468 INFO L134 CoverageAnalysis]: Checked inductivity of 12534 backedges. 8635 proven. 2682 refuted. 0 times theorem prover too weak. 1217 trivial. 0 not checked. [2018-10-10 15:26:21,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:26:21,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 15:26:21,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 15:26:21,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 15:26:21,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2018-10-10 15:26:21,470 INFO L87 Difference]: Start difference. First operand 864 states and 872 transitions. Second operand 30 states. [2018-10-10 15:26:23,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:26:23,140 INFO L93 Difference]: Finished difference Result 952 states and 960 transitions. [2018-10-10 15:26:23,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-10 15:26:23,143 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 849 [2018-10-10 15:26:23,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:26:23,146 INFO L225 Difference]: With dead ends: 952 [2018-10-10 15:26:23,147 INFO L226 Difference]: Without dead ends: 952 [2018-10-10 15:26:23,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=750, Invalid=3156, Unknown=0, NotChecked=0, Total=3906 [2018-10-10 15:26:23,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2018-10-10 15:26:23,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 909. [2018-10-10 15:26:23,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2018-10-10 15:26:23,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 918 transitions. [2018-10-10 15:26:23,159 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 918 transitions. Word has length 849 [2018-10-10 15:26:23,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:26:23,159 INFO L481 AbstractCegarLoop]: Abstraction has 909 states and 918 transitions. [2018-10-10 15:26:23,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 15:26:23,159 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 918 transitions. [2018-10-10 15:26:23,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 880 [2018-10-10 15:26:23,167 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:26:23,167 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:26:23,167 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:26:23,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:26:23,168 INFO L82 PathProgramCache]: Analyzing trace with hash 829120722, now seen corresponding path program 21 times [2018-10-10 15:26:23,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:26:23,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:26:24,296 INFO L134 CoverageAnalysis]: Checked inductivity of 13741 backedges. 9246 proven. 3140 refuted. 0 times theorem prover too weak. 1355 trivial. 0 not checked. [2018-10-10 15:26:24,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:26:24,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-10 15:26:24,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 15:26:24,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 15:26:24,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2018-10-10 15:26:24,297 INFO L87 Difference]: Start difference. First operand 909 states and 918 transitions. Second operand 32 states. [2018-10-10 15:26:25,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:26:25,613 INFO L93 Difference]: Finished difference Result 999 states and 1007 transitions. [2018-10-10 15:26:25,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-10 15:26:25,613 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 879 [2018-10-10 15:26:25,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:26:25,617 INFO L225 Difference]: With dead ends: 999 [2018-10-10 15:26:25,617 INFO L226 Difference]: Without dead ends: 999 [2018-10-10 15:26:25,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 974 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=876, Invalid=3680, Unknown=0, NotChecked=0, Total=4556 [2018-10-10 15:26:25,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2018-10-10 15:26:25,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 954. [2018-10-10 15:26:25,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 954 states. [2018-10-10 15:26:25,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 964 transitions. [2018-10-10 15:26:25,629 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 964 transitions. Word has length 879 [2018-10-10 15:26:25,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:26:25,630 INFO L481 AbstractCegarLoop]: Abstraction has 954 states and 964 transitions. [2018-10-10 15:26:25,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 15:26:25,630 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 964 transitions. [2018-10-10 15:26:25,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 910 [2018-10-10 15:26:25,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:26:25,638 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:26:25,638 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:26:25,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:26:25,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1289131420, now seen corresponding path program 22 times [2018-10-10 15:26:25,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:26:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:26:26,939 INFO L134 CoverageAnalysis]: Checked inductivity of 15008 backedges. 9887 proven. 3613 refuted. 0 times theorem prover too weak. 1508 trivial. 0 not checked. [2018-10-10 15:26:26,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:26:26,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-10 15:26:26,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-10 15:26:26,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-10 15:26:26,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 15:26:26,941 INFO L87 Difference]: Start difference. First operand 954 states and 964 transitions. Second operand 34 states. [2018-10-10 15:26:29,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:26:29,434 INFO L93 Difference]: Finished difference Result 1005 states and 1013 transitions. [2018-10-10 15:26:29,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-10 15:26:29,435 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 909 [2018-10-10 15:26:29,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:26:29,439 INFO L225 Difference]: With dead ends: 1005 [2018-10-10 15:26:29,439 INFO L226 Difference]: Without dead ends: 1005 [2018-10-10 15:26:29,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1355 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1206, Invalid=5114, Unknown=0, NotChecked=0, Total=6320 [2018-10-10 15:26:29,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2018-10-10 15:26:29,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 999. [2018-10-10 15:26:29,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 999 states. [2018-10-10 15:26:29,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1010 transitions. [2018-10-10 15:26:29,451 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1010 transitions. Word has length 909 [2018-10-10 15:26:29,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:26:29,452 INFO L481 AbstractCegarLoop]: Abstraction has 999 states and 1010 transitions. [2018-10-10 15:26:29,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-10 15:26:29,452 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1010 transitions. [2018-10-10 15:26:29,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 940 [2018-10-10 15:26:29,460 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:26:29,461 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:26:29,461 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:26:29,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:26:29,461 INFO L82 PathProgramCache]: Analyzing trace with hash -80888238, now seen corresponding path program 23 times [2018-10-10 15:26:29,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:26:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:26:31,457 INFO L134 CoverageAnalysis]: Checked inductivity of 16335 backedges. 0 proven. 14806 refuted. 0 times theorem prover too weak. 1529 trivial. 0 not checked. [2018-10-10 15:26:31,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:26:31,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-10 15:26:31,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-10 15:26:31,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-10 15:26:31,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2018-10-10 15:26:31,459 INFO L87 Difference]: Start difference. First operand 999 states and 1010 transitions. Second operand 27 states. [2018-10-10 15:26:34,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:26:34,520 INFO L93 Difference]: Finished difference Result 1163 states and 1175 transitions. [2018-10-10 15:26:34,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-10 15:26:34,521 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 939 [2018-10-10 15:26:34,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:26:34,526 INFO L225 Difference]: With dead ends: 1163 [2018-10-10 15:26:34,526 INFO L226 Difference]: Without dead ends: 1163 [2018-10-10 15:26:34,528 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6075 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3338, Invalid=12664, Unknown=0, NotChecked=0, Total=16002 [2018-10-10 15:26:34,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2018-10-10 15:26:34,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1144. [2018-10-10 15:26:34,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1144 states. [2018-10-10 15:26:34,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1156 transitions. [2018-10-10 15:26:34,541 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1156 transitions. Word has length 939 [2018-10-10 15:26:34,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:26:34,542 INFO L481 AbstractCegarLoop]: Abstraction has 1144 states and 1156 transitions. [2018-10-10 15:26:34,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-10 15:26:34,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1156 transitions. [2018-10-10 15:26:34,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1085 [2018-10-10 15:26:34,552 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:26:34,553 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:26:34,553 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:26:34,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:26:34,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1791416820, now seen corresponding path program 24 times [2018-10-10 15:26:34,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:26:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:26:35,878 INFO L134 CoverageAnalysis]: Checked inductivity of 22531 backedges. 0 proven. 20574 refuted. 0 times theorem prover too weak. 1957 trivial. 0 not checked. [2018-10-10 15:26:35,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:26:35,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-10 15:26:35,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-10 15:26:35,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-10 15:26:35,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=656, Unknown=0, NotChecked=0, Total=812 [2018-10-10 15:26:35,880 INFO L87 Difference]: Start difference. First operand 1144 states and 1156 transitions. Second operand 29 states. [2018-10-10 15:26:39,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:26:39,234 INFO L93 Difference]: Finished difference Result 1308 states and 1321 transitions. [2018-10-10 15:26:39,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-10-10 15:26:39,234 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 1084 [2018-10-10 15:26:39,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:26:39,240 INFO L225 Difference]: With dead ends: 1308 [2018-10-10 15:26:39,240 INFO L226 Difference]: Without dead ends: 1308 [2018-10-10 15:26:39,242 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7371 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3969, Invalid=15213, Unknown=0, NotChecked=0, Total=19182 [2018-10-10 15:26:39,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2018-10-10 15:26:39,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1289. [2018-10-10 15:26:39,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1289 states. [2018-10-10 15:26:39,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1302 transitions. [2018-10-10 15:26:39,256 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1302 transitions. Word has length 1084 [2018-10-10 15:26:39,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:26:39,257 INFO L481 AbstractCegarLoop]: Abstraction has 1289 states and 1302 transitions. [2018-10-10 15:26:39,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-10 15:26:39,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1302 transitions. [2018-10-10 15:26:39,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1230 [2018-10-10 15:26:39,269 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:26:39,270 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:26:39,270 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:26:39,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:26:39,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1296599442, now seen corresponding path program 25 times [2018-10-10 15:26:39,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:26:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:26:41,552 INFO L134 CoverageAnalysis]: Checked inductivity of 29728 backedges. 43 proven. 27297 refuted. 0 times theorem prover too weak. 2388 trivial. 0 not checked. [2018-10-10 15:26:41,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:26:41,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-10 15:26:41,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-10 15:26:41,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-10 15:26:41,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=746, Unknown=0, NotChecked=0, Total=930 [2018-10-10 15:26:41,555 INFO L87 Difference]: Start difference. First operand 1289 states and 1302 transitions. Second operand 31 states. [2018-10-10 15:26:44,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:26:44,954 INFO L93 Difference]: Finished difference Result 1453 states and 1467 transitions. [2018-10-10 15:26:44,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-10-10 15:26:44,956 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 1229 [2018-10-10 15:26:44,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:26:44,962 INFO L225 Difference]: With dead ends: 1453 [2018-10-10 15:26:44,962 INFO L226 Difference]: Without dead ends: 1453 [2018-10-10 15:26:44,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8564 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4929, Invalid=16827, Unknown=0, NotChecked=0, Total=21756 [2018-10-10 15:26:44,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2018-10-10 15:26:44,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1434. [2018-10-10 15:26:44,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2018-10-10 15:26:44,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1448 transitions. [2018-10-10 15:26:44,979 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1448 transitions. Word has length 1229 [2018-10-10 15:26:44,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:26:44,980 INFO L481 AbstractCegarLoop]: Abstraction has 1434 states and 1448 transitions. [2018-10-10 15:26:44,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-10 15:26:44,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1448 transitions. [2018-10-10 15:26:44,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1375 [2018-10-10 15:26:44,995 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:26:44,996 INFO L375 BasicCegarLoop]: trace histogram [70, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:26:44,996 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:26:44,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:26:44,997 INFO L82 PathProgramCache]: Analyzing trace with hash 781861580, now seen corresponding path program 26 times [2018-10-10 15:26:44,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:26:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:26:47,579 INFO L134 CoverageAnalysis]: Checked inductivity of 37926 backedges. 43 proven. 35067 refuted. 0 times theorem prover too weak. 2816 trivial. 0 not checked. [2018-10-10 15:26:47,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:26:47,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-10 15:26:47,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-10 15:26:47,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-10 15:26:47,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=845, Unknown=0, NotChecked=0, Total=1056 [2018-10-10 15:26:47,581 INFO L87 Difference]: Start difference. First operand 1434 states and 1448 transitions. Second operand 33 states. [2018-10-10 15:26:51,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:26:51,642 INFO L93 Difference]: Finished difference Result 1598 states and 1613 transitions. [2018-10-10 15:26:51,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-10-10 15:26:51,642 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 1374 [2018-10-10 15:26:51,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:26:51,648 INFO L225 Difference]: With dead ends: 1598 [2018-10-10 15:26:51,648 INFO L226 Difference]: Without dead ends: 1598 [2018-10-10 15:26:51,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10110 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5724, Invalid=19716, Unknown=0, NotChecked=0, Total=25440 [2018-10-10 15:26:51,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states. [2018-10-10 15:26:51,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1579. [2018-10-10 15:26:51,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2018-10-10 15:26:51,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 1594 transitions. [2018-10-10 15:26:51,666 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 1594 transitions. Word has length 1374 [2018-10-10 15:26:51,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:26:51,667 INFO L481 AbstractCegarLoop]: Abstraction has 1579 states and 1594 transitions. [2018-10-10 15:26:51,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-10 15:26:51,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 1594 transitions. [2018-10-10 15:26:51,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1520 [2018-10-10 15:26:51,685 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:26:51,685 INFO L375 BasicCegarLoop]: trace histogram [78, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:26:51,686 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:26:51,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:26:51,686 INFO L82 PathProgramCache]: Analyzing trace with hash -650607406, now seen corresponding path program 27 times [2018-10-10 15:26:51,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:26:51,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:26:53,610 INFO L134 CoverageAnalysis]: Checked inductivity of 47125 backedges. 23640 proven. 2184 refuted. 0 times theorem prover too weak. 21301 trivial. 0 not checked. [2018-10-10 15:26:53,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:26:53,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 15:26:53,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 15:26:53,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 15:26:53,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2018-10-10 15:26:53,611 INFO L87 Difference]: Start difference. First operand 1579 states and 1594 transitions. Second operand 28 states. [2018-10-10 15:26:55,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:26:55,034 INFO L93 Difference]: Finished difference Result 1611 states and 1624 transitions. [2018-10-10 15:26:55,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-10 15:26:55,034 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 1519 [2018-10-10 15:26:55,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:26:55,041 INFO L225 Difference]: With dead ends: 1611 [2018-10-10 15:26:55,041 INFO L226 Difference]: Without dead ends: 1611 [2018-10-10 15:26:55,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=663, Invalid=2759, Unknown=0, NotChecked=0, Total=3422 [2018-10-10 15:26:55,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2018-10-10 15:26:55,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1594. [2018-10-10 15:26:55,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1594 states. [2018-10-10 15:26:55,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 1609 transitions. [2018-10-10 15:26:55,057 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 1609 transitions. Word has length 1519 [2018-10-10 15:26:55,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:26:55,058 INFO L481 AbstractCegarLoop]: Abstraction has 1594 states and 1609 transitions. [2018-10-10 15:26:55,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 15:26:55,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 1609 transitions. [2018-10-10 15:26:55,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1535 [2018-10-10 15:26:55,076 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:26:55,076 INFO L375 BasicCegarLoop]: trace histogram [79, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:26:55,077 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:26:55,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:26:55,077 INFO L82 PathProgramCache]: Analyzing trace with hash -473198923, now seen corresponding path program 28 times [2018-10-10 15:26:55,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:26:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:26:57,516 INFO L134 CoverageAnalysis]: Checked inductivity of 48295 backedges. 0 proven. 44978 refuted. 0 times theorem prover too weak. 3317 trivial. 0 not checked. [2018-10-10 15:26:57,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:26:57,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-10 15:26:57,518 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-10 15:26:57,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-10 15:26:57,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=953, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 15:26:57,518 INFO L87 Difference]: Start difference. First operand 1594 states and 1609 transitions. Second operand 35 states. [2018-10-10 15:27:02,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:27:02,374 INFO L93 Difference]: Finished difference Result 1758 states and 1774 transitions. [2018-10-10 15:27:02,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-10-10 15:27:02,374 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 1534 [2018-10-10 15:27:02,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:27:02,381 INFO L225 Difference]: With dead ends: 1758 [2018-10-10 15:27:02,382 INFO L226 Difference]: Without dead ends: 1758 [2018-10-10 15:27:02,384 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12009 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6186, Invalid=24264, Unknown=0, NotChecked=0, Total=30450 [2018-10-10 15:27:02,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2018-10-10 15:27:02,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1739. [2018-10-10 15:27:02,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1739 states. [2018-10-10 15:27:02,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 1755 transitions. [2018-10-10 15:27:02,396 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 1755 transitions. Word has length 1534 [2018-10-10 15:27:02,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:27:02,397 INFO L481 AbstractCegarLoop]: Abstraction has 1739 states and 1755 transitions. [2018-10-10 15:27:02,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-10 15:27:02,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 1755 transitions. [2018-10-10 15:27:02,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1680 [2018-10-10 15:27:02,418 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:27:02,418 INFO L375 BasicCegarLoop]: trace histogram [87, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 86, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:27:02,419 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:27:02,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:27:02,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1358759927, now seen corresponding path program 29 times [2018-10-10 15:27:02,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:27:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:27:05,172 INFO L134 CoverageAnalysis]: Checked inductivity of 58616 backedges. 0 proven. 54871 refuted. 0 times theorem prover too weak. 3745 trivial. 0 not checked. [2018-10-10 15:27:05,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:27:05,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-10 15:27:05,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-10 15:27:05,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-10 15:27:05,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=1064, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 15:27:05,174 INFO L87 Difference]: Start difference. First operand 1739 states and 1755 transitions. Second operand 37 states. [2018-10-10 15:27:10,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:27:10,593 INFO L93 Difference]: Finished difference Result 1903 states and 1920 transitions. [2018-10-10 15:27:10,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-10-10 15:27:10,594 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 1679 [2018-10-10 15:27:10,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:27:10,602 INFO L225 Difference]: With dead ends: 1903 [2018-10-10 15:27:10,602 INFO L226 Difference]: Without dead ends: 1903 [2018-10-10 15:27:10,604 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13805 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7033, Invalid=27749, Unknown=0, NotChecked=0, Total=34782 [2018-10-10 15:27:10,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2018-10-10 15:27:10,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1884. [2018-10-10 15:27:10,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1884 states. [2018-10-10 15:27:10,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 1901 transitions. [2018-10-10 15:27:10,616 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 1901 transitions. Word has length 1679 [2018-10-10 15:27:10,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:27:10,617 INFO L481 AbstractCegarLoop]: Abstraction has 1884 states and 1901 transitions. [2018-10-10 15:27:10,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-10 15:27:10,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 1901 transitions. [2018-10-10 15:27:10,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1825 [2018-10-10 15:27:10,640 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:27:10,640 INFO L375 BasicCegarLoop]: trace histogram [95, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:27:10,641 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:27:10,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:27:10,642 INFO L82 PathProgramCache]: Analyzing trace with hash -880139979, now seen corresponding path program 30 times [2018-10-10 15:27:10,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:27:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:27:13,985 INFO L134 CoverageAnalysis]: Checked inductivity of 69938 backedges. 0 proven. 65765 refuted. 0 times theorem prover too weak. 4173 trivial. 0 not checked. [2018-10-10 15:27:13,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:27:13,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-10 15:27:13,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-10 15:27:13,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-10 15:27:13,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1181, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 15:27:13,987 INFO L87 Difference]: Start difference. First operand 1884 states and 1901 transitions. Second operand 39 states. [2018-10-10 15:27:19,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:27:19,762 INFO L93 Difference]: Finished difference Result 2048 states and 2066 transitions. [2018-10-10 15:27:19,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-10-10 15:27:19,762 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 1824 [2018-10-10 15:27:19,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:27:19,770 INFO L225 Difference]: With dead ends: 2048 [2018-10-10 15:27:19,770 INFO L226 Difference]: Without dead ends: 2048 [2018-10-10 15:27:19,773 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15726 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7934, Invalid=31468, Unknown=0, NotChecked=0, Total=39402 [2018-10-10 15:27:19,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2018-10-10 15:27:19,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 2029. [2018-10-10 15:27:19,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2029 states. [2018-10-10 15:27:19,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 2047 transitions. [2018-10-10 15:27:19,787 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 2047 transitions. Word has length 1824 [2018-10-10 15:27:19,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:27:19,788 INFO L481 AbstractCegarLoop]: Abstraction has 2029 states and 2047 transitions. [2018-10-10 15:27:19,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-10 15:27:19,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 2047 transitions. [2018-10-10 15:27:19,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1970 [2018-10-10 15:27:19,809 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:27:19,809 INFO L375 BasicCegarLoop]: trace histogram [103, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:27:19,810 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:27:19,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:27:19,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1301525897, now seen corresponding path program 31 times [2018-10-10 15:27:19,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:27:20,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:27:23,589 INFO L134 CoverageAnalysis]: Checked inductivity of 82261 backedges. 0 proven. 77660 refuted. 0 times theorem prover too weak. 4601 trivial. 0 not checked. [2018-10-10 15:27:23,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:27:23,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-10 15:27:23,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-10 15:27:23,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-10 15:27:23,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=1304, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 15:27:23,592 INFO L87 Difference]: Start difference. First operand 2029 states and 2047 transitions. Second operand 41 states. [2018-10-10 15:27:29,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:27:29,931 INFO L93 Difference]: Finished difference Result 2193 states and 2212 transitions. [2018-10-10 15:27:29,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2018-10-10 15:27:29,932 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 1969 [2018-10-10 15:27:29,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:27:29,940 INFO L225 Difference]: With dead ends: 2193 [2018-10-10 15:27:29,940 INFO L226 Difference]: Without dead ends: 2193 [2018-10-10 15:27:29,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17772 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8889, Invalid=35421, Unknown=0, NotChecked=0, Total=44310 [2018-10-10 15:27:29,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2193 states. [2018-10-10 15:27:29,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2193 to 2174. [2018-10-10 15:27:29,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2174 states. [2018-10-10 15:27:29,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 2174 states and 2193 transitions. [2018-10-10 15:27:29,957 INFO L78 Accepts]: Start accepts. Automaton has 2174 states and 2193 transitions. Word has length 1969 [2018-10-10 15:27:29,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:27:29,959 INFO L481 AbstractCegarLoop]: Abstraction has 2174 states and 2193 transitions. [2018-10-10 15:27:29,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-10 15:27:29,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 2193 transitions. [2018-10-10 15:27:29,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2115 [2018-10-10 15:27:29,982 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:27:29,983 INFO L375 BasicCegarLoop]: trace histogram [111, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 110, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:27:29,983 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:27:29,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:27:29,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1781797813, now seen corresponding path program 32 times [2018-10-10 15:27:29,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:27:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:27:33,458 INFO L134 CoverageAnalysis]: Checked inductivity of 95585 backedges. 0 proven. 90556 refuted. 0 times theorem prover too weak. 5029 trivial. 0 not checked. [2018-10-10 15:27:33,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:27:33,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-10 15:27:33,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-10 15:27:33,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-10 15:27:33,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=373, Invalid=1433, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 15:27:33,460 INFO L87 Difference]: Start difference. First operand 2174 states and 2193 transitions. Second operand 43 states. [2018-10-10 15:27:40,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:27:40,380 INFO L93 Difference]: Finished difference Result 2338 states and 2358 transitions. [2018-10-10 15:27:40,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-10-10 15:27:40,381 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 2114 [2018-10-10 15:27:40,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:27:40,390 INFO L225 Difference]: With dead ends: 2338 [2018-10-10 15:27:40,390 INFO L226 Difference]: Without dead ends: 2338 [2018-10-10 15:27:40,393 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19943 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=9898, Invalid=39608, Unknown=0, NotChecked=0, Total=49506 [2018-10-10 15:27:40,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2018-10-10 15:27:40,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 2319. [2018-10-10 15:27:40,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2319 states. [2018-10-10 15:27:40,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2319 states to 2319 states and 2339 transitions. [2018-10-10 15:27:40,409 INFO L78 Accepts]: Start accepts. Automaton has 2319 states and 2339 transitions. Word has length 2114 [2018-10-10 15:27:40,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:27:40,410 INFO L481 AbstractCegarLoop]: Abstraction has 2319 states and 2339 transitions. [2018-10-10 15:27:40,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-10 15:27:40,410 INFO L276 IsEmpty]: Start isEmpty. Operand 2319 states and 2339 transitions. [2018-10-10 15:27:40,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2260 [2018-10-10 15:27:40,435 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:27:40,436 INFO L375 BasicCegarLoop]: trace histogram [119, 118, 118, 118, 118, 118, 118, 118, 118, 118, 118, 118, 118, 118, 118, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:27:40,436 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:27:40,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:27:40,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1822092535, now seen corresponding path program 33 times [2018-10-10 15:27:40,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:27:40,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:27:44,717 INFO L134 CoverageAnalysis]: Checked inductivity of 109910 backedges. 0 proven. 104484 refuted. 0 times theorem prover too weak. 5426 trivial. 0 not checked. [2018-10-10 15:27:44,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:27:44,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-10 15:27:44,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-10 15:27:44,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-10 15:27:44,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=416, Invalid=1746, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 15:27:44,719 INFO L87 Difference]: Start difference. First operand 2319 states and 2339 transitions. Second operand 47 states. [2018-10-10 15:27:56,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:27:56,961 INFO L93 Difference]: Finished difference Result 2483 states and 2504 transitions. [2018-10-10 15:27:56,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 268 states. [2018-10-10 15:27:56,961 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 2259 [2018-10-10 15:27:56,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:27:56,972 INFO L225 Difference]: With dead ends: 2483 [2018-10-10 15:27:56,972 INFO L226 Difference]: Without dead ends: 2483 [2018-10-10 15:27:56,977 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 307 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41736 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=17163, Invalid=78009, Unknown=0, NotChecked=0, Total=95172 [2018-10-10 15:27:56,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2483 states. [2018-10-10 15:27:56,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2483 to 2464. [2018-10-10 15:27:56,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2464 states. [2018-10-10 15:27:56,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2464 states to 2464 states and 2485 transitions. [2018-10-10 15:27:56,998 INFO L78 Accepts]: Start accepts. Automaton has 2464 states and 2485 transitions. Word has length 2259 [2018-10-10 15:27:57,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:27:57,000 INFO L481 AbstractCegarLoop]: Abstraction has 2464 states and 2485 transitions. [2018-10-10 15:27:57,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-10 15:27:57,000 INFO L276 IsEmpty]: Start isEmpty. Operand 2464 states and 2485 transitions. [2018-10-10 15:27:57,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2405 [2018-10-10 15:27:57,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:27:57,032 INFO L375 BasicCegarLoop]: trace histogram [127, 126, 126, 126, 126, 126, 126, 126, 126, 126, 126, 126, 126, 126, 126, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:27:57,032 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:27:57,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:27:57,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1626433077, now seen corresponding path program 34 times [2018-10-10 15:27:57,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:27:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:28:01,744 INFO L134 CoverageAnalysis]: Checked inductivity of 125236 backedges. 75 proven. 119305 refuted. 0 times theorem prover too weak. 5856 trivial. 0 not checked. [2018-10-10 15:28:01,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:28:01,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-10 15:28:01,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-10 15:28:01,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-10 15:28:01,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=1887, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 15:28:01,746 INFO L87 Difference]: Start difference. First operand 2464 states and 2485 transitions. Second operand 49 states. [2018-10-10 15:28:12,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:28:12,014 INFO L93 Difference]: Finished difference Result 2628 states and 2650 transitions. [2018-10-10 15:28:12,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 256 states. [2018-10-10 15:28:12,014 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 2404 [2018-10-10 15:28:12,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:28:12,024 INFO L225 Difference]: With dead ends: 2628 [2018-10-10 15:28:12,024 INFO L226 Difference]: Without dead ends: 2628 [2018-10-10 15:28:12,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 299 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40193 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=18668, Invalid=71632, Unknown=0, NotChecked=0, Total=90300 [2018-10-10 15:28:12,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2628 states. [2018-10-10 15:28:12,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2628 to 2609. [2018-10-10 15:28:12,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2609 states. [2018-10-10 15:28:12,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2609 states to 2609 states and 2631 transitions. [2018-10-10 15:28:12,051 INFO L78 Accepts]: Start accepts. Automaton has 2609 states and 2631 transitions. Word has length 2404 [2018-10-10 15:28:12,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:28:12,052 INFO L481 AbstractCegarLoop]: Abstraction has 2609 states and 2631 transitions. [2018-10-10 15:28:12,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-10 15:28:12,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2609 states and 2631 transitions. [2018-10-10 15:28:12,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2550 [2018-10-10 15:28:12,087 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:28:12,088 INFO L375 BasicCegarLoop]: trace histogram [135, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:28:12,088 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:28:12,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:28:12,089 INFO L82 PathProgramCache]: Analyzing trace with hash -733015927, now seen corresponding path program 35 times [2018-10-10 15:28:12,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:28:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:28:16,806 INFO L134 CoverageAnalysis]: Checked inductivity of 141563 backedges. 106403 proven. 11060 refuted. 0 times theorem prover too weak. 24100 trivial. 0 not checked. [2018-10-10 15:28:16,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:28:16,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-10 15:28:16,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-10 15:28:16,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-10 15:28:16,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=1953, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 15:28:16,808 INFO L87 Difference]: Start difference. First operand 2609 states and 2631 transitions. Second operand 48 states. [2018-10-10 15:28:20,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:28:20,876 INFO L93 Difference]: Finished difference Result 2843 states and 2862 transitions. [2018-10-10 15:28:20,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-10 15:28:20,876 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 2549 [2018-10-10 15:28:20,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:28:20,883 INFO L225 Difference]: With dead ends: 2843 [2018-10-10 15:28:20,883 INFO L226 Difference]: Without dead ends: 2843 [2018-10-10 15:28:20,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2388 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1956, Invalid=8346, Unknown=0, NotChecked=0, Total=10302 [2018-10-10 15:28:20,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2843 states. [2018-10-10 15:28:20,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2843 to 2729. [2018-10-10 15:28:20,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2729 states. [2018-10-10 15:28:20,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2729 states to 2729 states and 2752 transitions. [2018-10-10 15:28:20,905 INFO L78 Accepts]: Start accepts. Automaton has 2729 states and 2752 transitions. Word has length 2549 [2018-10-10 15:28:20,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:28:20,906 INFO L481 AbstractCegarLoop]: Abstraction has 2729 states and 2752 transitions. [2018-10-10 15:28:20,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-10 15:28:20,907 INFO L276 IsEmpty]: Start isEmpty. Operand 2729 states and 2752 transitions. [2018-10-10 15:28:20,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2655 [2018-10-10 15:28:20,948 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:28:20,949 INFO L375 BasicCegarLoop]: trace histogram [142, 141, 141, 141, 141, 141, 141, 141, 141, 141, 141, 141, 141, 141, 141, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:28:20,949 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:28:20,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:28:20,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1429207380, now seen corresponding path program 36 times [2018-10-10 15:28:20,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:28:21,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:28:24,579 INFO L134 CoverageAnalysis]: Checked inductivity of 156102 backedges. 50741 proven. 2566 refuted. 0 times theorem prover too weak. 102795 trivial. 0 not checked. [2018-10-10 15:28:24,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:28:24,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 15:28:24,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 15:28:24,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 15:28:24,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2018-10-10 15:28:24,581 INFO L87 Difference]: Start difference. First operand 2729 states and 2752 transitions. Second operand 30 states. [2018-10-10 15:28:26,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:28:26,079 INFO L93 Difference]: Finished difference Result 2748 states and 2769 transitions. [2018-10-10 15:28:26,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-10 15:28:26,080 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 2654 [2018-10-10 15:28:26,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:28:26,084 INFO L225 Difference]: With dead ends: 2748 [2018-10-10 15:28:26,084 INFO L226 Difference]: Without dead ends: 2748 [2018-10-10 15:28:26,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1007 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=925, Invalid=3905, Unknown=0, NotChecked=0, Total=4830 [2018-10-10 15:28:26,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2748 states. [2018-10-10 15:28:26,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2748 to 2744. [2018-10-10 15:28:26,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2744 states. [2018-10-10 15:28:26,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2744 states to 2744 states and 2767 transitions. [2018-10-10 15:28:26,103 INFO L78 Accepts]: Start accepts. Automaton has 2744 states and 2767 transitions. Word has length 2654 [2018-10-10 15:28:26,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:28:26,104 INFO L481 AbstractCegarLoop]: Abstraction has 2744 states and 2767 transitions. [2018-10-10 15:28:26,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 15:28:26,104 INFO L276 IsEmpty]: Start isEmpty. Operand 2744 states and 2767 transitions. [2018-10-10 15:28:26,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2670 [2018-10-10 15:28:26,140 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:28:26,141 INFO L375 BasicCegarLoop]: trace histogram [143, 142, 142, 142, 142, 142, 142, 142, 142, 142, 142, 142, 142, 142, 142, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:28:26,141 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:28:26,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:28:26,142 INFO L82 PathProgramCache]: Analyzing trace with hash 280523025, now seen corresponding path program 37 times [2018-10-10 15:28:26,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:28:26,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:28:31,275 INFO L134 CoverageAnalysis]: Checked inductivity of 158239 backedges. 43 proven. 150942 refuted. 0 times theorem prover too weak. 7254 trivial. 0 not checked. [2018-10-10 15:28:31,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:28:31,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-10 15:28:31,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-10 15:28:31,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-10 15:28:31,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=1853, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 15:28:31,278 INFO L87 Difference]: Start difference. First operand 2744 states and 2767 transitions. Second operand 49 states. [2018-10-10 15:28:39,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:28:39,499 INFO L93 Difference]: Finished difference Result 2923 states and 2947 transitions. [2018-10-10 15:28:39,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 211 states. [2018-10-10 15:28:39,499 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 2669 [2018-10-10 15:28:39,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:28:39,505 INFO L225 Difference]: With dead ends: 2923 [2018-10-10 15:28:39,506 INFO L226 Difference]: Without dead ends: 2923 [2018-10-10 15:28:39,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27086 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=14208, Invalid=51072, Unknown=0, NotChecked=0, Total=65280 [2018-10-10 15:28:39,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2923 states. [2018-10-10 15:28:39,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2923 to 2904. [2018-10-10 15:28:39,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2904 states. [2018-10-10 15:28:39,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2904 states to 2904 states and 2928 transitions. [2018-10-10 15:28:39,533 INFO L78 Accepts]: Start accepts. Automaton has 2904 states and 2928 transitions. Word has length 2669 [2018-10-10 15:28:39,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:28:39,534 INFO L481 AbstractCegarLoop]: Abstraction has 2904 states and 2928 transitions. [2018-10-10 15:28:39,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-10 15:28:39,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2904 states and 2928 transitions. [2018-10-10 15:28:39,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2830 [2018-10-10 15:28:39,597 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:28:39,599 INFO L375 BasicCegarLoop]: trace histogram [152, 151, 151, 151, 151, 151, 151, 151, 151, 151, 151, 151, 151, 151, 151, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:28:39,599 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:28:39,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:28:39,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1448773562, now seen corresponding path program 38 times [2018-10-10 15:28:39,600 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:28:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:28:45,606 INFO L134 CoverageAnalysis]: Checked inductivity of 178808 backedges. 0 proven. 171008 refuted. 0 times theorem prover too weak. 7800 trivial. 0 not checked. [2018-10-10 15:28:45,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:28:45,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-10 15:28:45,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-10 15:28:45,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-10 15:28:45,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=541, Invalid=2009, Unknown=0, NotChecked=0, Total=2550 [2018-10-10 15:28:45,609 INFO L87 Difference]: Start difference. First operand 2904 states and 2928 transitions. Second operand 51 states. [2018-10-10 15:28:55,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:28:55,309 INFO L93 Difference]: Finished difference Result 3083 states and 3108 transitions. [2018-10-10 15:28:55,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 225 states. [2018-10-10 15:28:55,310 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 2829 [2018-10-10 15:28:55,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:28:55,317 INFO L225 Difference]: With dead ends: 3083 [2018-10-10 15:28:55,317 INFO L226 Difference]: Without dead ends: 3083 [2018-10-10 15:28:55,321 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29877 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=14474, Invalid=58696, Unknown=0, NotChecked=0, Total=73170 [2018-10-10 15:28:55,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3083 states. [2018-10-10 15:28:55,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3083 to 3064. [2018-10-10 15:28:55,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3064 states. [2018-10-10 15:28:55,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3064 states to 3064 states and 3089 transitions. [2018-10-10 15:28:55,344 INFO L78 Accepts]: Start accepts. Automaton has 3064 states and 3089 transitions. Word has length 2829 [2018-10-10 15:28:55,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:28:55,346 INFO L481 AbstractCegarLoop]: Abstraction has 3064 states and 3089 transitions. [2018-10-10 15:28:55,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-10 15:28:55,346 INFO L276 IsEmpty]: Start isEmpty. Operand 3064 states and 3089 transitions. [2018-10-10 15:28:55,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2990 [2018-10-10 15:28:55,406 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:28:55,408 INFO L375 BasicCegarLoop]: trace histogram [161, 160, 160, 160, 160, 160, 160, 160, 160, 160, 160, 160, 160, 160, 160, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:28:55,408 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:28:55,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:28:55,409 INFO L82 PathProgramCache]: Analyzing trace with hash -2055460253, now seen corresponding path program 39 times [2018-10-10 15:28:55,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:28:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:29:01,982 INFO L134 CoverageAnalysis]: Checked inductivity of 200635 backedges. 0 proven. 192286 refuted. 0 times theorem prover too weak. 8349 trivial. 0 not checked. [2018-10-10 15:29:01,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:29:01,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-10 15:29:01,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-10 15:29:01,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-10 15:29:01,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=588, Invalid=2168, Unknown=0, NotChecked=0, Total=2756 [2018-10-10 15:29:01,984 INFO L87 Difference]: Start difference. First operand 3064 states and 3089 transitions. Second operand 53 states. [2018-10-10 15:29:12,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:29:12,591 INFO L93 Difference]: Finished difference Result 3243 states and 3269 transitions. [2018-10-10 15:29:12,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 235 states. [2018-10-10 15:29:12,592 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 2989 [2018-10-10 15:29:12,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:29:12,599 INFO L225 Difference]: With dead ends: 3243 [2018-10-10 15:29:12,600 INFO L226 Difference]: Without dead ends: 3243 [2018-10-10 15:29:12,605 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32673 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=15753, Invalid=64053, Unknown=0, NotChecked=0, Total=79806 [2018-10-10 15:29:12,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3243 states. [2018-10-10 15:29:12,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3243 to 3224. [2018-10-10 15:29:12,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3224 states. [2018-10-10 15:29:12,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3224 states to 3224 states and 3250 transitions. [2018-10-10 15:29:12,630 INFO L78 Accepts]: Start accepts. Automaton has 3224 states and 3250 transitions. Word has length 2989 [2018-10-10 15:29:12,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:29:12,632 INFO L481 AbstractCegarLoop]: Abstraction has 3224 states and 3250 transitions. [2018-10-10 15:29:12,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-10 15:29:12,632 INFO L276 IsEmpty]: Start isEmpty. Operand 3224 states and 3250 transitions. [2018-10-10 15:29:12,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3150 [2018-10-10 15:29:12,697 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:29:12,699 INFO L375 BasicCegarLoop]: trace histogram [170, 169, 169, 169, 169, 169, 169, 169, 169, 169, 169, 169, 169, 169, 169, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:29:12,699 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:29:12,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:29:12,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1479366924, now seen corresponding path program 40 times [2018-10-10 15:29:12,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:29:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:29:20,343 INFO L134 CoverageAnalysis]: Checked inductivity of 223720 backedges. 43 proven. 214776 refuted. 0 times theorem prover too weak. 8901 trivial. 0 not checked. [2018-10-10 15:29:20,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:29:20,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-10 15:29:20,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-10 15:29:20,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-10 15:29:20,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=640, Invalid=2330, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 15:29:20,346 INFO L87 Difference]: Start difference. First operand 3224 states and 3250 transitions. Second operand 55 states. [2018-10-10 15:29:30,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:29:30,579 INFO L93 Difference]: Finished difference Result 3403 states and 3430 transitions. [2018-10-10 15:29:30,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 241 states. [2018-10-10 15:29:30,579 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 3149 [2018-10-10 15:29:30,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:29:30,585 INFO L225 Difference]: With dead ends: 3403 [2018-10-10 15:29:30,585 INFO L226 Difference]: Without dead ends: 3403 [2018-10-10 15:29:30,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 290 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35564 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=18363, Invalid=66609, Unknown=0, NotChecked=0, Total=84972 [2018-10-10 15:29:30,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3403 states. [2018-10-10 15:29:30,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3403 to 3384. [2018-10-10 15:29:30,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3384 states. [2018-10-10 15:29:30,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3384 states to 3384 states and 3411 transitions. [2018-10-10 15:29:30,614 INFO L78 Accepts]: Start accepts. Automaton has 3384 states and 3411 transitions. Word has length 3149 [2018-10-10 15:29:30,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:29:30,615 INFO L481 AbstractCegarLoop]: Abstraction has 3384 states and 3411 transitions. [2018-10-10 15:29:30,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-10 15:29:30,616 INFO L276 IsEmpty]: Start isEmpty. Operand 3384 states and 3411 transitions. [2018-10-10 15:29:30,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3310 [2018-10-10 15:29:30,687 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:29:30,689 INFO L375 BasicCegarLoop]: trace histogram [179, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 25, 25, 25, 25, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:29:30,689 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:29:30,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:29:30,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1216222133, now seen corresponding path program 41 times [2018-10-10 15:29:30,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:29:31,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:29:38,682 INFO L134 CoverageAnalysis]: Checked inductivity of 248063 backedges. 0 proven. 238647 refuted. 0 times theorem prover too weak. 9416 trivial. 0 not checked. [2018-10-10 15:29:38,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:29:38,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-10 15:29:38,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-10 15:29:38,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-10 15:29:38,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=692, Invalid=2730, Unknown=0, NotChecked=0, Total=3422 [2018-10-10 15:29:38,685 INFO L87 Difference]: Start difference. First operand 3384 states and 3411 transitions. Second operand 59 states. [2018-10-10 15:29:58,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:29:58,382 INFO L93 Difference]: Finished difference Result 3563 states and 3591 transitions. [2018-10-10 15:29:58,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 352 states. [2018-10-10 15:29:58,383 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 3309 [2018-10-10 15:29:58,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:29:58,388 INFO L225 Difference]: With dead ends: 3563 [2018-10-10 15:29:58,388 INFO L226 Difference]: Without dead ends: 3563 [2018-10-10 15:29:58,394 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 403 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73269 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=29268, Invalid=134352, Unknown=0, NotChecked=0, Total=163620 [2018-10-10 15:29:58,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3563 states. [2018-10-10 15:29:58,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3563 to 3544. [2018-10-10 15:29:58,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3544 states. [2018-10-10 15:29:58,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3544 states to 3544 states and 3572 transitions. [2018-10-10 15:29:58,418 INFO L78 Accepts]: Start accepts. Automaton has 3544 states and 3572 transitions. Word has length 3309 [2018-10-10 15:29:58,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:29:58,420 INFO L481 AbstractCegarLoop]: Abstraction has 3544 states and 3572 transitions. [2018-10-10 15:29:58,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-10 15:29:58,420 INFO L276 IsEmpty]: Start isEmpty. Operand 3544 states and 3572 transitions. [2018-10-10 15:29:58,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3470 [2018-10-10 15:29:58,508 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:29:58,510 INFO L375 BasicCegarLoop]: trace histogram [188, 187, 187, 187, 187, 187, 187, 187, 187, 187, 187, 187, 187, 187, 187, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:29:58,510 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:29:58,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:29:58,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1870767522, now seen corresponding path program 42 times [2018-10-10 15:29:58,512 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:29:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:30:07,575 INFO L134 CoverageAnalysis]: Checked inductivity of 273664 backedges. 0 proven. 263668 refuted. 0 times theorem prover too weak. 9996 trivial. 0 not checked. [2018-10-10 15:30:07,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:30:07,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-10 15:30:07,577 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-10 15:30:07,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-10 15:30:07,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=2681, Unknown=0, NotChecked=0, Total=3422 [2018-10-10 15:30:07,577 INFO L87 Difference]: Start difference. First operand 3544 states and 3572 transitions. Second operand 59 states. [2018-10-10 15:30:20,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:30:20,118 INFO L93 Difference]: Finished difference Result 3723 states and 3752 transitions. [2018-10-10 15:30:20,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 265 states. [2018-10-10 15:30:20,119 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 3469 [2018-10-10 15:30:20,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:30:20,123 INFO L225 Difference]: With dead ends: 3723 [2018-10-10 15:30:20,123 INFO L226 Difference]: Without dead ends: 3723 [2018-10-10 15:30:20,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 317 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41811 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=19914, Invalid=81528, Unknown=0, NotChecked=0, Total=101442 [2018-10-10 15:30:20,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2018-10-10 15:30:20,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3704. [2018-10-10 15:30:20,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3704 states. [2018-10-10 15:30:20,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3704 states to 3704 states and 3733 transitions. [2018-10-10 15:30:20,154 INFO L78 Accepts]: Start accepts. Automaton has 3704 states and 3733 transitions. Word has length 3469 [2018-10-10 15:30:20,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:30:20,156 INFO L481 AbstractCegarLoop]: Abstraction has 3704 states and 3733 transitions. [2018-10-10 15:30:20,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-10 15:30:20,156 INFO L276 IsEmpty]: Start isEmpty. Operand 3704 states and 3733 transitions. [2018-10-10 15:30:20,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3630 [2018-10-10 15:30:20,248 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:30:20,250 INFO L375 BasicCegarLoop]: trace histogram [197, 196, 196, 196, 196, 196, 196, 196, 196, 196, 196, 196, 196, 196, 196, 27, 27, 27, 27, 27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:30:20,250 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:30:20,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:30:20,251 INFO L82 PathProgramCache]: Analyzing trace with hash 708717831, now seen corresponding path program 43 times [2018-10-10 15:30:20,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:30:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:30:29,815 INFO L134 CoverageAnalysis]: Checked inductivity of 300523 backedges. 0 proven. 289978 refuted. 0 times theorem prover too weak. 10545 trivial. 0 not checked. [2018-10-10 15:30:29,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:30:29,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-10 15:30:29,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-10 15:30:29,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-10 15:30:29,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=796, Invalid=2864, Unknown=0, NotChecked=0, Total=3660 [2018-10-10 15:30:29,818 INFO L87 Difference]: Start difference. First operand 3704 states and 3733 transitions. Second operand 61 states. [2018-10-10 15:30:43,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:30:43,579 INFO L93 Difference]: Finished difference Result 3883 states and 3913 transitions. [2018-10-10 15:30:43,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 275 states. [2018-10-10 15:30:43,579 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 3629 [2018-10-10 15:30:43,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:30:43,585 INFO L225 Difference]: With dead ends: 3883 [2018-10-10 15:30:43,585 INFO L226 Difference]: Without dead ends: 3883 [2018-10-10 15:30:43,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 329 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45107 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=21409, Invalid=87821, Unknown=0, NotChecked=0, Total=109230 [2018-10-10 15:30:43,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3883 states. [2018-10-10 15:30:43,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3883 to 3864. [2018-10-10 15:30:43,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3864 states. [2018-10-10 15:30:43,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3864 states to 3864 states and 3894 transitions. [2018-10-10 15:30:43,611 INFO L78 Accepts]: Start accepts. Automaton has 3864 states and 3894 transitions. Word has length 3629 [2018-10-10 15:30:43,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:30:43,613 INFO L481 AbstractCegarLoop]: Abstraction has 3864 states and 3894 transitions. [2018-10-10 15:30:43,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-10 15:30:43,613 INFO L276 IsEmpty]: Start isEmpty. Operand 3864 states and 3894 transitions. [2018-10-10 15:30:43,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3790 [2018-10-10 15:30:43,682 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:30:43,683 INFO L375 BasicCegarLoop]: trace histogram [206, 205, 205, 205, 205, 205, 205, 205, 205, 205, 205, 205, 205, 205, 205, 28, 28, 28, 28, 28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:30:43,683 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:30:43,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:30:43,685 INFO L82 PathProgramCache]: Analyzing trace with hash -808612944, now seen corresponding path program 44 times [2018-10-10 15:30:43,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:30:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:30:54,098 INFO L134 CoverageAnalysis]: Checked inductivity of 328640 backedges. 0 proven. 317546 refuted. 0 times theorem prover too weak. 11094 trivial. 0 not checked. [2018-10-10 15:30:54,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:30:54,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-10 15:30:54,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-10 15:30:54,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-10 15:30:54,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=853, Invalid=3053, Unknown=0, NotChecked=0, Total=3906 [2018-10-10 15:30:54,101 INFO L87 Difference]: Start difference. First operand 3864 states and 3894 transitions. Second operand 63 states. [2018-10-10 15:31:08,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:31:08,360 INFO L93 Difference]: Finished difference Result 4043 states and 4074 transitions. [2018-10-10 15:31:08,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 285 states. [2018-10-10 15:31:08,361 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 3789 [2018-10-10 15:31:08,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:31:08,365 INFO L225 Difference]: With dead ends: 4043 [2018-10-10 15:31:08,365 INFO L226 Difference]: Without dead ends: 4043 [2018-10-10 15:31:08,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 341 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48528 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=22958, Invalid=94348, Unknown=0, NotChecked=0, Total=117306 [2018-10-10 15:31:08,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4043 states. [2018-10-10 15:31:08,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4043 to 4024. [2018-10-10 15:31:08,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4024 states. [2018-10-10 15:31:08,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4024 states to 4024 states and 4055 transitions. [2018-10-10 15:31:08,387 INFO L78 Accepts]: Start accepts. Automaton has 4024 states and 4055 transitions. Word has length 3789 [2018-10-10 15:31:08,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:31:08,389 INFO L481 AbstractCegarLoop]: Abstraction has 4024 states and 4055 transitions. [2018-10-10 15:31:08,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-10 15:31:08,389 INFO L276 IsEmpty]: Start isEmpty. Operand 4024 states and 4055 transitions. [2018-10-10 15:31:08,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3950 [2018-10-10 15:31:08,464 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:31:08,465 INFO L375 BasicCegarLoop]: trace histogram [215, 214, 214, 214, 214, 214, 214, 214, 214, 214, 214, 214, 214, 214, 214, 29, 29, 29, 29, 29, 29, 29, 29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:31:08,465 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:31:08,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:31:08,466 INFO L82 PathProgramCache]: Analyzing trace with hash -79923623, now seen corresponding path program 45 times [2018-10-10 15:31:08,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:31:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:31:20,034 INFO L134 CoverageAnalysis]: Checked inductivity of 358015 backedges. 0 proven. 346403 refuted. 0 times theorem prover too weak. 11612 trivial. 0 not checked. [2018-10-10 15:31:20,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:31:20,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-10 15:31:20,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-10 15:31:20,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-10 15:31:20,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=916, Invalid=3506, Unknown=0, NotChecked=0, Total=4422 [2018-10-10 15:31:20,037 INFO L87 Difference]: Start difference. First operand 4024 states and 4055 transitions. Second operand 67 states. [2018-10-10 15:31:44,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:31:44,561 INFO L93 Difference]: Finished difference Result 4203 states and 4235 transitions. [2018-10-10 15:31:44,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 408 states. [2018-10-10 15:31:44,561 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 3949 [2018-10-10 15:31:44,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:31:44,565 INFO L225 Difference]: With dead ends: 4203 [2018-10-10 15:31:44,565 INFO L226 Difference]: Without dead ends: 4203 [2018-10-10 15:31:44,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 467 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99191 ImplicationChecksByTransitivity, 23.6s TimeCoverageRelationStatistics Valid=39118, Invalid=180374, Unknown=0, NotChecked=0, Total=219492 [2018-10-10 15:31:44,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4203 states. [2018-10-10 15:31:44,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4203 to 4184. [2018-10-10 15:31:44,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4184 states. [2018-10-10 15:31:44,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4184 states to 4184 states and 4216 transitions. [2018-10-10 15:31:44,596 INFO L78 Accepts]: Start accepts. Automaton has 4184 states and 4216 transitions. Word has length 3949 [2018-10-10 15:31:44,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:31:44,598 INFO L481 AbstractCegarLoop]: Abstraction has 4184 states and 4216 transitions. [2018-10-10 15:31:44,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-10 15:31:44,598 INFO L276 IsEmpty]: Start isEmpty. Operand 4184 states and 4216 transitions. [2018-10-10 15:31:44,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4110 [2018-10-10 15:31:44,676 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:31:44,677 INFO L375 BasicCegarLoop]: trace histogram [224, 223, 223, 223, 223, 223, 223, 223, 223, 223, 223, 223, 223, 223, 223, 30, 30, 30, 30, 30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:31:44,677 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:31:44,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:31:44,678 INFO L82 PathProgramCache]: Analyzing trace with hash -426054398, now seen corresponding path program 46 times [2018-10-10 15:31:44,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:31:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:31:56,322 INFO L134 CoverageAnalysis]: Checked inductivity of 388648 backedges. 0 proven. 376456 refuted. 0 times theorem prover too weak. 12192 trivial. 0 not checked. [2018-10-10 15:31:56,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:31:56,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-10 15:31:56,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-10 15:31:56,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-10 15:31:56,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=973, Invalid=3449, Unknown=0, NotChecked=0, Total=4422 [2018-10-10 15:31:56,325 INFO L87 Difference]: Start difference. First operand 4184 states and 4216 transitions. Second operand 67 states. [2018-10-10 15:32:12,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:32:12,116 INFO L93 Difference]: Finished difference Result 4363 states and 4396 transitions. [2018-10-10 15:32:12,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 305 states. [2018-10-10 15:32:12,116 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 4109 [2018-10-10 15:32:12,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:32:12,121 INFO L225 Difference]: With dead ends: 4363 [2018-10-10 15:32:12,122 INFO L226 Difference]: Without dead ends: 4363 [2018-10-10 15:32:12,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 365 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55745 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=26218, Invalid=108104, Unknown=0, NotChecked=0, Total=134322 [2018-10-10 15:32:12,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4363 states. [2018-10-10 15:32:12,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4363 to 4344. [2018-10-10 15:32:12,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4344 states. [2018-10-10 15:32:12,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4344 states to 4344 states and 4377 transitions. [2018-10-10 15:32:12,148 INFO L78 Accepts]: Start accepts. Automaton has 4344 states and 4377 transitions. Word has length 4109 [2018-10-10 15:32:12,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:32:12,150 INFO L481 AbstractCegarLoop]: Abstraction has 4344 states and 4377 transitions. [2018-10-10 15:32:12,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-10 15:32:12,150 INFO L276 IsEmpty]: Start isEmpty. Operand 4344 states and 4377 transitions. [2018-10-10 15:32:12,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4270 [2018-10-10 15:32:12,233 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:32:12,234 INFO L375 BasicCegarLoop]: trace histogram [233, 232, 232, 232, 232, 232, 232, 232, 232, 232, 232, 232, 232, 232, 232, 31, 31, 31, 31, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:32:12,234 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:32:12,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:32:12,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1946619989, now seen corresponding path program 47 times [2018-10-10 15:32:12,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:32:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:32:25,164 INFO L134 CoverageAnalysis]: Checked inductivity of 420539 backedges. 43 proven. 407752 refuted. 0 times theorem prover too weak. 12744 trivial. 0 not checked. [2018-10-10 15:32:25,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:32:25,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-10 15:32:25,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-10 15:32:25,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-10 15:32:25,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1039, Invalid=3653, Unknown=0, NotChecked=0, Total=4692 [2018-10-10 15:32:25,166 INFO L87 Difference]: Start difference. First operand 4344 states and 4377 transitions. Second operand 69 states. [2018-10-10 15:32:40,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:32:40,821 INFO L93 Difference]: Finished difference Result 4523 states and 4557 transitions. [2018-10-10 15:32:40,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 311 states. [2018-10-10 15:32:40,821 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 4269 [2018-10-10 15:32:40,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:32:40,826 INFO L225 Difference]: With dead ends: 4523 [2018-10-10 15:32:40,826 INFO L226 Difference]: Without dead ends: 4523 [2018-10-10 15:32:40,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 374 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59826 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=30123, Invalid=110877, Unknown=0, NotChecked=0, Total=141000 [2018-10-10 15:32:40,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4523 states. [2018-10-10 15:32:40,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4523 to 4504. [2018-10-10 15:32:40,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4504 states. [2018-10-10 15:32:40,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4504 states to 4504 states and 4538 transitions. [2018-10-10 15:32:40,853 INFO L78 Accepts]: Start accepts. Automaton has 4504 states and 4538 transitions. Word has length 4269 [2018-10-10 15:32:40,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:32:40,855 INFO L481 AbstractCegarLoop]: Abstraction has 4504 states and 4538 transitions. [2018-10-10 15:32:40,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-10 15:32:40,855 INFO L276 IsEmpty]: Start isEmpty. Operand 4504 states and 4538 transitions. [2018-10-10 15:32:40,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4430 [2018-10-10 15:32:40,944 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:32:40,945 INFO L375 BasicCegarLoop]: trace histogram [242, 241, 241, 241, 241, 241, 241, 241, 241, 241, 241, 241, 241, 241, 241, 32, 32, 32, 32, 32, 32, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:32:40,945 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:32:40,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:32:40,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1520009644, now seen corresponding path program 48 times [2018-10-10 15:32:40,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:32:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:32:56,416 INFO L134 CoverageAnalysis]: Checked inductivity of 453688 backedges. 43 proven. 440352 refuted. 0 times theorem prover too weak. 13293 trivial. 0 not checked. [2018-10-10 15:32:56,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:32:56,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-10 15:32:56,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-10 15:32:56,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-10 15:32:56,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1104, Invalid=3866, Unknown=0, NotChecked=0, Total=4970 [2018-10-10 15:32:56,418 INFO L87 Difference]: Start difference. First operand 4504 states and 4538 transitions. Second operand 71 states. [2018-10-10 15:33:12,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:33:12,734 INFO L93 Difference]: Finished difference Result 4518 states and 4548 transitions. [2018-10-10 15:33:12,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 320 states. [2018-10-10 15:33:12,734 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 4429 [2018-10-10 15:33:12,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:33:12,738 INFO L225 Difference]: With dead ends: 4518 [2018-10-10 15:33:12,738 INFO L226 Difference]: Without dead ends: 0 [2018-10-10 15:33:12,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 386 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63804 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=32039, Invalid=118117, Unknown=0, NotChecked=0, Total=150156 [2018-10-10 15:33:12,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-10 15:33:12,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-10 15:33:12,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-10 15:33:12,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-10 15:33:12,746 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4429 [2018-10-10 15:33:12,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:33:12,746 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-10 15:33:12,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-10 15:33:12,747 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-10 15:33:12,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-10 15:33:12,752 INFO L202 PluginConnector]: Adding new model ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 03:33:12 BoogieIcfgContainer [2018-10-10 15:33:12,752 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 15:33:12,753 INFO L168 Benchmark]: Toolchain (without parser) took 458324.14 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -72.7 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-10-10 15:33:12,754 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 15:33:12,755 INFO L168 Benchmark]: Boogie Preprocessor took 74.96 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 15:33:12,755 INFO L168 Benchmark]: RCFGBuilder took 637.09 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-10 15:33:12,756 INFO L168 Benchmark]: TraceAbstraction took 457606.41 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -104.6 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-10-10 15:33:12,758 INFO L336 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 74.96 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 637.09 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 457606.41 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -104.6 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 138]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 70 locations, 1 error locations. SAFE Result, 457.5s OverallTime, 50 OverallIterations, 242 TraceHistogramMax, 276.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5634 SDtfs, 76806 SDslu, 95428 SDs, 0 SdLazy, 39511 SolverSat, 7288 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 34.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7636 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 7535 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833415 ImplicationChecksByTransitivity, 269.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4504occurred in iteration=49, 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.7s AutomataMinimizationTime, 50 MinimizatonAttempts, 1263 StatesRemovedByMinimization, 46 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 7.2s SatisfiabilityAnalysisTime, 56.4s InterpolantComputationTime, 77050 NumberOfCodeBlocks, 77050 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 77000 ConstructedInterpolants, 0 QuantifiedInterpolants, 609068050 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 50 InterpolantComputations, 1 PerfectInterpolantSequences, 547967/4663243 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-10_15-33-12-767.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_11.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-10_15-33-12-767.csv Received shutdown request...