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/20051113-1.c_false-valid-memtrack.i_29.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 15:10:53,071 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 15:10:53,073 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 15:10:53,089 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 15:10:53,090 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 15:10:53,091 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 15:10:53,092 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 15:10:53,095 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 15:10:53,098 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 15:10:53,099 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 15:10:53,102 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 15:10:53,102 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 15:10:53,103 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 15:10:53,104 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 15:10:53,113 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 15:10:53,114 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 15:10:53,118 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 15:10:53,120 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 15:10:53,122 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 15:10:53,127 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 15:10:53,129 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 15:10:53,131 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 15:10:53,136 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 15:10:53,137 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 15:10:53,137 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 15:10:53,141 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 15:10:53,143 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 15:10:53,143 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 15:10:53,146 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 15:10:53,148 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 15:10:53,148 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 15:10:53,150 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 15:10:53,150 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 15:10:53,150 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 15:10:53,151 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 15:10:53,152 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 15:10:53,154 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:10:53,171 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 15:10:53,171 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 15:10:53,172 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 15:10:53,172 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 15:10:53,172 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 15:10:53,173 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 15:10:53,173 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 15:10:53,174 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 15:10:53,174 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 15:10:53,174 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 15:10:53,174 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 15:10:53,174 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 15:10:53,175 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 15:10:53,176 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 15:10:53,176 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 15:10:53,228 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 15:10:53,241 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 15:10:53,245 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 15:10:53,246 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 15:10:53,246 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 15:10:53,247 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_29.bpl [2018-10-10 15:10:53,247 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_29.bpl' [2018-10-10 15:10:53,323 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 15:10:53,324 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-10 15:10:53,325 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 15:10:53,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 15:10:53,326 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 15:10:53,353 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:53" (1/1) ... [2018-10-10 15:10:53,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:53" (1/1) ... [2018-10-10 15:10:53,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:53" (1/1) ... [2018-10-10 15:10:53,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:53" (1/1) ... [2018-10-10 15:10:53,387 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:53" (1/1) ... [2018-10-10 15:10:53,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:53" (1/1) ... [2018-10-10 15:10:53,394 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:53" (1/1) ... [2018-10-10 15:10:53,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 15:10:53,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 15:10:53,402 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 15:10:53,402 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 15:10:53,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "20051113-1.c_false-valid-memtrack.i_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:53" (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:10:53,480 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 15:10:53,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 15:10:53,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 15:10:54,237 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 15:10:54,238 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_29.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:10:54 BoogieIcfgContainer [2018-10-10 15:10:54,238 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 15:10:54,239 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 15:10:54,239 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 15:10:54,243 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 15:10:54,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_29.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:53" (1/2) ... [2018-10-10 15:10:54,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e99e19c and model type 20051113-1.c_false-valid-memtrack.i_29.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 03:10:54, skipping insertion in model container [2018-10-10 15:10:54,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_29.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:10:54" (2/2) ... [2018-10-10 15:10:54,246 INFO L112 eAbstractionObserver]: Analyzing ICFG 20051113-1.c_false-valid-memtrack.i_29.bpl [2018-10-10 15:10:54,257 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 15:10:54,267 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 15:10:54,285 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 15:10:54,316 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 15:10:54,317 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 15:10:54,317 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 15:10:54,317 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 15:10:54,318 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 15:10:54,318 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 15:10:54,318 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 15:10:54,318 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 15:10:54,318 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 15:10:54,341 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states. [2018-10-10 15:10:54,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-10 15:10:54,356 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:54,357 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:54,358 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:54,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:54,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1960034820, now seen corresponding path program 1 times [2018-10-10 15:10:54,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:54,808 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:10:54,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:10:54,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 15:10:54,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 15:10:54,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 15:10:54,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 15:10:54,838 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 4 states. [2018-10-10 15:10:54,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:54,961 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-10-10 15:10:54,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-10 15:10:54,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2018-10-10 15:10:54,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:54,976 INFO L225 Difference]: With dead ends: 122 [2018-10-10 15:10:54,977 INFO L226 Difference]: Without dead ends: 122 [2018-10-10 15:10:54,979 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 15:10:54,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-10-10 15:10:55,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2018-10-10 15:10:55,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-10-10 15:10:55,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-10-10 15:10:55,028 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 116 [2018-10-10 15:10:55,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:55,029 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-10-10 15:10:55,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 15:10:55,029 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-10-10 15:10:55,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-10 15:10:55,034 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:55,035 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:55,035 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:55,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:55,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1547448674, now seen corresponding path program 1 times [2018-10-10 15:10:55,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:55,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:10:55,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:55,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-10 15:10:55,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 15:10:55,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 15:10:55,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-10 15:10:55,221 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 5 states. [2018-10-10 15:10:55,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:55,391 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-10-10 15:10:55,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 15:10:55,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2018-10-10 15:10:55,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:55,394 INFO L225 Difference]: With dead ends: 125 [2018-10-10 15:10:55,394 INFO L226 Difference]: Without dead ends: 125 [2018-10-10 15:10:55,398 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-10 15:10:55,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-10 15:10:55,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-10-10 15:10:55,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-10 15:10:55,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-10-10 15:10:55,417 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 119 [2018-10-10 15:10:55,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:55,417 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-10-10 15:10:55,417 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 15:10:55,418 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-10-10 15:10:55,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-10 15:10:55,420 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:55,421 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:55,421 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:55,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:55,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1904992956, now seen corresponding path program 2 times [2018-10-10 15:10:55,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:55,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:55,713 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:10:55,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:55,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-10 15:10:55,715 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 15:10:55,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 15:10:55,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-10 15:10:55,716 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 6 states. [2018-10-10 15:10:55,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:55,860 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-10-10 15:10:55,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 15:10:55,862 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2018-10-10 15:10:55,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:55,864 INFO L225 Difference]: With dead ends: 128 [2018-10-10 15:10:55,864 INFO L226 Difference]: Without dead ends: 128 [2018-10-10 15:10:55,865 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:10:55,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-10 15:10:55,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-10-10 15:10:55,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-10 15:10:55,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-10-10 15:10:55,885 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 122 [2018-10-10 15:10:55,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:55,886 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-10-10 15:10:55,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 15:10:55,886 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-10-10 15:10:55,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-10 15:10:55,888 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:55,888 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:55,889 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:55,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:55,889 INFO L82 PathProgramCache]: Analyzing trace with hash 2011754974, now seen corresponding path program 3 times [2018-10-10 15:10:55,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:56,088 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:10:56,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:56,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-10 15:10:56,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 15:10:56,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 15:10:56,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-10 15:10:56,091 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 7 states. [2018-10-10 15:10:56,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:56,538 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-10-10 15:10:56,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 15:10:56,539 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 125 [2018-10-10 15:10:56,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:56,541 INFO L225 Difference]: With dead ends: 131 [2018-10-10 15:10:56,541 INFO L226 Difference]: Without dead ends: 131 [2018-10-10 15:10:56,541 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:10:56,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-10-10 15:10:56,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2018-10-10 15:10:56,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-10 15:10:56,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-10-10 15:10:56,550 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 125 [2018-10-10 15:10:56,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:56,551 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-10-10 15:10:56,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 15:10:56,551 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-10-10 15:10:56,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-10 15:10:56,553 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:56,553 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:56,554 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:56,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:56,554 INFO L82 PathProgramCache]: Analyzing trace with hash -11733124, now seen corresponding path program 4 times [2018-10-10 15:10:56,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:57,003 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:10:57,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:57,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 15:10:57,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 15:10:57,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 15:10:57,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:10:57,005 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 8 states. [2018-10-10 15:10:57,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:57,509 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-10-10 15:10:57,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 15:10:57,509 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 128 [2018-10-10 15:10:57,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:57,511 INFO L225 Difference]: With dead ends: 134 [2018-10-10 15:10:57,511 INFO L226 Difference]: Without dead ends: 134 [2018-10-10 15:10:57,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:10:57,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-10 15:10:57,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2018-10-10 15:10:57,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-10 15:10:57,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-10-10 15:10:57,520 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 128 [2018-10-10 15:10:57,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:57,520 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-10-10 15:10:57,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 15:10:57,521 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-10-10 15:10:57,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-10 15:10:57,523 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:57,523 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:57,523 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:57,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:57,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1879661282, now seen corresponding path program 5 times [2018-10-10 15:10:57,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:57,840 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:10:57,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:57,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-10 15:10:57,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 15:10:57,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 15:10:57,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-10 15:10:57,843 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 9 states. [2018-10-10 15:10:58,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:58,057 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-10-10 15:10:58,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 15:10:58,062 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2018-10-10 15:10:58,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:58,065 INFO L225 Difference]: With dead ends: 137 [2018-10-10 15:10:58,066 INFO L226 Difference]: Without dead ends: 137 [2018-10-10 15:10:58,067 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:10:58,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-10 15:10:58,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2018-10-10 15:10:58,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-10 15:10:58,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-10-10 15:10:58,079 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 131 [2018-10-10 15:10:58,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:58,079 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-10-10 15:10:58,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 15:10:58,080 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-10-10 15:10:58,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-10 15:10:58,082 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:58,084 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:58,085 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:58,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:58,085 INFO L82 PathProgramCache]: Analyzing trace with hash 563838012, now seen corresponding path program 6 times [2018-10-10 15:10:58,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:58,370 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:10:58,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:58,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 15:10:58,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 15:10:58,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 15:10:58,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:10:58,371 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 10 states. [2018-10-10 15:10:58,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:58,569 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-10-10 15:10:58,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 15:10:58,569 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 134 [2018-10-10 15:10:58,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:58,571 INFO L225 Difference]: With dead ends: 140 [2018-10-10 15:10:58,571 INFO L226 Difference]: Without dead ends: 140 [2018-10-10 15:10:58,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-10-10 15:10:58,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-10-10 15:10:58,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2018-10-10 15:10:58,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-10-10 15:10:58,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-10-10 15:10:58,577 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 134 [2018-10-10 15:10:58,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:58,578 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-10-10 15:10:58,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 15:10:58,578 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-10-10 15:10:58,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-10 15:10:58,580 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:58,580 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:58,580 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:58,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:58,581 INFO L82 PathProgramCache]: Analyzing trace with hash -549394338, now seen corresponding path program 7 times [2018-10-10 15:10:58,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:58,898 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:10:58,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:58,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-10 15:10:58,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 15:10:58,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 15:10:58,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-10-10 15:10:58,900 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 11 states. [2018-10-10 15:10:59,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:59,260 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-10-10 15:10:59,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 15:10:59,263 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 137 [2018-10-10 15:10:59,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:59,264 INFO L225 Difference]: With dead ends: 143 [2018-10-10 15:10:59,265 INFO L226 Difference]: Without dead ends: 143 [2018-10-10 15:10:59,265 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:10:59,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-10-10 15:10:59,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-10-10 15:10:59,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-10 15:10:59,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-10-10 15:10:59,271 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 137 [2018-10-10 15:10:59,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:59,271 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-10-10 15:10:59,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 15:10:59,271 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-10-10 15:10:59,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-10 15:10:59,276 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:59,276 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:59,277 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:59,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:59,277 INFO L82 PathProgramCache]: Analyzing trace with hash 883126524, now seen corresponding path program 8 times [2018-10-10 15:10:59,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:59,684 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:10:59,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:59,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 15:10:59,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 15:10:59,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 15:10:59,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:10:59,686 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 12 states. [2018-10-10 15:11:00,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:00,021 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-10-10 15:11:00,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 15:11:00,024 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 140 [2018-10-10 15:11:00,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:00,025 INFO L225 Difference]: With dead ends: 146 [2018-10-10 15:11:00,026 INFO L226 Difference]: Without dead ends: 146 [2018-10-10 15:11:00,026 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-10-10 15:11:00,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-10 15:11:00,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-10-10 15:11:00,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-10-10 15:11:00,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-10-10 15:11:00,031 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 140 [2018-10-10 15:11:00,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:00,031 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-10-10 15:11:00,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 15:11:00,032 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-10-10 15:11:00,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-10 15:11:00,050 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:00,051 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:00,051 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:00,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:00,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1977893986, now seen corresponding path program 9 times [2018-10-10 15:11:00,055 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:00,291 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:00,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:00,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-10 15:11:00,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 15:11:00,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 15:11:00,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-10-10 15:11:00,293 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 13 states. [2018-10-10 15:11:00,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:00,487 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-10-10 15:11:00,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 15:11:00,494 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 143 [2018-10-10 15:11:00,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:00,495 INFO L225 Difference]: With dead ends: 149 [2018-10-10 15:11:00,495 INFO L226 Difference]: Without dead ends: 149 [2018-10-10 15:11:00,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-10 15:11:00,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-10 15:11:00,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2018-10-10 15:11:00,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-10 15:11:00,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-10-10 15:11:00,499 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 143 [2018-10-10 15:11:00,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:00,499 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-10-10 15:11:00,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 15:11:00,500 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-10-10 15:11:00,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-10 15:11:00,500 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:00,501 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:00,501 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:00,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:00,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1013918276, now seen corresponding path program 10 times [2018-10-10 15:11:00,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:01,334 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:01,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:01,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-10 15:11:01,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 15:11:01,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 15:11:01,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:11:01,336 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 14 states. [2018-10-10 15:11:01,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:01,578 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-10-10 15:11:01,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 15:11:01,579 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 146 [2018-10-10 15:11:01,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:01,580 INFO L225 Difference]: With dead ends: 152 [2018-10-10 15:11:01,580 INFO L226 Difference]: Without dead ends: 152 [2018-10-10 15:11:01,580 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-10-10 15:11:01,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-10-10 15:11:01,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-10-10 15:11:01,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-10-10 15:11:01,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-10-10 15:11:01,584 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 146 [2018-10-10 15:11:01,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:01,584 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-10-10 15:11:01,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 15:11:01,585 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-10-10 15:11:01,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-10 15:11:01,585 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:01,586 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:01,586 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:01,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:01,586 INFO L82 PathProgramCache]: Analyzing trace with hash 635117278, now seen corresponding path program 11 times [2018-10-10 15:11:01,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:01,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:02,874 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:02,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:02,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-10 15:11:02,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 15:11:02,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 15:11:02,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-10-10 15:11:02,876 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 15 states. [2018-10-10 15:11:03,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:03,505 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-10-10 15:11:03,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 15:11:03,506 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 149 [2018-10-10 15:11:03,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:03,506 INFO L225 Difference]: With dead ends: 155 [2018-10-10 15:11:03,507 INFO L226 Difference]: Without dead ends: 155 [2018-10-10 15:11:03,507 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-10-10 15:11:03,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-10-10 15:11:03,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2018-10-10 15:11:03,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-10-10 15:11:03,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-10-10 15:11:03,511 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 149 [2018-10-10 15:11:03,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:03,511 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-10-10 15:11:03,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 15:11:03,511 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-10-10 15:11:03,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-10 15:11:03,512 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:03,512 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:03,513 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:03,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:03,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1217374844, now seen corresponding path program 12 times [2018-10-10 15:11:03,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:03,968 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:03,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:03,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-10 15:11:03,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 15:11:03,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 15:11:03,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=132, Unknown=0, NotChecked=0, Total=240 [2018-10-10 15:11:03,970 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 16 states. [2018-10-10 15:11:04,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:04,262 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-10-10 15:11:04,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 15:11:04,269 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 152 [2018-10-10 15:11:04,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:04,270 INFO L225 Difference]: With dead ends: 158 [2018-10-10 15:11:04,270 INFO L226 Difference]: Without dead ends: 158 [2018-10-10 15:11:04,271 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-10-10 15:11:04,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-10 15:11:04,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2018-10-10 15:11:04,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-10 15:11:04,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-10-10 15:11:04,275 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 152 [2018-10-10 15:11:04,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:04,275 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-10-10 15:11:04,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 15:11:04,276 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-10-10 15:11:04,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-10 15:11:04,276 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:04,277 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:04,277 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:04,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:04,277 INFO L82 PathProgramCache]: Analyzing trace with hash -120384994, now seen corresponding path program 13 times [2018-10-10 15:11:04,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:04,644 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:04,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:04,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-10 15:11:04,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 15:11:04,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 15:11:04,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=149, Unknown=0, NotChecked=0, Total=272 [2018-10-10 15:11:04,646 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 17 states. [2018-10-10 15:11:04,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:04,996 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-10-10 15:11:05,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 15:11:05,002 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 155 [2018-10-10 15:11:05,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:05,003 INFO L225 Difference]: With dead ends: 161 [2018-10-10 15:11:05,003 INFO L226 Difference]: Without dead ends: 161 [2018-10-10 15:11:05,004 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-10-10 15:11:05,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-10-10 15:11:05,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2018-10-10 15:11:05,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-10-10 15:11:05,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-10-10 15:11:05,007 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 155 [2018-10-10 15:11:05,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:05,007 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-10-10 15:11:05,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 15:11:05,008 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-10-10 15:11:05,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-10 15:11:05,008 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:05,009 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:05,009 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:05,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:05,009 INFO L82 PathProgramCache]: Analyzing trace with hash -322179268, now seen corresponding path program 14 times [2018-10-10 15:11:05,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:05,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:05,290 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:05,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:05,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-10 15:11:05,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-10 15:11:05,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-10 15:11:05,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:11:05,292 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 18 states. [2018-10-10 15:11:05,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:05,803 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-10-10 15:11:05,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 15:11:05,803 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 158 [2018-10-10 15:11:05,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:05,804 INFO L225 Difference]: With dead ends: 164 [2018-10-10 15:11:05,804 INFO L226 Difference]: Without dead ends: 164 [2018-10-10 15:11:05,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-10-10 15:11:05,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-10-10 15:11:05,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2018-10-10 15:11:05,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-10 15:11:05,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-10-10 15:11:05,809 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 158 [2018-10-10 15:11:05,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:05,810 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-10-10 15:11:05,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-10 15:11:05,810 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-10-10 15:11:05,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-10 15:11:05,811 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:05,811 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:05,812 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:05,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:05,812 INFO L82 PathProgramCache]: Analyzing trace with hash 978818398, now seen corresponding path program 15 times [2018-10-10 15:11:05,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:05,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:06,134 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:06,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:06,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-10 15:11:06,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 15:11:06,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 15:11:06,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=186, Unknown=0, NotChecked=0, Total=342 [2018-10-10 15:11:06,136 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 19 states. [2018-10-10 15:11:06,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:06,476 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-10-10 15:11:06,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 15:11:06,476 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 161 [2018-10-10 15:11:06,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:06,477 INFO L225 Difference]: With dead ends: 167 [2018-10-10 15:11:06,477 INFO L226 Difference]: Without dead ends: 167 [2018-10-10 15:11:06,478 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 15:11:06,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-10 15:11:06,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-10-10 15:11:06,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-10 15:11:06,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-10-10 15:11:06,481 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 161 [2018-10-10 15:11:06,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:06,482 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-10-10 15:11:06,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 15:11:06,482 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-10-10 15:11:06,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-10 15:11:06,483 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:06,483 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:06,484 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:06,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:06,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1215407100, now seen corresponding path program 16 times [2018-10-10 15:11:06,485 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:07,217 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:07,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:07,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-10 15:11:07,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 15:11:07,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 15:11:07,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=206, Unknown=0, NotChecked=0, Total=380 [2018-10-10 15:11:07,219 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 20 states. [2018-10-10 15:11:07,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:07,574 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-10-10 15:11:07,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-10 15:11:07,574 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 164 [2018-10-10 15:11:07,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:07,575 INFO L225 Difference]: With dead ends: 170 [2018-10-10 15:11:07,575 INFO L226 Difference]: Without dead ends: 170 [2018-10-10 15:11:07,576 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 15:11:07,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-10 15:11:07,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2018-10-10 15:11:07,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-10-10 15:11:07,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-10-10 15:11:07,580 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 164 [2018-10-10 15:11:07,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:07,580 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-10-10 15:11:07,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 15:11:07,580 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-10-10 15:11:07,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-10 15:11:07,581 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:07,582 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:07,582 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:07,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:07,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1388095646, now seen corresponding path program 17 times [2018-10-10 15:11:07,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:07,913 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:07,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:07,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-10 15:11:07,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 15:11:07,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 15:11:07,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=227, Unknown=0, NotChecked=0, Total=420 [2018-10-10 15:11:07,915 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 21 states. [2018-10-10 15:11:08,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:08,347 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-10-10 15:11:08,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 15:11:08,347 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 167 [2018-10-10 15:11:08,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:08,348 INFO L225 Difference]: With dead ends: 173 [2018-10-10 15:11:08,348 INFO L226 Difference]: Without dead ends: 173 [2018-10-10 15:11:08,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 15:11:08,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-10-10 15:11:08,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2018-10-10 15:11:08,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-10 15:11:08,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-10-10 15:11:08,352 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 167 [2018-10-10 15:11:08,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:08,352 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-10-10 15:11:08,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 15:11:08,352 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-10-10 15:11:08,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-10 15:11:08,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:08,353 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:08,354 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:08,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:08,354 INFO L82 PathProgramCache]: Analyzing trace with hash 581748924, now seen corresponding path program 18 times [2018-10-10 15:11:08,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:08,675 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:08,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:08,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-10 15:11:08,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 15:11:08,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 15:11:08,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=249, Unknown=0, NotChecked=0, Total=462 [2018-10-10 15:11:08,677 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 22 states. [2018-10-10 15:11:09,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:09,384 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-10-10 15:11:09,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-10 15:11:09,384 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 170 [2018-10-10 15:11:09,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:09,385 INFO L225 Difference]: With dead ends: 176 [2018-10-10 15:11:09,386 INFO L226 Difference]: Without dead ends: 176 [2018-10-10 15:11:09,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 15:11:09,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-10-10 15:11:09,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2018-10-10 15:11:09,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-10-10 15:11:09,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-10-10 15:11:09,390 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 170 [2018-10-10 15:11:09,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:09,391 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-10-10 15:11:09,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 15:11:09,391 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-10-10 15:11:09,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-10 15:11:09,392 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:09,392 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:09,392 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:09,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:09,393 INFO L82 PathProgramCache]: Analyzing trace with hash 458640350, now seen corresponding path program 19 times [2018-10-10 15:11:09,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:10,090 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:10,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:10,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-10 15:11:10,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 15:11:10,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 15:11:10,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=272, Unknown=0, NotChecked=0, Total=506 [2018-10-10 15:11:10,092 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 23 states. [2018-10-10 15:11:11,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:11,390 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-10-10 15:11:11,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-10 15:11:11,390 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 173 [2018-10-10 15:11:11,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:11,391 INFO L225 Difference]: With dead ends: 179 [2018-10-10 15:11:11,391 INFO L226 Difference]: Without dead ends: 179 [2018-10-10 15:11:11,392 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 15:11:11,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-10 15:11:11,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2018-10-10 15:11:11,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-10 15:11:11,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-10-10 15:11:11,396 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 173 [2018-10-10 15:11:11,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:11,396 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-10-10 15:11:11,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 15:11:11,396 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-10-10 15:11:11,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-10 15:11:11,397 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:11,397 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:11,398 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:11,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:11,398 INFO L82 PathProgramCache]: Analyzing trace with hash 833183100, now seen corresponding path program 20 times [2018-10-10 15:11:11,399 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:12,511 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:12,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:12,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 15:11:12,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 15:11:12,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 15:11:12,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=296, Unknown=0, NotChecked=0, Total=552 [2018-10-10 15:11:12,512 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 24 states. [2018-10-10 15:11:13,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:13,065 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2018-10-10 15:11:13,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 15:11:13,065 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 176 [2018-10-10 15:11:13,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:13,066 INFO L225 Difference]: With dead ends: 182 [2018-10-10 15:11:13,066 INFO L226 Difference]: Without dead ends: 182 [2018-10-10 15:11:13,067 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 15:11:13,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-10 15:11:13,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2018-10-10 15:11:13,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-10 15:11:13,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-10-10 15:11:13,070 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 176 [2018-10-10 15:11:13,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:13,070 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-10-10 15:11:13,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 15:11:13,070 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-10-10 15:11:13,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-10 15:11:13,071 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:13,071 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:13,071 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:13,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:13,072 INFO L82 PathProgramCache]: Analyzing trace with hash 511213342, now seen corresponding path program 21 times [2018-10-10 15:11:13,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:14,508 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:14,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:14,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-10 15:11:14,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-10 15:11:14,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-10 15:11:14,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=321, Unknown=0, NotChecked=0, Total=600 [2018-10-10 15:11:14,509 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 25 states. [2018-10-10 15:11:14,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:14,960 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-10-10 15:11:14,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 15:11:14,969 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 179 [2018-10-10 15:11:14,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:14,970 INFO L225 Difference]: With dead ends: 185 [2018-10-10 15:11:14,970 INFO L226 Difference]: Without dead ends: 185 [2018-10-10 15:11:14,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 15:11:14,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-10-10 15:11:14,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2018-10-10 15:11:14,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-10 15:11:14,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-10-10 15:11:14,974 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 179 [2018-10-10 15:11:14,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:14,975 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-10-10 15:11:14,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-10 15:11:14,975 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-10-10 15:11:14,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-10 15:11:14,976 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:14,976 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:14,976 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:14,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:14,977 INFO L82 PathProgramCache]: Analyzing trace with hash -627875268, now seen corresponding path program 22 times [2018-10-10 15:11:14,978 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:15,412 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:15,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:15,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-10 15:11:15,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-10 15:11:15,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-10 15:11:15,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=347, Unknown=0, NotChecked=0, Total=650 [2018-10-10 15:11:15,414 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 26 states. [2018-10-10 15:11:16,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:16,056 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-10-10 15:11:16,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-10 15:11:16,056 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 182 [2018-10-10 15:11:16,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:16,057 INFO L225 Difference]: With dead ends: 188 [2018-10-10 15:11:16,057 INFO L226 Difference]: Without dead ends: 188 [2018-10-10 15:11:16,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 15:11:16,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-10 15:11:16,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2018-10-10 15:11:16,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-10 15:11:16,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-10-10 15:11:16,060 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 182 [2018-10-10 15:11:16,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:16,061 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-10-10 15:11:16,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-10 15:11:16,061 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-10-10 15:11:16,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-10 15:11:16,062 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:16,062 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:16,062 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:16,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:16,062 INFO L82 PathProgramCache]: Analyzing trace with hash -680050082, now seen corresponding path program 23 times [2018-10-10 15:11:16,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:17,180 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:17,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:17,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-10 15:11:17,180 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-10 15:11:17,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-10 15:11:17,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=374, Unknown=0, NotChecked=0, Total=702 [2018-10-10 15:11:17,181 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 27 states. [2018-10-10 15:11:17,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:17,820 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-10-10 15:11:17,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-10 15:11:17,822 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 185 [2018-10-10 15:11:17,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:17,823 INFO L225 Difference]: With dead ends: 191 [2018-10-10 15:11:17,823 INFO L226 Difference]: Without dead ends: 191 [2018-10-10 15:11:17,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 15:11:17,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-10-10 15:11:17,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2018-10-10 15:11:17,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-10-10 15:11:17,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-10-10 15:11:17,828 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 185 [2018-10-10 15:11:17,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:17,828 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-10-10 15:11:17,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-10 15:11:17,829 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-10-10 15:11:17,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-10 15:11:17,829 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:17,830 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:17,830 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:17,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:17,830 INFO L82 PathProgramCache]: Analyzing trace with hash -241772804, now seen corresponding path program 24 times [2018-10-10 15:11:17,831 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:18,397 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:18,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:18,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 15:11:18,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 15:11:18,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 15:11:18,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=402, Unknown=0, NotChecked=0, Total=756 [2018-10-10 15:11:18,398 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 28 states. [2018-10-10 15:11:19,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:19,032 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2018-10-10 15:11:19,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-10 15:11:19,034 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 188 [2018-10-10 15:11:19,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:19,035 INFO L225 Difference]: With dead ends: 194 [2018-10-10 15:11:19,035 INFO L226 Difference]: Without dead ends: 194 [2018-10-10 15:11:19,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 15:11:19,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-10-10 15:11:19,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2018-10-10 15:11:19,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-10-10 15:11:19,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-10-10 15:11:19,039 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 188 [2018-10-10 15:11:19,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:19,039 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-10-10 15:11:19,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 15:11:19,039 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-10-10 15:11:19,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-10 15:11:19,040 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:19,041 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:19,041 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:19,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:19,041 INFO L82 PathProgramCache]: Analyzing trace with hash -223963746, now seen corresponding path program 25 times [2018-10-10 15:11:19,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:19,637 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:19,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:19,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-10 15:11:19,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-10 15:11:19,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-10 15:11:19,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=431, Unknown=0, NotChecked=0, Total=812 [2018-10-10 15:11:19,638 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 29 states. [2018-10-10 15:11:20,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:20,347 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-10-10 15:11:20,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-10 15:11:20,347 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 191 [2018-10-10 15:11:20,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:20,348 INFO L225 Difference]: With dead ends: 197 [2018-10-10 15:11:20,348 INFO L226 Difference]: Without dead ends: 197 [2018-10-10 15:11:20,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 15:11:20,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-10 15:11:20,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2018-10-10 15:11:20,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-10-10 15:11:20,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-10-10 15:11:20,352 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 191 [2018-10-10 15:11:20,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:20,352 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-10-10 15:11:20,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-10 15:11:20,352 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-10-10 15:11:20,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-10 15:11:20,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:20,354 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:20,354 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:20,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:20,354 INFO L82 PathProgramCache]: Analyzing trace with hash 2044705724, now seen corresponding path program 26 times [2018-10-10 15:11:20,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:22,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:22,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:22,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 15:11:22,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 15:11:22,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 15:11:22,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=461, Unknown=0, NotChecked=0, Total=870 [2018-10-10 15:11:22,047 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 30 states. [2018-10-10 15:11:22,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:22,713 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2018-10-10 15:11:22,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-10 15:11:22,713 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 194 [2018-10-10 15:11:22,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:22,715 INFO L225 Difference]: With dead ends: 200 [2018-10-10 15:11:22,715 INFO L226 Difference]: Without dead ends: 200 [2018-10-10 15:11:22,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-10-10 15:11:22,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-10-10 15:11:22,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2018-10-10 15:11:22,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-10-10 15:11:22,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-10-10 15:11:22,719 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 194 [2018-10-10 15:11:22,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:22,719 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-10-10 15:11:22,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 15:11:22,719 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-10-10 15:11:22,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-10 15:11:22,720 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:22,720 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:22,721 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:22,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:22,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1923450658, now seen corresponding path program 27 times [2018-10-10 15:11:22,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:23,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:23,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:23,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-10 15:11:23,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-10 15:11:23,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-10 15:11:23,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=492, Unknown=0, NotChecked=0, Total=930 [2018-10-10 15:11:23,370 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 31 states. [2018-10-10 15:11:24,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:24,111 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-10-10 15:11:24,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 15:11:24,111 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 197 [2018-10-10 15:11:24,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:24,112 INFO L225 Difference]: With dead ends: 203 [2018-10-10 15:11:24,113 INFO L226 Difference]: Without dead ends: 203 [2018-10-10 15:11:24,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-10-10 15:11:24,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-10-10 15:11:24,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2018-10-10 15:11:24,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-10 15:11:24,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-10-10 15:11:24,117 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 197 [2018-10-10 15:11:24,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:24,117 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-10-10 15:11:24,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-10 15:11:24,118 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-10-10 15:11:24,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-10 15:11:24,119 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:24,119 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:24,119 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:24,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:24,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1704595580, now seen corresponding path program 28 times [2018-10-10 15:11:24,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:25,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:25,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:25,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-10 15:11:25,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 15:11:25,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 15:11:25,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=524, Unknown=0, NotChecked=0, Total=992 [2018-10-10 15:11:25,024 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 32 states. [2018-10-10 15:11:25,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:25,954 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2018-10-10 15:11:25,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-10 15:11:25,954 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 200 [2018-10-10 15:11:25,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:25,955 INFO L225 Difference]: With dead ends: 206 [2018-10-10 15:11:25,955 INFO L226 Difference]: Without dead ends: 206 [2018-10-10 15:11:25,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 15:11:25,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-10-10 15:11:25,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2018-10-10 15:11:25,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-10-10 15:11:25,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2018-10-10 15:11:25,961 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 200 [2018-10-10 15:11:25,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:25,961 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2018-10-10 15:11:25,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 15:11:25,961 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2018-10-10 15:11:25,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-10 15:11:25,962 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:25,962 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:25,962 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:25,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:25,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1978067998, now seen corresponding path program 29 times [2018-10-10 15:11:25,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:26,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:26,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:26,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-10 15:11:26,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-10 15:11:26,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-10 15:11:26,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=557, Unknown=0, NotChecked=0, Total=1056 [2018-10-10 15:11:26,626 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 33 states. [2018-10-10 15:11:27,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:27,479 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-10-10 15:11:27,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-10 15:11:27,480 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 203 [2018-10-10 15:11:27,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:27,481 INFO L225 Difference]: With dead ends: 209 [2018-10-10 15:11:27,481 INFO L226 Difference]: Without dead ends: 209 [2018-10-10 15:11:27,482 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 15:11:27,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-10 15:11:27,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2018-10-10 15:11:27,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-10 15:11:27,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-10-10 15:11:27,486 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 203 [2018-10-10 15:11:27,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:27,486 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-10-10 15:11:27,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-10 15:11:27,486 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-10-10 15:11:27,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-10 15:11:27,487 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:27,487 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:27,488 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:27,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:27,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1441912124, now seen corresponding path program 30 times [2018-10-10 15:11:27,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:27,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:28,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:28,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:28,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-10 15:11:28,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-10 15:11:28,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-10 15:11:28,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=591, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 15:11:28,360 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 34 states. [2018-10-10 15:11:29,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:29,221 INFO L93 Difference]: Finished difference Result 212 states and 212 transitions. [2018-10-10 15:11:29,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-10 15:11:29,221 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 206 [2018-10-10 15:11:29,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:29,222 INFO L225 Difference]: With dead ends: 212 [2018-10-10 15:11:29,222 INFO L226 Difference]: Without dead ends: 212 [2018-10-10 15:11:29,224 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 15:11:29,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-10-10 15:11:29,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2018-10-10 15:11:29,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-10-10 15:11:29,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2018-10-10 15:11:29,227 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 206 [2018-10-10 15:11:29,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:29,228 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2018-10-10 15:11:29,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-10 15:11:29,228 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2018-10-10 15:11:29,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-10-10 15:11:29,229 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:29,229 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:29,229 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:29,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:29,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1805643614, now seen corresponding path program 31 times [2018-10-10 15:11:29,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:30,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:30,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:30,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-10 15:11:30,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-10 15:11:30,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-10 15:11:30,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=626, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 15:11:30,107 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 35 states. [2018-10-10 15:11:30,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:30,957 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-10-10 15:11:30,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-10 15:11:30,957 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 209 [2018-10-10 15:11:30,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:30,959 INFO L225 Difference]: With dead ends: 215 [2018-10-10 15:11:30,959 INFO L226 Difference]: Without dead ends: 215 [2018-10-10 15:11:30,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-10-10 15:11:30,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-10 15:11:30,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-10-10 15:11:30,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-10 15:11:30,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-10-10 15:11:30,963 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 209 [2018-10-10 15:11:30,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:30,963 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-10-10 15:11:30,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-10 15:11:30,963 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-10-10 15:11:30,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-10 15:11:30,964 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:30,965 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:30,965 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:30,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:30,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1527974396, now seen corresponding path program 32 times [2018-10-10 15:11:30,966 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:30,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:31,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:31,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:31,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-10 15:11:31,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 15:11:31,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 15:11:31,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=662, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 15:11:31,752 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 36 states. [2018-10-10 15:11:32,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:32,720 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2018-10-10 15:11:32,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-10 15:11:32,721 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 212 [2018-10-10 15:11:32,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:32,722 INFO L225 Difference]: With dead ends: 218 [2018-10-10 15:11:32,722 INFO L226 Difference]: Without dead ends: 218 [2018-10-10 15:11:32,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-10-10 15:11:32,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-10 15:11:32,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 216. [2018-10-10 15:11:32,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-10-10 15:11:32,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-10-10 15:11:32,726 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 212 [2018-10-10 15:11:32,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:32,727 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-10-10 15:11:32,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 15:11:32,727 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-10-10 15:11:32,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-10 15:11:32,728 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:32,728 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:32,729 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:32,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:32,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1591313054, now seen corresponding path program 33 times [2018-10-10 15:11:32,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:33,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 0 proven. 1617 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:33,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:33,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-10 15:11:33,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-10 15:11:33,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-10 15:11:33,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=633, Invalid=699, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 15:11:33,539 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 37 states. [2018-10-10 15:11:34,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:34,904 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-10-10 15:11:34,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-10 15:11:34,905 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 215 [2018-10-10 15:11:34,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:34,906 INFO L225 Difference]: With dead ends: 221 [2018-10-10 15:11:34,906 INFO L226 Difference]: Without dead ends: 221 [2018-10-10 15:11:34,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-10-10 15:11:34,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-10-10 15:11:34,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 219. [2018-10-10 15:11:34,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-10 15:11:34,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-10-10 15:11:34,910 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 215 [2018-10-10 15:11:34,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:34,910 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-10-10 15:11:34,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-10 15:11:34,910 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-10-10 15:11:34,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-10 15:11:34,911 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:34,911 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:34,912 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:34,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:34,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1272336708, now seen corresponding path program 34 times [2018-10-10 15:11:34,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:34,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:35,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:35,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:35,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-10 15:11:35,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-10 15:11:35,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-10 15:11:35,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=737, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 15:11:35,619 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 38 states. [2018-10-10 15:11:36,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:36,784 INFO L93 Difference]: Finished difference Result 224 states and 224 transitions. [2018-10-10 15:11:36,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-10 15:11:36,784 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 218 [2018-10-10 15:11:36,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:36,785 INFO L225 Difference]: With dead ends: 224 [2018-10-10 15:11:36,785 INFO L226 Difference]: Without dead ends: 224 [2018-10-10 15:11:36,786 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-10-10 15:11:36,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-10-10 15:11:36,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2018-10-10 15:11:36,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-10 15:11:36,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2018-10-10 15:11:36,789 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 218 [2018-10-10 15:11:36,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:36,790 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2018-10-10 15:11:36,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-10 15:11:36,790 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2018-10-10 15:11:36,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-10 15:11:36,791 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:36,791 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:36,791 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:36,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:36,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1326996002, now seen corresponding path program 35 times [2018-10-10 15:11:36,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:36,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:37,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:37,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:37,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-10 15:11:37,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-10 15:11:37,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-10 15:11:37,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=706, Invalid=776, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 15:11:37,586 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 39 states. [2018-10-10 15:11:38,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:38,775 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-10-10 15:11:38,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-10 15:11:38,776 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 221 [2018-10-10 15:11:38,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:38,777 INFO L225 Difference]: With dead ends: 227 [2018-10-10 15:11:38,777 INFO L226 Difference]: Without dead ends: 227 [2018-10-10 15:11:38,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-10-10 15:11:38,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-10-10 15:11:38,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2018-10-10 15:11:38,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-10-10 15:11:38,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-10-10 15:11:38,781 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 221 [2018-10-10 15:11:38,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:38,781 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-10-10 15:11:38,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-10 15:11:38,781 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-10-10 15:11:38,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-10 15:11:38,782 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:38,782 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:38,783 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:38,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:38,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1889418372, now seen corresponding path program 36 times [2018-10-10 15:11:38,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:38,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:40,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:40,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:40,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-10 15:11:40,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-10 15:11:40,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-10 15:11:40,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=744, Invalid=816, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 15:11:40,095 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 40 states. [2018-10-10 15:11:42,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:42,487 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2018-10-10 15:11:42,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-10 15:11:42,487 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 224 [2018-10-10 15:11:42,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:42,488 INFO L225 Difference]: With dead ends: 230 [2018-10-10 15:11:42,488 INFO L226 Difference]: Without dead ends: 230 [2018-10-10 15:11:42,489 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-10-10 15:11:42,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-10-10 15:11:42,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2018-10-10 15:11:42,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-10-10 15:11:42,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 228 transitions. [2018-10-10 15:11:42,492 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 228 transitions. Word has length 224 [2018-10-10 15:11:42,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:42,493 INFO L481 AbstractCegarLoop]: Abstraction has 228 states and 228 transitions. [2018-10-10 15:11:42,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-10 15:11:42,493 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 228 transitions. [2018-10-10 15:11:42,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-10-10 15:11:42,494 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:42,494 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:42,494 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:42,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:42,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1948145950, now seen corresponding path program 37 times [2018-10-10 15:11:42,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:43,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:43,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:43,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-10 15:11:43,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-10 15:11:43,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-10 15:11:43,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=857, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 15:11:43,352 INFO L87 Difference]: Start difference. First operand 228 states and 228 transitions. Second operand 41 states. [2018-10-10 15:11:44,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:44,531 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-10-10 15:11:44,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-10 15:11:44,532 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 227 [2018-10-10 15:11:44,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:44,533 INFO L225 Difference]: With dead ends: 233 [2018-10-10 15:11:44,533 INFO L226 Difference]: Without dead ends: 233 [2018-10-10 15:11:44,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-10-10 15:11:44,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-10-10 15:11:44,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2018-10-10 15:11:44,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-10 15:11:44,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-10-10 15:11:44,537 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 227 [2018-10-10 15:11:44,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:44,537 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-10-10 15:11:44,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-10 15:11:44,537 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-10-10 15:11:44,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-10 15:11:44,539 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:44,539 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:44,539 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:44,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:44,539 INFO L82 PathProgramCache]: Analyzing trace with hash -907589572, now seen corresponding path program 38 times [2018-10-10 15:11:44,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:45,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:45,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:45,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-10 15:11:45,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-10 15:11:45,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-10 15:11:45,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=823, Invalid=899, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 15:11:45,669 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 42 states. [2018-10-10 15:11:46,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:46,900 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2018-10-10 15:11:46,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-10 15:11:46,901 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 230 [2018-10-10 15:11:46,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:46,902 INFO L225 Difference]: With dead ends: 236 [2018-10-10 15:11:46,902 INFO L226 Difference]: Without dead ends: 236 [2018-10-10 15:11:46,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-10-10 15:11:46,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-10-10 15:11:46,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2018-10-10 15:11:46,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-10-10 15:11:46,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 234 transitions. [2018-10-10 15:11:46,906 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 234 transitions. Word has length 230 [2018-10-10 15:11:46,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:46,907 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 234 transitions. [2018-10-10 15:11:46,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-10 15:11:46,907 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 234 transitions. [2018-10-10 15:11:46,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-10 15:11:46,908 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:46,908 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:46,908 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:46,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:46,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1412326306, now seen corresponding path program 39 times [2018-10-10 15:11:46,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:47,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:47,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:47,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-10 15:11:47,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-10 15:11:47,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-10 15:11:47,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=864, Invalid=942, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 15:11:47,799 INFO L87 Difference]: Start difference. First operand 234 states and 234 transitions. Second operand 43 states. [2018-10-10 15:11:49,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:49,359 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-10-10 15:11:49,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-10 15:11:49,365 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 233 [2018-10-10 15:11:49,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:49,366 INFO L225 Difference]: With dead ends: 239 [2018-10-10 15:11:49,366 INFO L226 Difference]: Without dead ends: 239 [2018-10-10 15:11:49,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-10-10 15:11:49,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-10 15:11:49,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 237. [2018-10-10 15:11:49,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-10 15:11:49,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-10-10 15:11:49,371 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 233 [2018-10-10 15:11:49,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:49,371 INFO L481 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-10-10 15:11:49,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-10 15:11:49,371 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-10-10 15:11:49,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-10 15:11:49,372 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:49,373 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:49,373 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:49,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:49,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1343865604, now seen corresponding path program 40 times [2018-10-10 15:11:49,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:50,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:50,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:50,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-10 15:11:50,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-10 15:11:50,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-10 15:11:50,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=906, Invalid=986, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 15:11:50,590 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 44 states. [2018-10-10 15:11:51,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:51,884 INFO L93 Difference]: Finished difference Result 242 states and 242 transitions. [2018-10-10 15:11:51,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-10 15:11:51,884 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 236 [2018-10-10 15:11:51,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:51,885 INFO L225 Difference]: With dead ends: 242 [2018-10-10 15:11:51,885 INFO L226 Difference]: Without dead ends: 242 [2018-10-10 15:11:51,886 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-10-10 15:11:51,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-10-10 15:11:51,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2018-10-10 15:11:51,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-10 15:11:51,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 240 transitions. [2018-10-10 15:11:51,888 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 240 transitions. Word has length 236 [2018-10-10 15:11:51,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:51,888 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 240 transitions. [2018-10-10 15:11:51,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-10 15:11:51,889 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 240 transitions. [2018-10-10 15:11:51,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-10-10 15:11:51,890 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:51,890 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:51,890 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:51,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:51,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1940557922, now seen corresponding path program 41 times [2018-10-10 15:11:51,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:52,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 0 proven. 2501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:52,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:52,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-10 15:11:52,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-10 15:11:52,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-10 15:11:52,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=1031, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 15:11:52,898 INFO L87 Difference]: Start difference. First operand 240 states and 240 transitions. Second operand 45 states. [2018-10-10 15:11:54,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:54,452 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-10-10 15:11:54,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-10 15:11:54,452 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 239 [2018-10-10 15:11:54,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:54,453 INFO L225 Difference]: With dead ends: 245 [2018-10-10 15:11:54,453 INFO L226 Difference]: Without dead ends: 245 [2018-10-10 15:11:54,454 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-10-10 15:11:54,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-10 15:11:54,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2018-10-10 15:11:54,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-10 15:11:54,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-10-10 15:11:54,457 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 239 [2018-10-10 15:11:54,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:54,458 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-10-10 15:11:54,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-10 15:11:54,458 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-10-10 15:11:54,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-10 15:11:54,459 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:54,459 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:54,459 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:54,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:54,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1131765316, now seen corresponding path program 42 times [2018-10-10 15:11:54,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:55,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 0 proven. 2625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:55,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:55,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-10 15:11:55,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-10 15:11:55,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-10 15:11:55,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=993, Invalid=1077, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 15:11:55,682 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 46 states. [2018-10-10 15:11:57,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:57,121 INFO L93 Difference]: Finished difference Result 248 states and 248 transitions. [2018-10-10 15:11:57,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-10 15:11:57,122 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 242 [2018-10-10 15:11:57,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:57,123 INFO L225 Difference]: With dead ends: 248 [2018-10-10 15:11:57,123 INFO L226 Difference]: Without dead ends: 248 [2018-10-10 15:11:57,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-10-10 15:11:57,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-10-10 15:11:57,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 246. [2018-10-10 15:11:57,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-10-10 15:11:57,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2018-10-10 15:11:57,127 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 242 [2018-10-10 15:11:57,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:57,127 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2018-10-10 15:11:57,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-10 15:11:57,128 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2018-10-10 15:11:57,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-10-10 15:11:57,129 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:57,129 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:57,129 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:57,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:57,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1157770530, now seen corresponding path program 43 times [2018-10-10 15:11:57,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:57,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:58,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 2752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:11:58,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:58,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-10 15:11:58,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-10 15:11:58,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-10 15:11:58,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1038, Invalid=1124, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 15:11:58,224 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 47 states. [2018-10-10 15:11:59,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:59,799 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-10-10 15:11:59,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-10 15:11:59,800 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 245 [2018-10-10 15:11:59,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:59,801 INFO L225 Difference]: With dead ends: 251 [2018-10-10 15:11:59,801 INFO L226 Difference]: Without dead ends: 251 [2018-10-10 15:11:59,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-10-10 15:11:59,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-10-10 15:11:59,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2018-10-10 15:11:59,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-10 15:11:59,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-10-10 15:11:59,804 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 245 [2018-10-10 15:11:59,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:59,804 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-10-10 15:11:59,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-10 15:11:59,804 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-10-10 15:11:59,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-10 15:11:59,805 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:59,805 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:59,805 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:59,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:59,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1509979772, now seen corresponding path program 44 times [2018-10-10 15:11:59,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:01,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:01,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:01,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-10 15:12:01,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-10 15:12:01,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-10 15:12:01,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1084, Invalid=1172, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 15:12:01,205 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 48 states. [2018-10-10 15:12:02,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:02,795 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2018-10-10 15:12:02,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-10 15:12:02,795 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 248 [2018-10-10 15:12:02,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:02,796 INFO L225 Difference]: With dead ends: 254 [2018-10-10 15:12:02,796 INFO L226 Difference]: Without dead ends: 254 [2018-10-10 15:12:02,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-10-10 15:12:02,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-10-10 15:12:02,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2018-10-10 15:12:02,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-10-10 15:12:02,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2018-10-10 15:12:02,799 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 248 [2018-10-10 15:12:02,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:02,799 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2018-10-10 15:12:02,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-10 15:12:02,799 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2018-10-10 15:12:02,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-10-10 15:12:02,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:02,800 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:02,800 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:02,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:02,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1910585826, now seen corresponding path program 45 times [2018-10-10 15:12:02,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:03,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 0 proven. 3015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:03,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:03,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-10 15:12:03,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-10 15:12:03,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-10 15:12:03,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1131, Invalid=1221, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 15:12:03,954 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand 49 states. [2018-10-10 15:12:05,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:05,844 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2018-10-10 15:12:05,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-10 15:12:05,844 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 251 [2018-10-10 15:12:05,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:05,845 INFO L225 Difference]: With dead ends: 257 [2018-10-10 15:12:05,845 INFO L226 Difference]: Without dead ends: 257 [2018-10-10 15:12:05,846 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-10-10 15:12:05,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-10-10 15:12:05,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2018-10-10 15:12:05,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-10 15:12:05,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-10-10 15:12:05,849 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 251 [2018-10-10 15:12:05,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:05,849 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-10-10 15:12:05,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-10 15:12:05,849 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-10-10 15:12:05,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-10-10 15:12:05,851 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:05,851 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:05,851 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:05,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:05,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1586250948, now seen corresponding path program 46 times [2018-10-10 15:12:05,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:06,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3151 trivial. 0 not checked. [2018-10-10 15:12:06,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:12:06,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-10 15:12:06,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 15:12:06,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 15:12:06,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:12:06,263 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 10 states. [2018-10-10 15:12:07,357 WARN L178 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-10-10 15:12:07,787 WARN L178 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-10-10 15:12:08,202 WARN L178 SmtUtils]: Spent 318.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-10-10 15:12:08,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:08,216 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-10-10 15:12:08,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 15:12:08,217 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 254 [2018-10-10 15:12:08,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:08,217 INFO L225 Difference]: With dead ends: 253 [2018-10-10 15:12:08,217 INFO L226 Difference]: Without dead ends: 0 [2018-10-10 15:12:08,218 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-10-10 15:12:08,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-10 15:12:08,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-10 15:12:08,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-10 15:12:08,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-10 15:12:08,218 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 254 [2018-10-10 15:12:08,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:08,219 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-10 15:12:08,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 15:12:08,219 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-10 15:12:08,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-10 15:12:08,224 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_29.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 03:12:08 BoogieIcfgContainer [2018-10-10 15:12:08,225 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 15:12:08,225 INFO L168 Benchmark]: Toolchain (without parser) took 74902.04 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 592.4 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 384.6 MB). Peak memory consumption was 977.1 MB. Max. memory is 7.1 GB. [2018-10-10 15:12:08,227 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.15 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:12:08,227 INFO L168 Benchmark]: Boogie Preprocessor took 75.58 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:12:08,227 INFO L168 Benchmark]: RCFGBuilder took 836.64 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:12:08,228 INFO L168 Benchmark]: TraceAbstraction took 73985.66 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 592.4 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 352.9 MB). Peak memory consumption was 945.4 MB. Max. memory is 7.1 GB. [2018-10-10 15:12:08,231 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.15 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 75.58 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 836.64 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 73985.66 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 592.4 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 352.9 MB). Peak memory consumption was 945.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 205]: 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, 121 locations, 1 error locations. SAFE Result, 73.9s OverallTime, 47 OverallIterations, 46 TraceHistogramMax, 38.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5281 SDtfs, 9172 SDslu, 85805 SDs, 0 SdLazy, 7545 SolverSat, 1149 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2270 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 2176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16221 ImplicationChecksByTransitivity, 56.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=255occurred in iteration=46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 47 MinimizatonAttempts, 92 StatesRemovedByMinimization, 46 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 31.8s InterpolantComputationTime, 8695 NumberOfCodeBlocks, 8695 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 8648 ConstructedInterpolants, 0 QuantifiedInterpolants, 4918918 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 47 InterpolantComputations, 2 PerfectInterpolantSequences, 3151/49726 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/20051113-1.c_false-valid-memtrack.i_29.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-10_15-12-08-241.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_29.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-10_15-12-08-241.csv Received shutdown request...