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/array3_false-valid-deref.i_6.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-093a8c0 [2018-10-14 16:35:28,543 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-14 16:35:28,546 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-14 16:35:28,558 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-14 16:35:28,558 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-14 16:35:28,559 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-14 16:35:28,560 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-14 16:35:28,562 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-14 16:35:28,564 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-14 16:35:28,565 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-14 16:35:28,565 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-14 16:35:28,566 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-14 16:35:28,567 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-14 16:35:28,568 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-14 16:35:28,569 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-14 16:35:28,570 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-14 16:35:28,570 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-14 16:35:28,572 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-14 16:35:28,574 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-14 16:35:28,576 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-14 16:35:28,577 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-14 16:35:28,578 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-14 16:35:28,581 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-14 16:35:28,581 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-14 16:35:28,581 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-14 16:35:28,582 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-14 16:35:28,586 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-14 16:35:28,587 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-14 16:35:28,591 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-14 16:35:28,593 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-14 16:35:28,593 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-14 16:35:28,594 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-14 16:35:28,594 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-14 16:35:28,594 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-14 16:35:28,595 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-14 16:35:28,596 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-14 16:35:28,596 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-14 16:35:28,612 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-14 16:35:28,612 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-14 16:35:28,613 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-14 16:35:28,614 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-14 16:35:28,614 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-14 16:35:28,614 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-14 16:35:28,618 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-14 16:35:28,618 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-14 16:35:28,618 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-14 16:35:28,618 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-14 16:35:28,619 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-14 16:35:28,619 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-14 16:35:28,619 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-14 16:35:28,620 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-14 16:35:28,620 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-14 16:35:28,664 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-14 16:35:28,677 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-14 16:35:28,682 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-14 16:35:28,684 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-14 16:35:28,684 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-14 16:35:28,685 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/array3_false-valid-deref.i_6.bpl [2018-10-14 16:35:28,686 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/array3_false-valid-deref.i_6.bpl' [2018-10-14 16:35:28,768 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-14 16:35:28,771 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-14 16:35:28,772 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-14 16:35:28,772 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-14 16:35:28,772 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-14 16:35:28,801 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:35:28" (1/1) ... [2018-10-14 16:35:28,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:35:28" (1/1) ... [2018-10-14 16:35:28,817 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:35:28" (1/1) ... [2018-10-14 16:35:28,819 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:35:28" (1/1) ... [2018-10-14 16:35:28,824 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:35:28" (1/1) ... [2018-10-14 16:35:28,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:35:28" (1/1) ... [2018-10-14 16:35:28,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:35:28" (1/1) ... [2018-10-14 16:35:28,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-14 16:35:28,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-14 16:35:28,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-14 16:35:28,830 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-14 16:35:28,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:35:28" (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-14 16:35:28,894 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-14 16:35:28,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-14 16:35:28,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-14 16:35:29,293 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-14 16:35:29,294 INFO L202 PluginConnector]: Adding new model array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:35:29 BoogieIcfgContainer [2018-10-14 16:35:29,294 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-14 16:35:29,295 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-14 16:35:29,295 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-14 16:35:29,299 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-14 16:35:29,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:35:28" (1/2) ... [2018-10-14 16:35:29,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9da8e65 and model type array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:35:29, skipping insertion in model container [2018-10-14 16:35:29,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:35:29" (2/2) ... [2018-10-14 16:35:29,303 INFO L112 eAbstractionObserver]: Analyzing ICFG array3_false-valid-deref.i_6.bpl [2018-10-14 16:35:29,314 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-14 16:35:29,324 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-14 16:35:29,343 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-14 16:35:29,374 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-14 16:35:29,375 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-14 16:35:29,375 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-14 16:35:29,376 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-14 16:35:29,376 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-14 16:35:29,376 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-14 16:35:29,376 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-14 16:35:29,376 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-14 16:35:29,377 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-14 16:35:29,395 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-10-14 16:35:29,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-14 16:35:29,404 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:35:29,406 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] [2018-10-14 16:35:29,407 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:35:29,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:35:29,414 INFO L82 PathProgramCache]: Analyzing trace with hash 192870681, now seen corresponding path program 1 times [2018-10-14 16:35:29,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:35:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:35:30,055 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-14 16:35:30,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 16:35:30,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-14 16:35:30,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-14 16:35:30,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-14 16:35:30,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-14 16:35:30,087 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 9 states. [2018-10-14 16:35:30,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:35:30,680 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-10-14 16:35:30,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-14 16:35:30,683 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-10-14 16:35:30,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:35:30,696 INFO L225 Difference]: With dead ends: 46 [2018-10-14 16:35:30,697 INFO L226 Difference]: Without dead ends: 46 [2018-10-14 16:35:30,699 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-10-14 16:35:30,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-14 16:35:30,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2018-10-14 16:35:30,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-14 16:35:30,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-14 16:35:30,740 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 24 [2018-10-14 16:35:30,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:35:30,741 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-14 16:35:30,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-14 16:35:30,742 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-14 16:35:30,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-14 16:35:30,743 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:35:30,743 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:35:30,747 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:35:30,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:35:30,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1874644339, now seen corresponding path program 1 times [2018-10-14 16:35:30,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:35:30,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:35:31,110 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:35:31,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:35:31,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-14 16:35:31,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-14 16:35:31,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-14 16:35:31,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-10-14 16:35:31,115 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 10 states. [2018-10-14 16:35:31,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:35:31,988 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-10-14 16:35:31,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-14 16:35:31,988 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-10-14 16:35:31,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:35:31,990 INFO L225 Difference]: With dead ends: 65 [2018-10-14 16:35:31,990 INFO L226 Difference]: Without dead ends: 65 [2018-10-14 16:35:31,992 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2018-10-14 16:35:31,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-14 16:35:32,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2018-10-14 16:35:32,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-14 16:35:32,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-10-14 16:35:32,005 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 38 [2018-10-14 16:35:32,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:35:32,005 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-10-14 16:35:32,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-14 16:35:32,006 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-10-14 16:35:32,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-14 16:35:32,007 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:35:32,008 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:35:32,008 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:35:32,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:35:32,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1822977, now seen corresponding path program 2 times [2018-10-14 16:35:32,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:35:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:35:32,462 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:35:32,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:35:32,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-14 16:35:32,463 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-14 16:35:32,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-14 16:35:32,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-10-14 16:35:32,465 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 12 states. [2018-10-14 16:35:33,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:35:33,546 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-10-14 16:35:33,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-14 16:35:33,547 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2018-10-14 16:35:33,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:35:33,549 INFO L225 Difference]: With dead ends: 79 [2018-10-14 16:35:33,549 INFO L226 Difference]: Without dead ends: 79 [2018-10-14 16:35:33,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2018-10-14 16:35:33,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-14 16:35:33,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67. [2018-10-14 16:35:33,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-14 16:35:33,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-10-14 16:35:33,558 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 52 [2018-10-14 16:35:33,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:35:33,559 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-10-14 16:35:33,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-14 16:35:33,559 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-10-14 16:35:33,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-14 16:35:33,561 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:35:33,561 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:35:33,562 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:35:33,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:35:33,562 INFO L82 PathProgramCache]: Analyzing trace with hash -118221707, now seen corresponding path program 3 times [2018-10-14 16:35:33,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:35:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:35:33,989 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:35:33,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:35:33,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-14 16:35:33,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-14 16:35:33,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-14 16:35:33,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-10-14 16:35:33,992 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 16 states. [2018-10-14 16:35:35,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:35:35,153 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-10-14 16:35:35,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-14 16:35:35,154 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2018-10-14 16:35:35,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:35:35,156 INFO L225 Difference]: With dead ends: 93 [2018-10-14 16:35:35,157 INFO L226 Difference]: Without dead ends: 93 [2018-10-14 16:35:35,158 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=270, Invalid=722, Unknown=0, NotChecked=0, Total=992 [2018-10-14 16:35:35,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-14 16:35:35,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2018-10-14 16:35:35,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-14 16:35:35,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-10-14 16:35:35,166 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 66 [2018-10-14 16:35:35,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:35:35,167 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-10-14 16:35:35,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-14 16:35:35,167 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-10-14 16:35:35,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-14 16:35:35,169 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:35:35,169 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:35:35,169 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:35:35,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:35:35,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1140376343, now seen corresponding path program 4 times [2018-10-14 16:35:35,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:35:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:35:35,532 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:35:35,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:35:35,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-14 16:35:35,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-14 16:35:35,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-14 16:35:35,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-14 16:35:35,534 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 16 states. [2018-10-14 16:35:36,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:35:36,540 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-10-14 16:35:36,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-14 16:35:36,545 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 80 [2018-10-14 16:35:36,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:35:36,546 INFO L225 Difference]: With dead ends: 107 [2018-10-14 16:35:36,546 INFO L226 Difference]: Without dead ends: 107 [2018-10-14 16:35:36,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=205, Invalid=851, Unknown=0, NotChecked=0, Total=1056 [2018-10-14 16:35:36,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-14 16:35:36,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 95. [2018-10-14 16:35:36,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-14 16:35:36,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-10-14 16:35:36,562 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 80 [2018-10-14 16:35:36,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:35:36,562 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-10-14 16:35:36,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-14 16:35:36,562 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-10-14 16:35:36,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-14 16:35:36,566 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:35:36,567 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:35:36,567 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:35:36,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:35:36,567 INFO L82 PathProgramCache]: Analyzing trace with hash 568363613, now seen corresponding path program 5 times [2018-10-14 16:35:36,568 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:35:36,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:35:37,111 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:35:37,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:35:37,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-14 16:35:37,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-14 16:35:37,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-14 16:35:37,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-10-14 16:35:37,113 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 18 states. [2018-10-14 16:35:38,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:35:38,922 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-10-14 16:35:38,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-14 16:35:38,924 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 94 [2018-10-14 16:35:38,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:35:38,926 INFO L225 Difference]: With dead ends: 121 [2018-10-14 16:35:38,926 INFO L226 Difference]: Without dead ends: 121 [2018-10-14 16:35:38,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=242, Invalid=1164, Unknown=0, NotChecked=0, Total=1406 [2018-10-14 16:35:38,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-14 16:35:38,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 109. [2018-10-14 16:35:38,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-14 16:35:38,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-10-14 16:35:38,935 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 94 [2018-10-14 16:35:38,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:35:38,936 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-10-14 16:35:38,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-14 16:35:38,936 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-10-14 16:35:38,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-14 16:35:38,938 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:35:38,938 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:35:38,938 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:35:38,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:35:38,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1906623279, now seen corresponding path program 6 times [2018-10-14 16:35:38,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:35:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:35:39,482 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:35:39,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:35:39,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-14 16:35:39,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-14 16:35:39,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-14 16:35:39,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-10-14 16:35:39,484 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 20 states. [2018-10-14 16:35:41,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:35:41,031 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-10-14 16:35:41,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-14 16:35:41,031 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2018-10-14 16:35:41,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:35:41,033 INFO L225 Difference]: With dead ends: 135 [2018-10-14 16:35:41,033 INFO L226 Difference]: Without dead ends: 135 [2018-10-14 16:35:41,034 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=279, Invalid=1527, Unknown=0, NotChecked=0, Total=1806 [2018-10-14 16:35:41,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-14 16:35:41,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 123. [2018-10-14 16:35:41,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-14 16:35:41,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-10-14 16:35:41,043 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 108 [2018-10-14 16:35:41,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:35:41,044 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-10-14 16:35:41,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-14 16:35:41,044 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-10-14 16:35:41,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-14 16:35:41,047 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:35:41,047 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:35:41,047 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:35:41,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:35:41,048 INFO L82 PathProgramCache]: Analyzing trace with hash -459107259, now seen corresponding path program 7 times [2018-10-14 16:35:41,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:35:41,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:35:41,864 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 0 proven. 336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:35:41,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:35:41,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-14 16:35:41,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-14 16:35:41,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-14 16:35:41,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-10-14 16:35:41,866 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 22 states. [2018-10-14 16:35:43,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:35:43,603 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-10-14 16:35:43,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-14 16:35:43,603 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 122 [2018-10-14 16:35:43,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:35:43,604 INFO L225 Difference]: With dead ends: 149 [2018-10-14 16:35:43,605 INFO L226 Difference]: Without dead ends: 149 [2018-10-14 16:35:43,606 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=316, Invalid=1940, Unknown=0, NotChecked=0, Total=2256 [2018-10-14 16:35:43,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-14 16:35:43,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 137. [2018-10-14 16:35:43,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-14 16:35:43,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-10-14 16:35:43,613 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 122 [2018-10-14 16:35:43,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:35:43,614 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-10-14 16:35:43,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-14 16:35:43,614 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-10-14 16:35:43,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-14 16:35:43,616 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:35:43,617 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:35:43,617 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:35:43,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:35:43,617 INFO L82 PathProgramCache]: Analyzing trace with hash 2066862265, now seen corresponding path program 8 times [2018-10-14 16:35:43,618 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:35:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:35:44,562 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:35:44,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:35:44,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-14 16:35:44,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-14 16:35:44,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-14 16:35:44,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2018-10-14 16:35:44,564 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 24 states. [2018-10-14 16:35:46,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:35:46,703 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-10-14 16:35:46,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-14 16:35:46,706 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 136 [2018-10-14 16:35:46,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:35:46,708 INFO L225 Difference]: With dead ends: 163 [2018-10-14 16:35:46,708 INFO L226 Difference]: Without dead ends: 163 [2018-10-14 16:35:46,709 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=353, Invalid=2403, Unknown=0, NotChecked=0, Total=2756 [2018-10-14 16:35:46,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-10-14 16:35:46,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 151. [2018-10-14 16:35:46,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-14 16:35:46,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-10-14 16:35:46,717 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 136 [2018-10-14 16:35:46,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:35:46,717 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-10-14 16:35:46,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-14 16:35:46,718 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-10-14 16:35:46,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-14 16:35:46,720 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:35:46,721 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:35:46,721 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:35:46,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:35:46,721 INFO L82 PathProgramCache]: Analyzing trace with hash 265564717, now seen corresponding path program 9 times [2018-10-14 16:35:46,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:35:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:35:47,600 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 0 proven. 558 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:35:47,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:35:47,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-14 16:35:47,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-14 16:35:47,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-14 16:35:47,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2018-10-14 16:35:47,602 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 26 states. [2018-10-14 16:35:50,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:35:50,565 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-10-14 16:35:50,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-14 16:35:50,572 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 150 [2018-10-14 16:35:50,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:35:50,573 INFO L225 Difference]: With dead ends: 177 [2018-10-14 16:35:50,573 INFO L226 Difference]: Without dead ends: 177 [2018-10-14 16:35:50,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=390, Invalid=2916, Unknown=0, NotChecked=0, Total=3306 [2018-10-14 16:35:50,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-10-14 16:35:50,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 165. [2018-10-14 16:35:50,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-14 16:35:50,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-10-14 16:35:50,580 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 150 [2018-10-14 16:35:50,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:35:50,581 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-10-14 16:35:50,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-14 16:35:50,581 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-10-14 16:35:50,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-14 16:35:50,584 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:35:50,584 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:35:50,584 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:35:50,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:35:50,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1146816351, now seen corresponding path program 10 times [2018-10-14 16:35:50,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:35:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:35:51,444 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 690 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:35:51,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:35:51,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-14 16:35:51,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-14 16:35:51,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-14 16:35:51,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2018-10-14 16:35:51,445 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 28 states. [2018-10-14 16:35:54,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:35:54,292 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-10-14 16:35:54,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-14 16:35:54,293 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 164 [2018-10-14 16:35:54,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:35:54,294 INFO L225 Difference]: With dead ends: 191 [2018-10-14 16:35:54,294 INFO L226 Difference]: Without dead ends: 191 [2018-10-14 16:35:54,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=427, Invalid=3479, Unknown=0, NotChecked=0, Total=3906 [2018-10-14 16:35:54,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-10-14 16:35:54,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 179. [2018-10-14 16:35:54,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-14 16:35:54,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-10-14 16:35:54,300 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 164 [2018-10-14 16:35:54,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:35:54,300 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-10-14 16:35:54,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-14 16:35:54,301 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-10-14 16:35:54,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-14 16:35:54,302 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:35:54,302 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:35:54,303 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:35:54,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:35:54,303 INFO L82 PathProgramCache]: Analyzing trace with hash -418421739, now seen corresponding path program 11 times [2018-10-14 16:35:54,304 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:35:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:35:55,459 INFO L134 CoverageAnalysis]: Checked inductivity of 836 backedges. 0 proven. 836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:35:55,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:35:55,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-14 16:35:55,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-14 16:35:55,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-14 16:35:55,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=789, Unknown=0, NotChecked=0, Total=870 [2018-10-14 16:35:55,461 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 30 states. [2018-10-14 16:35:58,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:35:58,753 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-10-14 16:35:58,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-14 16:35:58,754 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 178 [2018-10-14 16:35:58,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:35:58,756 INFO L225 Difference]: With dead ends: 205 [2018-10-14 16:35:58,756 INFO L226 Difference]: Without dead ends: 205 [2018-10-14 16:35:58,758 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=464, Invalid=4092, Unknown=0, NotChecked=0, Total=4556 [2018-10-14 16:35:58,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-10-14 16:35:58,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 193. [2018-10-14 16:35:58,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-14 16:35:58,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-10-14 16:35:58,762 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 178 [2018-10-14 16:35:58,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:35:58,763 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-10-14 16:35:58,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-14 16:35:58,763 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-10-14 16:35:58,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-14 16:35:58,764 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:35:58,764 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:35:58,765 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:35:58,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:35:58,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1036956809, now seen corresponding path program 12 times [2018-10-14 16:35:58,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:35:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:36:00,393 INFO L134 CoverageAnalysis]: Checked inductivity of 996 backedges. 0 proven. 996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:36:00,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:36:00,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-14 16:36:00,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-14 16:36:00,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-14 16:36:00,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=905, Unknown=0, NotChecked=0, Total=992 [2018-10-14 16:36:00,395 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 32 states. [2018-10-14 16:36:01,244 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-10-14 16:36:04,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:36:04,426 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-10-14 16:36:04,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-14 16:36:04,427 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 192 [2018-10-14 16:36:04,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:36:04,428 INFO L225 Difference]: With dead ends: 219 [2018-10-14 16:36:04,428 INFO L226 Difference]: Without dead ends: 219 [2018-10-14 16:36:04,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 806 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=501, Invalid=4755, Unknown=0, NotChecked=0, Total=5256 [2018-10-14 16:36:04,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-10-14 16:36:04,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 207. [2018-10-14 16:36:04,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-14 16:36:04,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-10-14 16:36:04,434 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 192 [2018-10-14 16:36:04,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:36:04,435 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-10-14 16:36:04,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-14 16:36:04,435 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-10-14 16:36:04,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-14 16:36:04,436 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:36:04,436 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:36:04,437 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:36:04,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:36:04,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1561449987, now seen corresponding path program 13 times [2018-10-14 16:36:04,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:36:04,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:36:05,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1170 backedges. 0 proven. 1170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:36:05,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:36:05,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-14 16:36:05,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-14 16:36:05,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-14 16:36:05,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1029, Unknown=0, NotChecked=0, Total=1122 [2018-10-14 16:36:05,540 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 34 states. [2018-10-14 16:36:07,722 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-10-14 16:36:10,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:36:10,028 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-10-14 16:36:10,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-14 16:36:10,029 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 206 [2018-10-14 16:36:10,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:36:10,031 INFO L225 Difference]: With dead ends: 233 [2018-10-14 16:36:10,031 INFO L226 Difference]: Without dead ends: 233 [2018-10-14 16:36:10,034 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=538, Invalid=5468, Unknown=0, NotChecked=0, Total=6006 [2018-10-14 16:36:10,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-10-14 16:36:10,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 221. [2018-10-14 16:36:10,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-14 16:36:10,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-10-14 16:36:10,039 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 206 [2018-10-14 16:36:10,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:36:10,039 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-10-14 16:36:10,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-14 16:36:10,040 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-10-14 16:36:10,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-14 16:36:10,041 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:36:10,041 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:36:10,041 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:36:10,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:36:10,042 INFO L82 PathProgramCache]: Analyzing trace with hash 617153649, now seen corresponding path program 14 times [2018-10-14 16:36:10,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:36:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:36:11,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1358 backedges. 0 proven. 1358 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:36:11,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:36:11,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-14 16:36:11,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-14 16:36:11,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-14 16:36:11,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1161, Unknown=0, NotChecked=0, Total=1260 [2018-10-14 16:36:11,365 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 36 states. [2018-10-14 16:36:16,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:36:16,119 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-10-14 16:36:16,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-14 16:36:16,119 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 220 [2018-10-14 16:36:16,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:36:16,121 INFO L225 Difference]: With dead ends: 247 [2018-10-14 16:36:16,121 INFO L226 Difference]: Without dead ends: 247 [2018-10-14 16:36:16,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1065 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=575, Invalid=6231, Unknown=0, NotChecked=0, Total=6806 [2018-10-14 16:36:16,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-10-14 16:36:16,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 235. [2018-10-14 16:36:16,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-14 16:36:16,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-10-14 16:36:16,128 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 220 [2018-10-14 16:36:16,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:36:16,129 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-10-14 16:36:16,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-14 16:36:16,129 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-10-14 16:36:16,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-14 16:36:16,130 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:36:16,131 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:36:16,131 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:36:16,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:36:16,131 INFO L82 PathProgramCache]: Analyzing trace with hash -250969115, now seen corresponding path program 15 times [2018-10-14 16:36:16,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:36:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:36:17,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:36:17,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:36:17,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-14 16:36:17,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-14 16:36:17,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-14 16:36:17,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1301, Unknown=0, NotChecked=0, Total=1406 [2018-10-14 16:36:17,537 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 38 states. [2018-10-14 16:36:22,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:36:22,595 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-10-14 16:36:22,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-14 16:36:22,595 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 234 [2018-10-14 16:36:22,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:36:22,597 INFO L225 Difference]: With dead ends: 261 [2018-10-14 16:36:22,597 INFO L226 Difference]: Without dead ends: 261 [2018-10-14 16:36:22,600 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=612, Invalid=7044, Unknown=0, NotChecked=0, Total=7656 [2018-10-14 16:36:22,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-10-14 16:36:22,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 249. [2018-10-14 16:36:22,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-14 16:36:22,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-10-14 16:36:22,605 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 234 [2018-10-14 16:36:22,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:36:22,605 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-10-14 16:36:22,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-14 16:36:22,605 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-10-14 16:36:22,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-14 16:36:22,607 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:36:22,607 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:36:22,607 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:36:22,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:36:22,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1219356761, now seen corresponding path program 16 times [2018-10-14 16:36:22,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:36:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:36:23,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1776 backedges. 0 proven. 1776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:36:23,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:36:23,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-14 16:36:23,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-14 16:36:23,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-14 16:36:23,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1449, Unknown=0, NotChecked=0, Total=1560 [2018-10-14 16:36:23,977 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 40 states. [2018-10-14 16:36:29,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:36:29,700 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-10-14 16:36:29,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-14 16:36:29,701 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 248 [2018-10-14 16:36:29,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:36:29,703 INFO L225 Difference]: With dead ends: 275 [2018-10-14 16:36:29,703 INFO L226 Difference]: Without dead ends: 275 [2018-10-14 16:36:29,706 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1360 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=649, Invalid=7907, Unknown=0, NotChecked=0, Total=8556 [2018-10-14 16:36:29,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-14 16:36:29,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 263. [2018-10-14 16:36:29,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-10-14 16:36:29,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-10-14 16:36:29,711 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 248 [2018-10-14 16:36:29,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:36:29,711 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-10-14 16:36:29,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-14 16:36:29,711 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-10-14 16:36:29,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-10-14 16:36:29,713 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:36:29,713 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:36:29,713 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:36:29,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:36:29,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1946055117, now seen corresponding path program 17 times [2018-10-14 16:36:29,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:36:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:36:32,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2006 backedges. 0 proven. 2006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:36:32,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:36:32,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-14 16:36:32,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-14 16:36:32,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-14 16:36:32,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1605, Unknown=0, NotChecked=0, Total=1722 [2018-10-14 16:36:32,260 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 42 states. [2018-10-14 16:36:38,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:36:38,433 INFO L93 Difference]: Finished difference Result 289 states and 289 transitions. [2018-10-14 16:36:38,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-14 16:36:38,436 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 262 [2018-10-14 16:36:38,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:36:38,438 INFO L225 Difference]: With dead ends: 289 [2018-10-14 16:36:38,438 INFO L226 Difference]: Without dead ends: 289 [2018-10-14 16:36:38,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1521 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=686, Invalid=8820, Unknown=0, NotChecked=0, Total=9506 [2018-10-14 16:36:38,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-10-14 16:36:38,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 277. [2018-10-14 16:36:38,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-14 16:36:38,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-10-14 16:36:38,444 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 262 [2018-10-14 16:36:38,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:36:38,445 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-10-14 16:36:38,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-14 16:36:38,445 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-10-14 16:36:38,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-10-14 16:36:38,446 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:36:38,447 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:36:38,447 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:36:38,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:36:38,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1231593407, now seen corresponding path program 18 times [2018-10-14 16:36:38,448 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:36:38,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:36:40,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2250 backedges. 0 proven. 2250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:36:40,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:36:40,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-14 16:36:40,812 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-14 16:36:40,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-14 16:36:40,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1769, Unknown=0, NotChecked=0, Total=1892 [2018-10-14 16:36:40,813 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 44 states. [2018-10-14 16:36:47,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:36:47,475 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-10-14 16:36:47,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-14 16:36:47,476 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 276 [2018-10-14 16:36:47,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:36:47,477 INFO L225 Difference]: With dead ends: 303 [2018-10-14 16:36:47,477 INFO L226 Difference]: Without dead ends: 303 [2018-10-14 16:36:47,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1691 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=723, Invalid=9783, Unknown=0, NotChecked=0, Total=10506 [2018-10-14 16:36:47,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-10-14 16:36:47,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 291. [2018-10-14 16:36:47,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-10-14 16:36:47,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2018-10-14 16:36:47,484 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 276 [2018-10-14 16:36:47,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:36:47,485 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2018-10-14 16:36:47,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-14 16:36:47,485 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2018-10-14 16:36:47,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-10-14 16:36:47,486 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:36:47,487 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:36:47,487 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:36:47,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:36:47,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1130623925, now seen corresponding path program 19 times [2018-10-14 16:36:47,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:36:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:36:49,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2508 backedges. 0 proven. 2508 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:36:49,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:36:49,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-14 16:36:49,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-14 16:36:49,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-14 16:36:49,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1941, Unknown=0, NotChecked=0, Total=2070 [2018-10-14 16:36:49,517 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 46 states. [2018-10-14 16:36:57,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:36:57,795 INFO L93 Difference]: Finished difference Result 317 states and 317 transitions. [2018-10-14 16:36:57,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-14 16:36:57,796 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 290 [2018-10-14 16:36:57,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:36:57,798 INFO L225 Difference]: With dead ends: 317 [2018-10-14 16:36:57,798 INFO L226 Difference]: Without dead ends: 317 [2018-10-14 16:36:57,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1870 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=760, Invalid=10796, Unknown=0, NotChecked=0, Total=11556 [2018-10-14 16:36:57,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-10-14 16:36:57,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 305. [2018-10-14 16:36:57,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-10-14 16:36:57,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-10-14 16:36:57,804 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 290 [2018-10-14 16:36:57,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:36:57,805 INFO L481 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-10-14 16:36:57,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-14 16:36:57,805 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-10-14 16:36:57,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-10-14 16:36:57,806 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:36:57,807 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:36:57,807 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:36:57,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:36:57,807 INFO L82 PathProgramCache]: Analyzing trace with hash 815754281, now seen corresponding path program 20 times [2018-10-14 16:36:57,808 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:36:57,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:36:59,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2780 backedges. 0 proven. 2780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:36:59,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:36:59,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-14 16:36:59,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-14 16:36:59,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-14 16:36:59,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2121, Unknown=0, NotChecked=0, Total=2256 [2018-10-14 16:36:59,842 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 48 states. [2018-10-14 16:37:07,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:37:07,827 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2018-10-14 16:37:07,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-14 16:37:07,828 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 304 [2018-10-14 16:37:07,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:37:07,830 INFO L225 Difference]: With dead ends: 331 [2018-10-14 16:37:07,830 INFO L226 Difference]: Without dead ends: 331 [2018-10-14 16:37:07,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2058 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=797, Invalid=11859, Unknown=0, NotChecked=0, Total=12656 [2018-10-14 16:37:07,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-10-14 16:37:07,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 319. [2018-10-14 16:37:07,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-10-14 16:37:07,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 319 transitions. [2018-10-14 16:37:07,837 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 319 transitions. Word has length 304 [2018-10-14 16:37:07,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:37:07,837 INFO L481 AbstractCegarLoop]: Abstraction has 319 states and 319 transitions. [2018-10-14 16:37:07,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-14 16:37:07,837 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 319 transitions. [2018-10-14 16:37:07,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-10-14 16:37:07,839 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:37:07,839 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:37:07,840 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:37:07,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:37:07,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1809123741, now seen corresponding path program 21 times [2018-10-14 16:37:07,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:37:07,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:37:09,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3066 backedges. 0 proven. 3066 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:37:09,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:37:09,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-14 16:37:09,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-14 16:37:09,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-14 16:37:09,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2309, Unknown=0, NotChecked=0, Total=2450 [2018-10-14 16:37:09,847 INFO L87 Difference]: Start difference. First operand 319 states and 319 transitions. Second operand 50 states. [2018-10-14 16:37:18,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:37:18,583 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2018-10-14 16:37:18,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-14 16:37:18,586 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 318 [2018-10-14 16:37:18,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:37:18,589 INFO L225 Difference]: With dead ends: 345 [2018-10-14 16:37:18,589 INFO L226 Difference]: Without dead ends: 345 [2018-10-14 16:37:18,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2255 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=834, Invalid=12972, Unknown=0, NotChecked=0, Total=13806 [2018-10-14 16:37:18,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-10-14 16:37:18,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 333. [2018-10-14 16:37:18,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-10-14 16:37:18,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2018-10-14 16:37:18,595 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 318 [2018-10-14 16:37:18,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:37:18,595 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2018-10-14 16:37:18,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-14 16:37:18,596 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2018-10-14 16:37:18,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-10-14 16:37:18,597 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:37:18,598 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:37:18,598 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:37:18,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:37:18,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1377825775, now seen corresponding path program 22 times [2018-10-14 16:37:18,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:37:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:37:21,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3366 backedges. 0 proven. 3366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:37:21,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:37:21,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-14 16:37:21,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-14 16:37:21,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-14 16:37:21,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2505, Unknown=0, NotChecked=0, Total=2652 [2018-10-14 16:37:21,335 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 52 states. [2018-10-14 16:37:30,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:37:30,979 INFO L93 Difference]: Finished difference Result 359 states and 359 transitions. [2018-10-14 16:37:30,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-14 16:37:30,979 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 332 [2018-10-14 16:37:30,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:37:30,982 INFO L225 Difference]: With dead ends: 359 [2018-10-14 16:37:30,982 INFO L226 Difference]: Without dead ends: 359 [2018-10-14 16:37:30,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2461 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=871, Invalid=14135, Unknown=0, NotChecked=0, Total=15006 [2018-10-14 16:37:30,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-10-14 16:37:30,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 347. [2018-10-14 16:37:30,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-10-14 16:37:30,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 347 transitions. [2018-10-14 16:37:30,988 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 347 transitions. Word has length 332 [2018-10-14 16:37:30,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:37:30,989 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 347 transitions. [2018-10-14 16:37:30,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-14 16:37:30,989 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 347 transitions. [2018-10-14 16:37:30,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-10-14 16:37:30,991 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:37:30,991 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:37:30,991 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:37:30,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:37:30,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1860940677, now seen corresponding path program 23 times [2018-10-14 16:37:30,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:37:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:37:33,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3680 backedges. 0 proven. 3680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:37:33,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:37:33,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-14 16:37:33,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-14 16:37:33,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-14 16:37:33,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2709, Unknown=0, NotChecked=0, Total=2862 [2018-10-14 16:37:33,338 INFO L87 Difference]: Start difference. First operand 347 states and 347 transitions. Second operand 54 states. [2018-10-14 16:37:43,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:37:43,576 INFO L93 Difference]: Finished difference Result 373 states and 373 transitions. [2018-10-14 16:37:43,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-14 16:37:43,576 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 346 [2018-10-14 16:37:43,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:37:43,579 INFO L225 Difference]: With dead ends: 373 [2018-10-14 16:37:43,579 INFO L226 Difference]: Without dead ends: 373 [2018-10-14 16:37:43,580 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2676 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=908, Invalid=15348, Unknown=0, NotChecked=0, Total=16256 [2018-10-14 16:37:43,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-10-14 16:37:43,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 361. [2018-10-14 16:37:43,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-10-14 16:37:43,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2018-10-14 16:37:43,586 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 346 [2018-10-14 16:37:43,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:37:43,586 INFO L481 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2018-10-14 16:37:43,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-14 16:37:43,586 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2018-10-14 16:37:43,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-10-14 16:37:43,588 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:37:43,588 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:37:43,589 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:37:43,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:37:43,589 INFO L82 PathProgramCache]: Analyzing trace with hash -629981191, now seen corresponding path program 24 times [2018-10-14 16:37:43,590 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:37:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:37:46,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4008 backedges. 0 proven. 4008 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:37:46,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:37:46,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-14 16:37:46,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-14 16:37:46,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-14 16:37:46,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2921, Unknown=0, NotChecked=0, Total=3080 [2018-10-14 16:37:46,253 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 56 states. [2018-10-14 16:37:57,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:37:57,253 INFO L93 Difference]: Finished difference Result 387 states and 387 transitions. [2018-10-14 16:37:57,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-14 16:37:57,254 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 360 [2018-10-14 16:37:57,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:37:57,255 INFO L225 Difference]: With dead ends: 387 [2018-10-14 16:37:57,255 INFO L226 Difference]: Without dead ends: 387 [2018-10-14 16:37:57,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2900 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=945, Invalid=16611, Unknown=0, NotChecked=0, Total=17556 [2018-10-14 16:37:57,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-10-14 16:37:57,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 375. [2018-10-14 16:37:57,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-10-14 16:37:57,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 375 transitions. [2018-10-14 16:37:57,261 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 375 transitions. Word has length 360 [2018-10-14 16:37:57,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:37:57,262 INFO L481 AbstractCegarLoop]: Abstraction has 375 states and 375 transitions. [2018-10-14 16:37:57,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-14 16:37:57,262 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 375 transitions. [2018-10-14 16:37:57,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-10-14 16:37:57,264 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:37:57,264 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:37:57,264 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:37:57,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:37:57,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1019088531, now seen corresponding path program 25 times [2018-10-14 16:37:57,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:37:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:38:00,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4350 backedges. 0 proven. 4350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:38:00,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:38:00,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-14 16:38:00,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-14 16:38:00,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-14 16:38:00,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=3141, Unknown=0, NotChecked=0, Total=3306 [2018-10-14 16:38:00,183 INFO L87 Difference]: Start difference. First operand 375 states and 375 transitions. Second operand 58 states. [2018-10-14 16:38:12,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:38:12,305 INFO L93 Difference]: Finished difference Result 401 states and 401 transitions. [2018-10-14 16:38:12,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-14 16:38:12,306 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 374 [2018-10-14 16:38:12,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:38:12,308 INFO L225 Difference]: With dead ends: 401 [2018-10-14 16:38:12,308 INFO L226 Difference]: Without dead ends: 401 [2018-10-14 16:38:12,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3133 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=982, Invalid=17924, Unknown=0, NotChecked=0, Total=18906 [2018-10-14 16:38:12,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-10-14 16:38:12,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 389. [2018-10-14 16:38:12,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-10-14 16:38:12,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 389 transitions. [2018-10-14 16:38:12,314 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 389 transitions. Word has length 374 [2018-10-14 16:38:12,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:38:12,314 INFO L481 AbstractCegarLoop]: Abstraction has 389 states and 389 transitions. [2018-10-14 16:38:12,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-14 16:38:12,315 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 389 transitions. [2018-10-14 16:38:12,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-10-14 16:38:12,317 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:38:12,317 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:38:12,317 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:38:12,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:38:12,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1754069023, now seen corresponding path program 26 times [2018-10-14 16:38:12,318 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:38:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:38:15,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4706 backedges. 0 proven. 4706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:38:15,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:38:15,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-14 16:38:15,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-14 16:38:15,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-14 16:38:15,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=3369, Unknown=0, NotChecked=0, Total=3540 [2018-10-14 16:38:15,239 INFO L87 Difference]: Start difference. First operand 389 states and 389 transitions. Second operand 60 states. [2018-10-14 16:38:27,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:38:27,884 INFO L93 Difference]: Finished difference Result 415 states and 415 transitions. [2018-10-14 16:38:27,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-14 16:38:27,884 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 388 [2018-10-14 16:38:27,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:38:27,886 INFO L225 Difference]: With dead ends: 415 [2018-10-14 16:38:27,887 INFO L226 Difference]: Without dead ends: 415 [2018-10-14 16:38:27,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3375 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1019, Invalid=19287, Unknown=0, NotChecked=0, Total=20306 [2018-10-14 16:38:27,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-10-14 16:38:27,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 403. [2018-10-14 16:38:27,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-14 16:38:27,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 403 transitions. [2018-10-14 16:38:27,892 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 403 transitions. Word has length 388 [2018-10-14 16:38:27,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:38:27,892 INFO L481 AbstractCegarLoop]: Abstraction has 403 states and 403 transitions. [2018-10-14 16:38:27,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-14 16:38:27,893 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 403 transitions. [2018-10-14 16:38:27,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-10-14 16:38:27,895 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:38:27,895 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:38:27,895 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:38:27,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:38:27,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1416741717, now seen corresponding path program 27 times [2018-10-14 16:38:27,896 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:38:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:38:30,948 INFO L134 CoverageAnalysis]: Checked inductivity of 5076 backedges. 0 proven. 5076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:38:30,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:38:30,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-14 16:38:30,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-14 16:38:30,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-14 16:38:30,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=3605, Unknown=0, NotChecked=0, Total=3782 [2018-10-14 16:38:30,949 INFO L87 Difference]: Start difference. First operand 403 states and 403 transitions. Second operand 62 states. [2018-10-14 16:38:44,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:38:44,604 INFO L93 Difference]: Finished difference Result 429 states and 429 transitions. [2018-10-14 16:38:44,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-14 16:38:44,604 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 402 [2018-10-14 16:38:44,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:38:44,607 INFO L225 Difference]: With dead ends: 429 [2018-10-14 16:38:44,607 INFO L226 Difference]: Without dead ends: 429 [2018-10-14 16:38:44,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3626 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1056, Invalid=20700, Unknown=0, NotChecked=0, Total=21756 [2018-10-14 16:38:44,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-10-14 16:38:44,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 417. [2018-10-14 16:38:44,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-10-14 16:38:44,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 417 transitions. [2018-10-14 16:38:44,613 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 417 transitions. Word has length 402 [2018-10-14 16:38:44,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:38:44,614 INFO L481 AbstractCegarLoop]: Abstraction has 417 states and 417 transitions. [2018-10-14 16:38:44,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-14 16:38:44,614 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 417 transitions. [2018-10-14 16:38:44,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-10-14 16:38:44,616 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:38:44,616 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:38:44,617 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:38:44,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:38:44,617 INFO L82 PathProgramCache]: Analyzing trace with hash 2063164361, now seen corresponding path program 28 times [2018-10-14 16:38:44,618 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:38:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:38:48,103 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:38:48,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:38:48,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-14 16:38:48,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-14 16:38:48,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-14 16:38:48,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=3849, Unknown=0, NotChecked=0, Total=4032 [2018-10-14 16:38:48,104 INFO L87 Difference]: Start difference. First operand 417 states and 417 transitions. Second operand 64 states. [2018-10-14 16:39:02,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:39:02,466 INFO L93 Difference]: Finished difference Result 443 states and 443 transitions. [2018-10-14 16:39:02,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-14 16:39:02,467 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 416 [2018-10-14 16:39:02,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:39:02,469 INFO L225 Difference]: With dead ends: 443 [2018-10-14 16:39:02,469 INFO L226 Difference]: Without dead ends: 443 [2018-10-14 16:39:02,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3886 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=1093, Invalid=22163, Unknown=0, NotChecked=0, Total=23256 [2018-10-14 16:39:02,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-10-14 16:39:02,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 431. [2018-10-14 16:39:02,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-10-14 16:39:02,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 431 transitions. [2018-10-14 16:39:02,475 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 431 transitions. Word has length 416 [2018-10-14 16:39:02,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:39:02,475 INFO L481 AbstractCegarLoop]: Abstraction has 431 states and 431 transitions. [2018-10-14 16:39:02,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-14 16:39:02,476 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 431 transitions. [2018-10-14 16:39:02,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-10-14 16:39:02,478 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:39:02,478 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:39:02,479 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:39:02,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:39:02,479 INFO L82 PathProgramCache]: Analyzing trace with hash 51718461, now seen corresponding path program 29 times [2018-10-14 16:39:02,480 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:39:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:39:04,339 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-14 16:39:06,702 INFO L134 CoverageAnalysis]: Checked inductivity of 5858 backedges. 0 proven. 5858 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:39:06,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:39:06,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-14 16:39:06,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-14 16:39:06,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-14 16:39:06,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=4101, Unknown=0, NotChecked=0, Total=4290 [2018-10-14 16:39:06,704 INFO L87 Difference]: Start difference. First operand 431 states and 431 transitions. Second operand 66 states. [2018-10-14 16:39:21,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:39:21,839 INFO L93 Difference]: Finished difference Result 457 states and 457 transitions. [2018-10-14 16:39:21,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-14 16:39:21,840 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 430 [2018-10-14 16:39:21,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:39:21,842 INFO L225 Difference]: With dead ends: 457 [2018-10-14 16:39:21,842 INFO L226 Difference]: Without dead ends: 457 [2018-10-14 16:39:21,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4155 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=1130, Invalid=23676, Unknown=0, NotChecked=0, Total=24806 [2018-10-14 16:39:21,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-10-14 16:39:21,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 445. [2018-10-14 16:39:21,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-10-14 16:39:21,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 445 transitions. [2018-10-14 16:39:21,848 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 445 transitions. Word has length 430 [2018-10-14 16:39:21,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:39:21,849 INFO L481 AbstractCegarLoop]: Abstraction has 445 states and 445 transitions. [2018-10-14 16:39:21,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-14 16:39:21,849 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 445 transitions. [2018-10-14 16:39:21,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2018-10-14 16:39:21,851 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:39:21,852 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:39:21,852 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:39:21,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:39:21,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1344295857, now seen corresponding path program 30 times [2018-10-14 16:39:21,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:39:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:39:26,844 INFO L134 CoverageAnalysis]: Checked inductivity of 6270 backedges. 0 proven. 6270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:39:26,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:39:26,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-14 16:39:26,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-14 16:39:26,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-14 16:39:26,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=4361, Unknown=0, NotChecked=0, Total=4556 [2018-10-14 16:39:26,846 INFO L87 Difference]: Start difference. First operand 445 states and 445 transitions. Second operand 68 states. [2018-10-14 16:39:42,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:39:42,917 INFO L93 Difference]: Finished difference Result 471 states and 471 transitions. [2018-10-14 16:39:42,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-14 16:39:42,917 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 444 [2018-10-14 16:39:42,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:39:42,919 INFO L225 Difference]: With dead ends: 471 [2018-10-14 16:39:42,920 INFO L226 Difference]: Without dead ends: 471 [2018-10-14 16:39:42,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4433 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=1167, Invalid=25239, Unknown=0, NotChecked=0, Total=26406 [2018-10-14 16:39:42,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-10-14 16:39:42,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 459. [2018-10-14 16:39:42,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-10-14 16:39:42,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 459 transitions. [2018-10-14 16:39:42,926 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 459 transitions. Word has length 444 [2018-10-14 16:39:42,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:39:42,926 INFO L481 AbstractCegarLoop]: Abstraction has 459 states and 459 transitions. [2018-10-14 16:39:42,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-14 16:39:42,926 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 459 transitions. [2018-10-14 16:39:42,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2018-10-14 16:39:42,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:39:42,929 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:39:42,929 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:39:42,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:39:42,930 INFO L82 PathProgramCache]: Analyzing trace with hash 616964901, now seen corresponding path program 31 times [2018-10-14 16:39:42,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:39:42,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:39:47,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6696 backedges. 0 proven. 6696 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:39:47,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:39:47,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-10-14 16:39:47,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-14 16:39:47,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-14 16:39:47,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=4629, Unknown=0, NotChecked=0, Total=4830 [2018-10-14 16:39:47,592 INFO L87 Difference]: Start difference. First operand 459 states and 459 transitions. Second operand 70 states. [2018-10-14 16:40:04,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:40:04,912 INFO L93 Difference]: Finished difference Result 485 states and 485 transitions. [2018-10-14 16:40:04,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-14 16:40:04,913 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 458 [2018-10-14 16:40:04,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:40:04,915 INFO L225 Difference]: With dead ends: 485 [2018-10-14 16:40:04,915 INFO L226 Difference]: Without dead ends: 485 [2018-10-14 16:40:04,916 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=1204, Invalid=26852, Unknown=0, NotChecked=0, Total=28056 [2018-10-14 16:40:04,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-10-14 16:40:04,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 473. [2018-10-14 16:40:04,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-10-14 16:40:04,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 473 transitions. [2018-10-14 16:40:04,921 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 473 transitions. Word has length 458 [2018-10-14 16:40:04,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:40:04,921 INFO L481 AbstractCegarLoop]: Abstraction has 473 states and 473 transitions. [2018-10-14 16:40:04,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-14 16:40:04,921 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 473 transitions. [2018-10-14 16:40:04,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2018-10-14 16:40:04,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:40:04,923 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 32, 32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:40:04,923 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:40:04,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:40:04,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1761486951, now seen corresponding path program 32 times [2018-10-14 16:40:04,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:40:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:40:06,034 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-14 16:40:09,885 INFO L134 CoverageAnalysis]: Checked inductivity of 7136 backedges. 0 proven. 7136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:40:09,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:40:09,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-14 16:40:09,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-14 16:40:09,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-14 16:40:09,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=4905, Unknown=0, NotChecked=0, Total=5112 [2018-10-14 16:40:09,887 INFO L87 Difference]: Start difference. First operand 473 states and 473 transitions. Second operand 72 states. [2018-10-14 16:40:28,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:40:28,100 INFO L93 Difference]: Finished difference Result 499 states and 499 transitions. [2018-10-14 16:40:28,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-14 16:40:28,101 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 472 [2018-10-14 16:40:28,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:40:28,103 INFO L225 Difference]: With dead ends: 499 [2018-10-14 16:40:28,103 INFO L226 Difference]: Without dead ends: 499 [2018-10-14 16:40:28,104 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5016 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=1241, Invalid=28515, Unknown=0, NotChecked=0, Total=29756 [2018-10-14 16:40:28,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-10-14 16:40:28,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 487. [2018-10-14 16:40:28,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-10-14 16:40:28,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 487 transitions. [2018-10-14 16:40:28,109 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 487 transitions. Word has length 472 [2018-10-14 16:40:28,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:40:28,110 INFO L481 AbstractCegarLoop]: Abstraction has 487 states and 487 transitions. [2018-10-14 16:40:28,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-14 16:40:28,110 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 487 transitions. [2018-10-14 16:40:28,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2018-10-14 16:40:28,113 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:40:28,113 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:40:28,114 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:40:28,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:40:28,114 INFO L82 PathProgramCache]: Analyzing trace with hash 69120269, now seen corresponding path program 33 times [2018-10-14 16:40:28,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:40:28,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:40:32,712 INFO L134 CoverageAnalysis]: Checked inductivity of 7590 backedges. 0 proven. 7590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:40:32,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:40:32,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-10-14 16:40:32,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-14 16:40:32,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-14 16:40:32,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=5189, Unknown=0, NotChecked=0, Total=5402 [2018-10-14 16:40:32,714 INFO L87 Difference]: Start difference. First operand 487 states and 487 transitions. Second operand 74 states. [2018-10-14 16:40:52,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:40:52,117 INFO L93 Difference]: Finished difference Result 513 states and 513 transitions. [2018-10-14 16:40:52,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-14 16:40:52,118 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 486 [2018-10-14 16:40:52,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:40:52,120 INFO L225 Difference]: With dead ends: 513 [2018-10-14 16:40:52,120 INFO L226 Difference]: Without dead ends: 513 [2018-10-14 16:40:52,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5321 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=1278, Invalid=30228, Unknown=0, NotChecked=0, Total=31506 [2018-10-14 16:40:52,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-10-14 16:40:52,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 501. [2018-10-14 16:40:52,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2018-10-14 16:40:52,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 501 transitions. [2018-10-14 16:40:52,127 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 501 transitions. Word has length 486 [2018-10-14 16:40:52,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:40:52,127 INFO L481 AbstractCegarLoop]: Abstraction has 501 states and 501 transitions. [2018-10-14 16:40:52,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-14 16:40:52,128 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 501 transitions. [2018-10-14 16:40:52,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2018-10-14 16:40:52,130 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:40:52,131 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 34, 34, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:40:52,131 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:40:52,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:40:52,132 INFO L82 PathProgramCache]: Analyzing trace with hash 79163265, now seen corresponding path program 34 times [2018-10-14 16:40:52,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:40:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:40:56,896 INFO L134 CoverageAnalysis]: Checked inductivity of 8058 backedges. 0 proven. 8058 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:40:56,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:40:56,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-10-14 16:40:56,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-14 16:40:56,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-14 16:40:56,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=5481, Unknown=0, NotChecked=0, Total=5700 [2018-10-14 16:40:56,898 INFO L87 Difference]: Start difference. First operand 501 states and 501 transitions. Second operand 76 states. [2018-10-14 16:41:17,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:41:17,783 INFO L93 Difference]: Finished difference Result 527 states and 527 transitions. [2018-10-14 16:41:17,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-14 16:41:17,784 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 500 [2018-10-14 16:41:17,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:41:17,786 INFO L225 Difference]: With dead ends: 527 [2018-10-14 16:41:17,787 INFO L226 Difference]: Without dead ends: 527 [2018-10-14 16:41:17,788 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5635 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=1315, Invalid=31991, Unknown=0, NotChecked=0, Total=33306 [2018-10-14 16:41:17,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-10-14 16:41:17,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 515. [2018-10-14 16:41:17,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-10-14 16:41:17,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 515 transitions. [2018-10-14 16:41:17,794 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 515 transitions. Word has length 500 [2018-10-14 16:41:17,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:41:17,794 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 515 transitions. [2018-10-14 16:41:17,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-14 16:41:17,794 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 515 transitions. [2018-10-14 16:41:17,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-10-14 16:41:17,797 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:41:17,798 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:41:17,798 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:41:17,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:41:17,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1622725365, now seen corresponding path program 35 times [2018-10-14 16:41:17,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:41:17,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:41:22,896 INFO L134 CoverageAnalysis]: Checked inductivity of 8540 backedges. 0 proven. 8540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:41:22,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:41:22,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-14 16:41:22,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-14 16:41:22,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-14 16:41:22,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=5781, Unknown=0, NotChecked=0, Total=6006 [2018-10-14 16:41:22,898 INFO L87 Difference]: Start difference. First operand 515 states and 515 transitions. Second operand 78 states. [2018-10-14 16:41:44,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:41:44,280 INFO L93 Difference]: Finished difference Result 541 states and 541 transitions. [2018-10-14 16:41:44,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-14 16:41:44,281 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 514 [2018-10-14 16:41:44,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:41:44,283 INFO L225 Difference]: With dead ends: 541 [2018-10-14 16:41:44,283 INFO L226 Difference]: Without dead ends: 541 [2018-10-14 16:41:44,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5958 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=1352, Invalid=33804, Unknown=0, NotChecked=0, Total=35156 [2018-10-14 16:41:44,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2018-10-14 16:41:44,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 529. [2018-10-14 16:41:44,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-10-14 16:41:44,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 529 transitions. [2018-10-14 16:41:44,288 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 529 transitions. Word has length 514 [2018-10-14 16:41:44,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:41:44,289 INFO L481 AbstractCegarLoop]: Abstraction has 529 states and 529 transitions. [2018-10-14 16:41:44,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-14 16:41:44,289 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 529 transitions. [2018-10-14 16:41:44,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2018-10-14 16:41:44,292 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:41:44,293 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 36, 36, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:41:44,293 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:41:44,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:41:44,293 INFO L82 PathProgramCache]: Analyzing trace with hash 56400745, now seen corresponding path program 36 times [2018-10-14 16:41:44,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:41:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:41:49,468 INFO L134 CoverageAnalysis]: Checked inductivity of 9036 backedges. 0 proven. 9036 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:41:49,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:41:49,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-10-14 16:41:49,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-14 16:41:49,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-14 16:41:49,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=6089, Unknown=0, NotChecked=0, Total=6320 [2018-10-14 16:41:49,470 INFO L87 Difference]: Start difference. First operand 529 states and 529 transitions. Second operand 80 states. [2018-10-14 16:42:12,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:42:12,657 INFO L93 Difference]: Finished difference Result 555 states and 555 transitions. [2018-10-14 16:42:12,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-14 16:42:12,658 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 528 [2018-10-14 16:42:12,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:42:12,660 INFO L225 Difference]: With dead ends: 555 [2018-10-14 16:42:12,660 INFO L226 Difference]: Without dead ends: 555 [2018-10-14 16:42:12,661 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6290 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=1389, Invalid=35667, Unknown=0, NotChecked=0, Total=37056 [2018-10-14 16:42:12,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-10-14 16:42:12,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 543. [2018-10-14 16:42:12,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2018-10-14 16:42:12,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 543 transitions. [2018-10-14 16:42:12,666 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 543 transitions. Word has length 528 [2018-10-14 16:42:12,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:42:12,667 INFO L481 AbstractCegarLoop]: Abstraction has 543 states and 543 transitions. [2018-10-14 16:42:12,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-14 16:42:12,667 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 543 transitions. [2018-10-14 16:42:12,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2018-10-14 16:42:12,670 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:42:12,671 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 37, 37, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:42:12,671 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:42:12,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:42:12,672 INFO L82 PathProgramCache]: Analyzing trace with hash -282162979, now seen corresponding path program 37 times [2018-10-14 16:42:12,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:42:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:42:17,833 INFO L134 CoverageAnalysis]: Checked inductivity of 9546 backedges. 0 proven. 9546 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:42:17,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:42:17,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-10-14 16:42:17,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-14 16:42:17,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-14 16:42:17,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=6405, Unknown=0, NotChecked=0, Total=6642 [2018-10-14 16:42:17,835 INFO L87 Difference]: Start difference. First operand 543 states and 543 transitions. Second operand 82 states. [2018-10-14 16:42:41,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:42:41,995 INFO L93 Difference]: Finished difference Result 569 states and 569 transitions. [2018-10-14 16:42:41,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-14 16:42:41,995 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 542 [2018-10-14 16:42:41,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:42:41,997 INFO L225 Difference]: With dead ends: 569 [2018-10-14 16:42:41,997 INFO L226 Difference]: Without dead ends: 569 [2018-10-14 16:42:41,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6631 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=1426, Invalid=37580, Unknown=0, NotChecked=0, Total=39006 [2018-10-14 16:42:41,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-10-14 16:42:42,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 557. [2018-10-14 16:42:42,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2018-10-14 16:42:42,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 557 transitions. [2018-10-14 16:42:42,003 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 557 transitions. Word has length 542 [2018-10-14 16:42:42,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:42:42,003 INFO L481 AbstractCegarLoop]: Abstraction has 557 states and 557 transitions. [2018-10-14 16:42:42,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-14 16:42:42,003 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 557 transitions. [2018-10-14 16:42:42,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2018-10-14 16:42:42,007 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:42:42,007 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 38, 38, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:42:42,007 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:42:42,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:42:42,008 INFO L82 PathProgramCache]: Analyzing trace with hash 839506769, now seen corresponding path program 38 times [2018-10-14 16:42:42,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:42:42,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:42:47,665 INFO L134 CoverageAnalysis]: Checked inductivity of 10070 backedges. 0 proven. 10070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:42:47,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:42:47,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-10-14 16:42:47,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-14 16:42:47,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-14 16:42:47,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=6729, Unknown=0, NotChecked=0, Total=6972 [2018-10-14 16:42:47,667 INFO L87 Difference]: Start difference. First operand 557 states and 557 transitions. Second operand 84 states. [2018-10-14 16:43:13,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:43:13,041 INFO L93 Difference]: Finished difference Result 583 states and 583 transitions. [2018-10-14 16:43:13,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-14 16:43:13,042 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 556 [2018-10-14 16:43:13,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:43:13,045 INFO L225 Difference]: With dead ends: 583 [2018-10-14 16:43:13,045 INFO L226 Difference]: Without dead ends: 583 [2018-10-14 16:43:13,046 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6981 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=1463, Invalid=39543, Unknown=0, NotChecked=0, Total=41006 [2018-10-14 16:43:13,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2018-10-14 16:43:13,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 571. [2018-10-14 16:43:13,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2018-10-14 16:43:13,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 571 transitions. [2018-10-14 16:43:13,050 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 571 transitions. Word has length 556 [2018-10-14 16:43:13,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:43:13,051 INFO L481 AbstractCegarLoop]: Abstraction has 571 states and 571 transitions. [2018-10-14 16:43:13,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-14 16:43:13,051 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 571 transitions. [2018-10-14 16:43:13,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2018-10-14 16:43:13,055 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:43:13,055 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 39, 39, 39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:43:13,055 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:43:13,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:43:13,056 INFO L82 PathProgramCache]: Analyzing trace with hash -652619067, now seen corresponding path program 39 times [2018-10-14 16:43:13,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:43:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:43:19,329 INFO L134 CoverageAnalysis]: Checked inductivity of 10608 backedges. 0 proven. 10608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:43:19,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:43:19,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-10-14 16:43:19,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-14 16:43:19,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-14 16:43:19,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=7061, Unknown=0, NotChecked=0, Total=7310 [2018-10-14 16:43:19,331 INFO L87 Difference]: Start difference. First operand 571 states and 571 transitions. Second operand 86 states. [2018-10-14 16:43:45,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:43:45,648 INFO L93 Difference]: Finished difference Result 597 states and 597 transitions. [2018-10-14 16:43:45,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-14 16:43:45,648 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 570 [2018-10-14 16:43:45,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:43:45,650 INFO L225 Difference]: With dead ends: 597 [2018-10-14 16:43:45,651 INFO L226 Difference]: Without dead ends: 597 [2018-10-14 16:43:45,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7340 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=1500, Invalid=41556, Unknown=0, NotChecked=0, Total=43056 [2018-10-14 16:43:45,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-10-14 16:43:45,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 585. [2018-10-14 16:43:45,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2018-10-14 16:43:45,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 585 transitions. [2018-10-14 16:43:45,657 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 585 transitions. Word has length 570 [2018-10-14 16:43:45,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:43:45,658 INFO L481 AbstractCegarLoop]: Abstraction has 585 states and 585 transitions. [2018-10-14 16:43:45,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-14 16:43:45,658 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 585 transitions. [2018-10-14 16:43:45,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2018-10-14 16:43:45,662 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:43:45,662 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 40, 40, 40, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:43:45,663 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:43:45,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:43:45,663 INFO L82 PathProgramCache]: Analyzing trace with hash -455495879, now seen corresponding path program 40 times [2018-10-14 16:43:45,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:43:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:43:51,933 INFO L134 CoverageAnalysis]: Checked inductivity of 11160 backedges. 0 proven. 11160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:43:51,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:43:51,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-10-14 16:43:51,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-14 16:43:51,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-14 16:43:51,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=7401, Unknown=0, NotChecked=0, Total=7656 [2018-10-14 16:43:51,935 INFO L87 Difference]: Start difference. First operand 585 states and 585 transitions. Second operand 88 states.