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/20170304-DifficultPathPrograms/simple4.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 15:09:15,680 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 15:09:15,683 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 15:09:15,698 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 15:09:15,698 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 15:09:15,700 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 15:09:15,702 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 15:09:15,704 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 15:09:15,707 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 15:09:15,708 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 15:09:15,709 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 15:09:15,710 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 15:09:15,711 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 15:09:15,713 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 15:09:15,717 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 15:09:15,718 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 15:09:15,720 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 15:09:15,722 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 15:09:15,730 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 15:09:15,735 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 15:09:15,737 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 15:09:15,738 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 15:09:15,741 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 15:09:15,741 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 15:09:15,742 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 15:09:15,742 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 15:09:15,744 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 15:09:15,747 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 15:09:15,749 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 15:09:15,750 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 15:09:15,750 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 15:09:15,752 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 15:09:15,752 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 15:09:15,752 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 15:09:15,753 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 15:09:15,754 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 15:09:15,755 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-15 15:09:15,771 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 15:09:15,771 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 15:09:15,772 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 15:09:15,772 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 15:09:15,774 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 15:09:15,774 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 15:09:15,774 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 15:09:15,775 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 15:09:15,775 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 15:09:15,775 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 15:09:15,775 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 15:09:15,776 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 15:09:15,776 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 15:09:15,777 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 15:09:15,777 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 15:09:15,825 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 15:09:15,838 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 15:09:15,842 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 15:09:15,843 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 15:09:15,844 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 15:09:15,845 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/simple4.i_3.bpl [2018-10-15 15:09:15,845 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/simple4.i_3.bpl' [2018-10-15 15:09:15,896 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 15:09:15,898 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 15:09:15,899 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 15:09:15,899 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 15:09:15,899 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 15:09:15,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:09:15" (1/1) ... [2018-10-15 15:09:15,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:09:15" (1/1) ... [2018-10-15 15:09:15,935 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:09:15" (1/1) ... [2018-10-15 15:09:15,936 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:09:15" (1/1) ... [2018-10-15 15:09:15,938 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:09:15" (1/1) ... [2018-10-15 15:09:15,940 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:09:15" (1/1) ... [2018-10-15 15:09:15,941 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:09:15" (1/1) ... [2018-10-15 15:09:15,942 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 15:09:15,943 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 15:09:15,943 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 15:09:15,943 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 15:09:15,944 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:09:15" (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-15 15:09:16,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 15:09:16,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 15:09:16,210 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 15:09:16,211 INFO L202 PluginConnector]: Adding new model simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:09:16 BoogieIcfgContainer [2018-10-15 15:09:16,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 15:09:16,212 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 15:09:16,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 15:09:16,216 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 15:09:16,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:09:15" (1/2) ... [2018-10-15 15:09:16,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d18b420 and model type simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:09:16, skipping insertion in model container [2018-10-15 15:09:16,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:09:16" (2/2) ... [2018-10-15 15:09:16,219 INFO L112 eAbstractionObserver]: Analyzing ICFG simple4.i_3.bpl [2018-10-15 15:09:16,230 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 15:09:16,238 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 15:09:16,252 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 15:09:16,276 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 15:09:16,277 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 15:09:16,277 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 15:09:16,277 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 15:09:16,277 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 15:09:16,277 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 15:09:16,278 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 15:09:16,278 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 15:09:16,278 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 15:09:16,294 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2018-10-15 15:09:16,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-15 15:09:16,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:16,302 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:16,303 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:16,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:16,310 INFO L82 PathProgramCache]: Analyzing trace with hash 2066233707, now seen corresponding path program 1 times [2018-10-15 15:09:16,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:16,542 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-15 15:09:16,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:09:16,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:09:16,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:09:16,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:09:16,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:09:16,582 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2018-10-15 15:09:16,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:16,676 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-10-15 15:09:16,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:09:16,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-10-15 15:09:16,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:16,689 INFO L225 Difference]: With dead ends: 16 [2018-10-15 15:09:16,689 INFO L226 Difference]: Without dead ends: 16 [2018-10-15 15:09:16,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:09:16,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-15 15:09:16,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-10-15 15:09:16,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-15 15:09:16,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-15 15:09:16,727 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2018-10-15 15:09:16,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:16,727 INFO L481 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-15 15:09:16,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:09:16,728 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-15 15:09:16,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-15 15:09:16,728 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:16,728 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:16,729 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:16,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:16,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1769120688, now seen corresponding path program 1 times [2018-10-15 15:09:16,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:16,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:16,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:09:16,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:09:16,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-10-15 15:09:16,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 15:09:16,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 15:09:16,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:09:16,872 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 4 states. [2018-10-15 15:09:16,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:16,954 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-15 15:09:16,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 15:09:16,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-10-15 15:09:16,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:16,955 INFO L225 Difference]: With dead ends: 19 [2018-10-15 15:09:16,955 INFO L226 Difference]: Without dead ends: 19 [2018-10-15 15:09:16,956 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:09:16,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-15 15:09:16,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-10-15 15:09:16,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-15 15:09:16,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-10-15 15:09:16,959 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 14 [2018-10-15 15:09:16,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:16,960 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-10-15 15:09:16,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 15:09:16,960 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-10-15 15:09:16,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-15 15:09:16,961 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:16,961 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:16,961 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:16,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:16,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1796926645, now seen corresponding path program 2 times [2018-10-15 15:09:16,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:16,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:17,103 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:09:17,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:09:17,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 15:09:17,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 15:09:17,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 15:09:17,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 15:09:17,106 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 5 states. [2018-10-15 15:09:17,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:17,312 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-10-15 15:09:17,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 15:09:17,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-10-15 15:09:17,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:17,314 INFO L225 Difference]: With dead ends: 22 [2018-10-15 15:09:17,314 INFO L226 Difference]: Without dead ends: 22 [2018-10-15 15:09:17,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 15:09:17,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-15 15:09:17,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-10-15 15:09:17,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-15 15:09:17,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-15 15:09:17,319 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 17 [2018-10-15 15:09:17,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:17,319 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-15 15:09:17,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 15:09:17,320 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-15 15:09:17,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-15 15:09:17,320 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:17,321 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:17,321 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:17,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:17,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1235503504, now seen corresponding path program 3 times [2018-10-15 15:09:17,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:17,649 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:09:17,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:09:17,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-15 15:09:17,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-15 15:09:17,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-15 15:09:17,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-15 15:09:17,651 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 6 states. [2018-10-15 15:09:17,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:17,729 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-15 15:09:17,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 15:09:17,731 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-10-15 15:09:17,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:17,733 INFO L225 Difference]: With dead ends: 25 [2018-10-15 15:09:17,733 INFO L226 Difference]: Without dead ends: 25 [2018-10-15 15:09:17,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-15 15:09:17,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-15 15:09:17,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-10-15 15:09:17,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-15 15:09:17,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-10-15 15:09:17,738 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 20 [2018-10-15 15:09:17,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:17,738 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-10-15 15:09:17,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-15 15:09:17,738 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-10-15 15:09:17,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-15 15:09:17,739 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:17,739 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:17,740 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:17,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:17,740 INFO L82 PathProgramCache]: Analyzing trace with hash -481360597, now seen corresponding path program 4 times [2018-10-15 15:09:17,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:18,002 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-15 15:09:18,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:09:18,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 15:09:18,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 15:09:18,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 15:09:18,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 15:09:18,006 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 7 states. [2018-10-15 15:09:18,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:18,166 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-10-15 15:09:18,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 15:09:18,167 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-10-15 15:09:18,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:18,168 INFO L225 Difference]: With dead ends: 28 [2018-10-15 15:09:18,168 INFO L226 Difference]: Without dead ends: 28 [2018-10-15 15:09:18,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 15:09:18,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-15 15:09:18,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-10-15 15:09:18,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-15 15:09:18,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-15 15:09:18,174 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 23 [2018-10-15 15:09:18,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:18,174 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-15 15:09:18,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 15:09:18,174 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-15 15:09:18,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-15 15:09:18,175 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:18,175 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:18,176 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:18,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:18,176 INFO L82 PathProgramCache]: Analyzing trace with hash -783943536, now seen corresponding path program 5 times [2018-10-15 15:09:18,177 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:18,439 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:09:18,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:09:18,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 15:09:18,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 15:09:18,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 15:09:18,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:09:18,441 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 8 states. [2018-10-15 15:09:18,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:18,967 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-15 15:09:18,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-15 15:09:18,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-10-15 15:09:18,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:18,971 INFO L225 Difference]: With dead ends: 31 [2018-10-15 15:09:18,971 INFO L226 Difference]: Without dead ends: 31 [2018-10-15 15:09:18,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:09:18,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-15 15:09:18,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-10-15 15:09:18,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-15 15:09:18,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-10-15 15:09:18,975 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 26 [2018-10-15 15:09:18,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:18,976 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-10-15 15:09:18,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 15:09:18,976 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-10-15 15:09:18,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-15 15:09:18,977 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:18,977 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:18,978 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:18,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:18,978 INFO L82 PathProgramCache]: Analyzing trace with hash 104075019, now seen corresponding path program 6 times [2018-10-15 15:09:18,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:19,252 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:09:19,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:09:19,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 15:09:19,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 15:09:19,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 15:09:19,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 15:09:19,253 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 9 states. [2018-10-15 15:09:19,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:19,402 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-10-15 15:09:19,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 15:09:19,402 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-10-15 15:09:19,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:19,403 INFO L225 Difference]: With dead ends: 34 [2018-10-15 15:09:19,404 INFO L226 Difference]: Without dead ends: 34 [2018-10-15 15:09:19,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 15:09:19,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-15 15:09:19,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-10-15 15:09:19,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-15 15:09:19,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-15 15:09:19,408 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 29 [2018-10-15 15:09:19,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:19,409 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-15 15:09:19,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 15:09:19,409 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-15 15:09:19,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-15 15:09:19,410 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:19,410 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:19,410 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:19,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:19,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1933696336, now seen corresponding path program 7 times [2018-10-15 15:09:19,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:19,608 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:09:19,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:09:19,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 15:09:19,609 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 15:09:19,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 15:09:19,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-15 15:09:19,610 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 10 states. [2018-10-15 15:09:19,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:19,836 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-10-15 15:09:19,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 15:09:19,837 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-10-15 15:09:19,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:19,839 INFO L225 Difference]: With dead ends: 37 [2018-10-15 15:09:19,839 INFO L226 Difference]: Without dead ends: 37 [2018-10-15 15:09:19,840 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-15 15:09:19,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-15 15:09:19,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-10-15 15:09:19,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-15 15:09:19,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-10-15 15:09:19,844 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 32 [2018-10-15 15:09:19,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:19,845 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-10-15 15:09:19,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 15:09:19,845 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-10-15 15:09:19,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-15 15:09:19,846 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:19,846 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:19,846 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:19,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:19,847 INFO L82 PathProgramCache]: Analyzing trace with hash 182595819, now seen corresponding path program 8 times [2018-10-15 15:09:19,848 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:19,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:20,059 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:09:20,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:09:20,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 15:09:20,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 15:09:20,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 15:09:20,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-15 15:09:20,061 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 11 states. [2018-10-15 15:09:20,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:20,266 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-10-15 15:09:20,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-15 15:09:20,268 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-10-15 15:09:20,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:20,269 INFO L225 Difference]: With dead ends: 40 [2018-10-15 15:09:20,269 INFO L226 Difference]: Without dead ends: 40 [2018-10-15 15:09:20,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-15 15:09:20,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-15 15:09:20,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-10-15 15:09:20,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-15 15:09:20,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-15 15:09:20,274 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 35 [2018-10-15 15:09:20,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:20,275 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-15 15:09:20,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 15:09:20,275 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-15 15:09:20,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-15 15:09:20,276 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:20,276 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:20,277 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:20,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:20,277 INFO L82 PathProgramCache]: Analyzing trace with hash 817247440, now seen corresponding path program 9 times [2018-10-15 15:09:20,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:20,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:20,712 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:09:20,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:09:20,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 15:09:20,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 15:09:20,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 15:09:20,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-10-15 15:09:20,714 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 12 states. [2018-10-15 15:09:21,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:21,276 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-15 15:09:21,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 15:09:21,277 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-10-15 15:09:21,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:21,278 INFO L225 Difference]: With dead ends: 43 [2018-10-15 15:09:21,278 INFO L226 Difference]: Without dead ends: 43 [2018-10-15 15:09:21,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-10-15 15:09:21,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-15 15:09:21,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-10-15 15:09:21,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-15 15:09:21,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-10-15 15:09:21,285 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 38 [2018-10-15 15:09:21,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:21,285 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-10-15 15:09:21,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 15:09:21,286 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-10-15 15:09:21,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-15 15:09:21,286 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:21,287 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:21,287 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:21,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:21,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1277651659, now seen corresponding path program 10 times [2018-10-15 15:09:21,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:21,614 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:09:21,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:09:21,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 15:09:21,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 15:09:21,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 15:09:21,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 15:09:21,616 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 13 states. [2018-10-15 15:09:22,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:22,025 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-10-15 15:09:22,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 15:09:22,025 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2018-10-15 15:09:22,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:22,027 INFO L225 Difference]: With dead ends: 46 [2018-10-15 15:09:22,027 INFO L226 Difference]: Without dead ends: 46 [2018-10-15 15:09:22,028 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 15:09:22,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-15 15:09:22,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-10-15 15:09:22,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-15 15:09:22,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-15 15:09:22,033 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 41 [2018-10-15 15:09:22,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:22,033 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-15 15:09:22,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 15:09:22,034 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-15 15:09:22,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-15 15:09:22,035 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:22,035 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:22,035 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:22,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:22,036 INFO L82 PathProgramCache]: Analyzing trace with hash -945803536, now seen corresponding path program 11 times [2018-10-15 15:09:22,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:22,249 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:09:22,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:09:22,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-15 15:09:22,250 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-15 15:09:22,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-15 15:09:22,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-15 15:09:22,251 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 14 states. [2018-10-15 15:09:22,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:22,709 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-10-15 15:09:22,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-15 15:09:22,712 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-10-15 15:09:22,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:22,713 INFO L225 Difference]: With dead ends: 49 [2018-10-15 15:09:22,713 INFO L226 Difference]: Without dead ends: 49 [2018-10-15 15:09:22,714 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-15 15:09:22,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-15 15:09:22,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-10-15 15:09:22,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-15 15:09:22,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-10-15 15:09:22,718 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 44 [2018-10-15 15:09:22,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:22,718 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-10-15 15:09:22,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-15 15:09:22,719 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-10-15 15:09:22,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-15 15:09:22,720 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:22,720 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:22,720 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:22,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:22,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1381088427, now seen corresponding path program 12 times [2018-10-15 15:09:22,721 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:23,070 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:09:23,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:09:23,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 15:09:23,071 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 15:09:23,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 15:09:23,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-15 15:09:23,072 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 15 states. [2018-10-15 15:09:23,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:23,392 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-10-15 15:09:23,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 15:09:23,394 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2018-10-15 15:09:23,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:23,395 INFO L225 Difference]: With dead ends: 52 [2018-10-15 15:09:23,395 INFO L226 Difference]: Without dead ends: 52 [2018-10-15 15:09:23,396 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-15 15:09:23,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-15 15:09:23,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-10-15 15:09:23,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-15 15:09:23,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-15 15:09:23,400 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 47 [2018-10-15 15:09:23,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:23,401 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-15 15:09:23,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 15:09:23,401 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-15 15:09:23,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-15 15:09:23,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:23,402 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:23,403 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:23,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:23,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1047400720, now seen corresponding path program 13 times [2018-10-15 15:09:23,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:23,805 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:09:23,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:09:23,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-15 15:09:23,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-15 15:09:23,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-15 15:09:23,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-10-15 15:09:23,807 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 16 states. [2018-10-15 15:09:24,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:24,296 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-10-15 15:09:24,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-15 15:09:24,296 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-10-15 15:09:24,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:24,297 INFO L225 Difference]: With dead ends: 55 [2018-10-15 15:09:24,297 INFO L226 Difference]: Without dead ends: 55 [2018-10-15 15:09:24,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-10-15 15:09:24,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-15 15:09:24,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-10-15 15:09:24,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-15 15:09:24,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-10-15 15:09:24,302 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 50 [2018-10-15 15:09:24,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:24,303 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-10-15 15:09:24,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-15 15:09:24,303 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-10-15 15:09:24,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-15 15:09:24,304 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:24,304 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:24,304 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:24,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:24,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1288755573, now seen corresponding path program 14 times [2018-10-15 15:09:24,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:24,650 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:09:24,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:09:24,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 15:09:24,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 15:09:24,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 15:09:24,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-15 15:09:24,651 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 17 states. [2018-10-15 15:09:25,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:25,196 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-10-15 15:09:25,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-15 15:09:25,197 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-10-15 15:09:25,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:25,198 INFO L225 Difference]: With dead ends: 58 [2018-10-15 15:09:25,198 INFO L226 Difference]: Without dead ends: 58 [2018-10-15 15:09:25,199 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-15 15:09:25,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-15 15:09:25,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-10-15 15:09:25,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-15 15:09:25,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-10-15 15:09:25,211 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 53 [2018-10-15 15:09:25,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:25,211 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-10-15 15:09:25,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 15:09:25,211 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-10-15 15:09:25,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-15 15:09:25,212 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:25,212 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:25,213 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:25,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:25,216 INFO L82 PathProgramCache]: Analyzing trace with hash -2070815952, now seen corresponding path program 15 times [2018-10-15 15:09:25,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:26,102 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:09:26,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:09:26,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-15 15:09:26,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-15 15:09:26,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-15 15:09:26,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-10-15 15:09:26,104 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 18 states. [2018-10-15 15:09:26,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:26,643 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-10-15 15:09:26,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 15:09:26,649 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2018-10-15 15:09:26,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:26,650 INFO L225 Difference]: With dead ends: 61 [2018-10-15 15:09:26,650 INFO L226 Difference]: Without dead ends: 61 [2018-10-15 15:09:26,651 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-10-15 15:09:26,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-15 15:09:26,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-10-15 15:09:26,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-15 15:09:26,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-10-15 15:09:26,654 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 56 [2018-10-15 15:09:26,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:26,654 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-10-15 15:09:26,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-15 15:09:26,655 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-10-15 15:09:26,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-15 15:09:26,656 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:26,656 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:26,656 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:26,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:26,656 INFO L82 PathProgramCache]: Analyzing trace with hash -233985941, now seen corresponding path program 16 times [2018-10-15 15:09:26,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:27,194 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:09:27,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:09:27,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 15:09:27,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 15:09:27,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 15:09:27,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-15 15:09:27,196 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 19 states. [2018-10-15 15:09:27,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:27,969 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-10-15 15:09:27,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-15 15:09:27,970 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2018-10-15 15:09:27,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:27,970 INFO L225 Difference]: With dead ends: 64 [2018-10-15 15:09:27,971 INFO L226 Difference]: Without dead ends: 64 [2018-10-15 15:09:27,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-15 15:09:27,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-15 15:09:27,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-10-15 15:09:27,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-15 15:09:27,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-10-15 15:09:27,978 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 59 [2018-10-15 15:09:27,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:27,979 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-10-15 15:09:27,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 15:09:27,979 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-10-15 15:09:27,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-15 15:09:27,980 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:27,980 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:27,980 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:27,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:27,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1409446576, now seen corresponding path program 17 times [2018-10-15 15:09:27,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:28,729 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:09:28,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:09:28,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-15 15:09:28,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-15 15:09:28,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-15 15:09:28,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-10-15 15:09:28,730 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 20 states. [2018-10-15 15:09:29,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:29,334 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-10-15 15:09:29,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-15 15:09:29,335 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 62 [2018-10-15 15:09:29,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:29,336 INFO L225 Difference]: With dead ends: 67 [2018-10-15 15:09:29,336 INFO L226 Difference]: Without dead ends: 67 [2018-10-15 15:09:29,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-10-15 15:09:29,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-15 15:09:29,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-10-15 15:09:29,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-15 15:09:29,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-10-15 15:09:29,340 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 62 [2018-10-15 15:09:29,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:29,341 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-10-15 15:09:29,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-15 15:09:29,341 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-10-15 15:09:29,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-15 15:09:29,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:29,342 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:29,342 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:29,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:29,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1606107723, now seen corresponding path program 18 times [2018-10-15 15:09:29,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:30,445 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:09:30,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:09:30,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 15:09:30,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 15:09:30,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 15:09:30,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-15 15:09:30,447 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 21 states. [2018-10-15 15:09:31,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:31,066 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-10-15 15:09:31,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 15:09:31,066 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 65 [2018-10-15 15:09:31,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:31,067 INFO L225 Difference]: With dead ends: 70 [2018-10-15 15:09:31,068 INFO L226 Difference]: Without dead ends: 70 [2018-10-15 15:09:31,068 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-15 15:09:31,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-15 15:09:31,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-10-15 15:09:31,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-15 15:09:31,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-10-15 15:09:31,072 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 65 [2018-10-15 15:09:31,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:31,073 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-10-15 15:09:31,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 15:09:31,073 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-10-15 15:09:31,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-15 15:09:31,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:31,074 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:31,074 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:31,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:31,075 INFO L82 PathProgramCache]: Analyzing trace with hash 153298800, now seen corresponding path program 19 times [2018-10-15 15:09:31,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:31,483 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:09:31,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:09:31,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-15 15:09:31,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-15 15:09:31,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-15 15:09:31,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-10-15 15:09:31,485 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 22 states. [2018-10-15 15:09:32,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:32,103 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-10-15 15:09:32,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-15 15:09:32,104 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68 [2018-10-15 15:09:32,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:32,105 INFO L225 Difference]: With dead ends: 73 [2018-10-15 15:09:32,105 INFO L226 Difference]: Without dead ends: 73 [2018-10-15 15:09:32,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-10-15 15:09:32,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-15 15:09:32,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-10-15 15:09:32,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-15 15:09:32,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-10-15 15:09:32,109 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 68 [2018-10-15 15:09:32,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:32,109 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-10-15 15:09:32,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-15 15:09:32,109 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-10-15 15:09:32,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-15 15:09:32,110 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:32,110 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:32,111 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:32,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:32,111 INFO L82 PathProgramCache]: Analyzing trace with hash -91884501, now seen corresponding path program 20 times [2018-10-15 15:09:32,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:32,640 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:09:32,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:09:32,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 15:09:32,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 15:09:32,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 15:09:32,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-15 15:09:32,641 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 23 states. [2018-10-15 15:09:33,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:33,446 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-10-15 15:09:33,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-15 15:09:33,447 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 71 [2018-10-15 15:09:33,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:33,448 INFO L225 Difference]: With dead ends: 76 [2018-10-15 15:09:33,448 INFO L226 Difference]: Without dead ends: 76 [2018-10-15 15:09:33,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-15 15:09:33,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-15 15:09:33,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-10-15 15:09:33,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-15 15:09:33,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-10-15 15:09:33,451 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 71 [2018-10-15 15:09:33,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:33,452 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-10-15 15:09:33,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 15:09:33,452 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-10-15 15:09:33,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-15 15:09:33,453 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:33,453 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:33,453 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:33,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:33,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1391765904, now seen corresponding path program 21 times [2018-10-15 15:09:33,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:33,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:34,364 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:09:34,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:09:34,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-15 15:09:34,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-15 15:09:34,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-15 15:09:34,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-10-15 15:09:34,365 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 24 states. [2018-10-15 15:09:35,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:35,101 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-10-15 15:09:35,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 15:09:35,112 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 74 [2018-10-15 15:09:35,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:35,113 INFO L225 Difference]: With dead ends: 79 [2018-10-15 15:09:35,113 INFO L226 Difference]: Without dead ends: 79 [2018-10-15 15:09:35,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-10-15 15:09:35,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-15 15:09:35,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-10-15 15:09:35,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-15 15:09:35,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-10-15 15:09:35,115 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 74 [2018-10-15 15:09:35,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:35,115 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-10-15 15:09:35,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-15 15:09:35,116 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-10-15 15:09:35,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-15 15:09:35,116 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:35,116 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:35,117 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:35,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:35,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1312538123, now seen corresponding path program 22 times [2018-10-15 15:09:35,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:35,572 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:09:35,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:09:35,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 15:09:35,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 15:09:35,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 15:09:35,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-10-15 15:09:35,574 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 25 states. [2018-10-15 15:09:36,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:36,371 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-10-15 15:09:36,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-15 15:09:36,379 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2018-10-15 15:09:36,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:36,380 INFO L225 Difference]: With dead ends: 82 [2018-10-15 15:09:36,380 INFO L226 Difference]: Without dead ends: 82 [2018-10-15 15:09:36,380 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-10-15 15:09:36,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-15 15:09:36,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-10-15 15:09:36,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-15 15:09:36,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-10-15 15:09:36,383 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 77 [2018-10-15 15:09:36,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:36,383 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-10-15 15:09:36,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 15:09:36,383 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-10-15 15:09:36,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-15 15:09:36,384 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:36,384 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:36,384 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:36,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:36,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1025240144, now seen corresponding path program 23 times [2018-10-15 15:09:36,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:37,096 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:09:37,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:09:37,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-15 15:09:37,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-15 15:09:37,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-15 15:09:37,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-10-15 15:09:37,098 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 26 states. [2018-10-15 15:09:38,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:38,177 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-10-15 15:09:38,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-15 15:09:38,178 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 80 [2018-10-15 15:09:38,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:38,179 INFO L225 Difference]: With dead ends: 85 [2018-10-15 15:09:38,179 INFO L226 Difference]: Without dead ends: 85 [2018-10-15 15:09:38,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-10-15 15:09:38,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-15 15:09:38,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-10-15 15:09:38,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-15 15:09:38,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-10-15 15:09:38,182 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 80 [2018-10-15 15:09:38,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:38,183 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-10-15 15:09:38,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-15 15:09:38,183 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-10-15 15:09:38,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-15 15:09:38,183 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:38,184 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:38,184 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:38,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:38,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1412079595, now seen corresponding path program 24 times [2018-10-15 15:09:38,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:38,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:38,773 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:09:38,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:09:38,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 15:09:38,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 15:09:38,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 15:09:38,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-10-15 15:09:38,775 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 27 states. [2018-10-15 15:09:39,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:39,741 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-10-15 15:09:39,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 15:09:39,742 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 83 [2018-10-15 15:09:39,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:39,743 INFO L225 Difference]: With dead ends: 88 [2018-10-15 15:09:39,743 INFO L226 Difference]: Without dead ends: 88 [2018-10-15 15:09:39,744 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-10-15 15:09:39,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-10-15 15:09:39,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-10-15 15:09:39,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-15 15:09:39,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-10-15 15:09:39,746 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 83 [2018-10-15 15:09:39,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:39,747 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-10-15 15:09:39,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 15:09:39,747 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-10-15 15:09:39,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-15 15:09:39,748 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:39,748 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:39,748 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:39,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:39,748 INFO L82 PathProgramCache]: Analyzing trace with hash 887317968, now seen corresponding path program 25 times [2018-10-15 15:09:39,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:40,655 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:09:40,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:09:40,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-15 15:09:40,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-15 15:09:40,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-15 15:09:40,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-10-15 15:09:40,656 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 28 states. [2018-10-15 15:09:41,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:41,703 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-10-15 15:09:41,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-15 15:09:41,703 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 86 [2018-10-15 15:09:41,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:41,705 INFO L225 Difference]: With dead ends: 91 [2018-10-15 15:09:41,705 INFO L226 Difference]: Without dead ends: 91 [2018-10-15 15:09:41,706 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-10-15 15:09:41,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-15 15:09:41,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-10-15 15:09:41,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-10-15 15:09:41,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-10-15 15:09:41,708 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 86 [2018-10-15 15:09:41,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:41,708 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-10-15 15:09:41,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-15 15:09:41,709 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-10-15 15:09:41,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-15 15:09:41,709 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:41,709 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:41,710 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:41,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:41,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1394645451, now seen corresponding path program 26 times [2018-10-15 15:09:41,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:42,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:09:42,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:09:42,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 15:09:42,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 15:09:42,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 15:09:42,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-10-15 15:09:42,233 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 29 states. [2018-10-15 15:09:43,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:43,504 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-10-15 15:09:43,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-15 15:09:43,505 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 89 [2018-10-15 15:09:43,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:43,506 INFO L225 Difference]: With dead ends: 94 [2018-10-15 15:09:43,506 INFO L226 Difference]: Without dead ends: 94 [2018-10-15 15:09:43,507 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-10-15 15:09:43,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-15 15:09:43,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-10-15 15:09:43,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-15 15:09:43,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-10-15 15:09:43,511 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 89 [2018-10-15 15:09:43,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:43,511 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-10-15 15:09:43,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 15:09:43,511 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-10-15 15:09:43,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-15 15:09:43,512 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:43,512 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:43,512 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:43,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:43,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1197776880, now seen corresponding path program 27 times [2018-10-15 15:09:43,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:44,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:09:44,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:09:44,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-15 15:09:44,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-15 15:09:44,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-15 15:09:44,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-10-15 15:09:44,132 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 30 states. [2018-10-15 15:09:45,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:45,348 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-10-15 15:09:45,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 15:09:45,349 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 92 [2018-10-15 15:09:45,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:45,350 INFO L225 Difference]: With dead ends: 97 [2018-10-15 15:09:45,350 INFO L226 Difference]: Without dead ends: 97 [2018-10-15 15:09:45,351 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-10-15 15:09:45,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-15 15:09:45,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-10-15 15:09:45,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-15 15:09:45,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-10-15 15:09:45,353 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 92 [2018-10-15 15:09:45,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:45,354 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-10-15 15:09:45,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-15 15:09:45,354 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-10-15 15:09:45,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-15 15:09:45,355 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:45,355 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:45,355 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:45,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:45,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1083462741, now seen corresponding path program 28 times [2018-10-15 15:09:45,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:46,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:09:46,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:09:46,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 15:09:46,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 15:09:46,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 15:09:46,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-10-15 15:09:46,263 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 31 states. [2018-10-15 15:09:47,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:47,534 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-10-15 15:09:47,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-15 15:09:47,535 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 95 [2018-10-15 15:09:47,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:47,536 INFO L225 Difference]: With dead ends: 100 [2018-10-15 15:09:47,536 INFO L226 Difference]: Without dead ends: 100 [2018-10-15 15:09:47,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-10-15 15:09:47,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-10-15 15:09:47,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2018-10-15 15:09:47,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-15 15:09:47,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-10-15 15:09:47,541 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 95 [2018-10-15 15:09:47,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:47,541 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-10-15 15:09:47,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 15:09:47,541 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-10-15 15:09:47,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-15 15:09:47,542 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:47,542 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:47,542 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:47,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:47,543 INFO L82 PathProgramCache]: Analyzing trace with hash 2069479952, now seen corresponding path program 29 times [2018-10-15 15:09:47,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:48,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:09:48,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:09:48,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-15 15:09:48,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-15 15:09:48,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-15 15:09:48,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-10-15 15:09:48,641 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 32 states. [2018-10-15 15:09:50,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:50,002 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-10-15 15:09:50,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-15 15:09:50,002 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 98 [2018-10-15 15:09:50,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:50,003 INFO L225 Difference]: With dead ends: 103 [2018-10-15 15:09:50,003 INFO L226 Difference]: Without dead ends: 103 [2018-10-15 15:09:50,005 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-10-15 15:09:50,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-15 15:09:50,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-10-15 15:09:50,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-10-15 15:09:50,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-10-15 15:09:50,007 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 98 [2018-10-15 15:09:50,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:50,008 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-10-15 15:09:50,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-15 15:09:50,008 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-10-15 15:09:50,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-15 15:09:50,009 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:50,009 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:50,009 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:50,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:50,009 INFO L82 PathProgramCache]: Analyzing trace with hash 450483595, now seen corresponding path program 30 times [2018-10-15 15:09:50,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:50,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:51,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:09:51,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:09:51,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 15:09:51,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 15:09:51,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 15:09:51,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 15:09:51,373 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 33 states. [2018-10-15 15:09:52,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:52,833 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-10-15 15:09:52,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 15:09:52,833 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 101 [2018-10-15 15:09:52,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:52,835 INFO L225 Difference]: With dead ends: 106 [2018-10-15 15:09:52,835 INFO L226 Difference]: Without dead ends: 106 [2018-10-15 15:09:52,836 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 15:09:52,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-15 15:09:52,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-10-15 15:09:52,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-15 15:09:52,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-10-15 15:09:52,839 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 101 [2018-10-15 15:09:52,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:52,839 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-10-15 15:09:52,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 15:09:52,840 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-10-15 15:09:52,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-15 15:09:52,840 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:52,840 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:52,841 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:52,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:52,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1412746288, now seen corresponding path program 31 times [2018-10-15 15:09:52,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:52,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:53,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:09:53,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:09:53,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-15 15:09:53,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-15 15:09:53,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-15 15:09:53,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 15:09:53,916 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 34 states. [2018-10-15 15:09:55,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:55,467 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-10-15 15:09:55,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-15 15:09:55,468 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 104 [2018-10-15 15:09:55,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:55,469 INFO L225 Difference]: With dead ends: 109 [2018-10-15 15:09:55,469 INFO L226 Difference]: Without dead ends: 109 [2018-10-15 15:09:55,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 15:09:55,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-15 15:09:55,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2018-10-15 15:09:55,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-10-15 15:09:55,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-10-15 15:09:55,473 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 104 [2018-10-15 15:09:55,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:55,473 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-10-15 15:09:55,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-15 15:09:55,473 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-10-15 15:09:55,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-15 15:09:55,474 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:55,474 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:55,474 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:55,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:55,475 INFO L82 PathProgramCache]: Analyzing trace with hash -726067349, now seen corresponding path program 32 times [2018-10-15 15:09:55,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:56,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:09:56,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:09:56,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 15:09:56,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 15:09:56,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 15:09:56,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 15:09:56,189 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 35 states. [2018-10-15 15:09:57,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:57,779 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-10-15 15:09:57,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-15 15:09:57,779 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 107 [2018-10-15 15:09:57,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:57,780 INFO L225 Difference]: With dead ends: 112 [2018-10-15 15:09:57,780 INFO L226 Difference]: Without dead ends: 112 [2018-10-15 15:09:57,782 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 15:09:57,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-10-15 15:09:57,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2018-10-15 15:09:57,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-15 15:09:57,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-10-15 15:09:57,785 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 107 [2018-10-15 15:09:57,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:57,785 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-10-15 15:09:57,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 15:09:57,785 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-10-15 15:09:57,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-15 15:09:57,786 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:57,786 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:57,786 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:57,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:57,787 INFO L82 PathProgramCache]: Analyzing trace with hash 2011676240, now seen corresponding path program 33 times [2018-10-15 15:09:57,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:59,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:09:59,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:09:59,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-15 15:09:59,075 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-15 15:09:59,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-15 15:09:59,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-10-15 15:09:59,076 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 36 states. [2018-10-15 15:10:00,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:10:00,812 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-10-15 15:10:00,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 15:10:00,812 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 110 [2018-10-15 15:10:00,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:10:00,814 INFO L225 Difference]: With dead ends: 115 [2018-10-15 15:10:00,814 INFO L226 Difference]: Without dead ends: 115 [2018-10-15 15:10:00,814 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-10-15 15:10:00,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-15 15:10:00,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2018-10-15 15:10:00,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-10-15 15:10:00,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-10-15 15:10:00,817 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 110 [2018-10-15 15:10:00,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:10:00,817 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-10-15 15:10:00,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-15 15:10:00,818 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-10-15 15:10:00,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-15 15:10:00,818 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:10:00,818 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:10:00,819 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:10:00,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:10:00,819 INFO L82 PathProgramCache]: Analyzing trace with hash 701985099, now seen corresponding path program 34 times [2018-10-15 15:10:00,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:10:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:10:01,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:10:01,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:10:01,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 15:10:01,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 15:10:01,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 15:10:01,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 15:10:01,877 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 37 states. [2018-10-15 15:10:03,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:10:03,821 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-10-15 15:10:03,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-15 15:10:03,822 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 113 [2018-10-15 15:10:03,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:10:03,823 INFO L225 Difference]: With dead ends: 118 [2018-10-15 15:10:03,823 INFO L226 Difference]: Without dead ends: 118 [2018-10-15 15:10:03,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 15:10:03,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-10-15 15:10:03,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-10-15 15:10:03,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-15 15:10:03,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-10-15 15:10:03,827 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 113 [2018-10-15 15:10:03,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:10:03,827 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-10-15 15:10:03,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 15:10:03,827 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-10-15 15:10:03,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-15 15:10:03,828 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:10:03,828 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:10:03,828 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:10:03,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:10:03,829 INFO L82 PathProgramCache]: Analyzing trace with hash -823879568, now seen corresponding path program 35 times [2018-10-15 15:10:03,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:10:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:10:04,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:10:04,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:10:04,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-15 15:10:04,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-15 15:10:04,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-15 15:10:04,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-10-15 15:10:04,697 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 38 states. [2018-10-15 15:10:06,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:10:06,574 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-10-15 15:10:06,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-15 15:10:06,579 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 116 [2018-10-15 15:10:06,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:10:06,580 INFO L225 Difference]: With dead ends: 121 [2018-10-15 15:10:06,580 INFO L226 Difference]: Without dead ends: 121 [2018-10-15 15:10:06,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-10-15 15:10:06,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-15 15:10:06,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2018-10-15 15:10:06,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-10-15 15:10:06,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-10-15 15:10:06,583 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 116 [2018-10-15 15:10:06,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:10:06,584 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-10-15 15:10:06,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-15 15:10:06,584 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-10-15 15:10:06,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-15 15:10:06,584 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:10:06,584 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:10:06,585 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:10:06,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:10:06,585 INFO L82 PathProgramCache]: Analyzing trace with hash 75686699, now seen corresponding path program 36 times [2018-10-15 15:10:06,586 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:10:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:10:07,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:10:07,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:10:07,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 15:10:07,649 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 15:10:07,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 15:10:07,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 15:10:07,650 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 39 states. [2018-10-15 15:10:09,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:10:09,783 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-10-15 15:10:09,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 15:10:09,783 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 119 [2018-10-15 15:10:09,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:10:09,784 INFO L225 Difference]: With dead ends: 124 [2018-10-15 15:10:09,784 INFO L226 Difference]: Without dead ends: 124 [2018-10-15 15:10:09,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 15:10:09,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-10-15 15:10:09,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2018-10-15 15:10:09,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-15 15:10:09,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-10-15 15:10:09,788 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 119 [2018-10-15 15:10:09,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:10:09,789 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-10-15 15:10:09,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 15:10:09,789 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-10-15 15:10:09,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-15 15:10:09,789 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:10:09,790 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:10:09,791 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:10:09,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:10:09,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1541580144, now seen corresponding path program 37 times [2018-10-15 15:10:09,791 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:10:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:10:10,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:10:10,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:10:10,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-15 15:10:10,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-15 15:10:10,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-15 15:10:10,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 15:10:10,830 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 40 states. [2018-10-15 15:10:12,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:10:12,925 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-10-15 15:10:12,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-15 15:10:12,926 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 122 [2018-10-15 15:10:12,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:10:12,927 INFO L225 Difference]: With dead ends: 127 [2018-10-15 15:10:12,927 INFO L226 Difference]: Without dead ends: 127 [2018-10-15 15:10:12,929 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 15:10:12,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-15 15:10:12,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2018-10-15 15:10:12,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-15 15:10:12,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-10-15 15:10:12,932 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 122 [2018-10-15 15:10:12,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:10:12,932 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-10-15 15:10:12,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-15 15:10:12,932 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-10-15 15:10:12,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-15 15:10:12,933 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:10:12,933 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:10:12,933 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:10:12,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:10:12,934 INFO L82 PathProgramCache]: Analyzing trace with hash -594973429, now seen corresponding path program 38 times [2018-10-15 15:10:12,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:10:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:10:14,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:10:14,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:10:14,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 15:10:14,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 15:10:14,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 15:10:14,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 15:10:14,047 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 41 states. [2018-10-15 15:10:16,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:10:16,322 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-10-15 15:10:16,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-15 15:10:16,322 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 125 [2018-10-15 15:10:16,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:10:16,324 INFO L225 Difference]: With dead ends: 130 [2018-10-15 15:10:16,324 INFO L226 Difference]: Without dead ends: 130 [2018-10-15 15:10:16,325 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 15:10:16,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-15 15:10:16,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-10-15 15:10:16,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-15 15:10:16,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-10-15 15:10:16,328 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 125 [2018-10-15 15:10:16,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:10:16,329 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-10-15 15:10:16,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 15:10:16,329 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-10-15 15:10:16,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-15 15:10:16,329 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:10:16,329 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:10:16,330 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:10:16,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:10:16,330 INFO L82 PathProgramCache]: Analyzing trace with hash -989592400, now seen corresponding path program 39 times [2018-10-15 15:10:16,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:10:16,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:10:17,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:10:17,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:10:17,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-15 15:10:17,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-15 15:10:17,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-15 15:10:17,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 15:10:17,282 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 42 states. [2018-10-15 15:10:19,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:10:19,929 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-10-15 15:10:19,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 15:10:19,929 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 128 [2018-10-15 15:10:19,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:10:19,931 INFO L225 Difference]: With dead ends: 133 [2018-10-15 15:10:19,931 INFO L226 Difference]: Without dead ends: 133 [2018-10-15 15:10:19,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 15:10:19,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-15 15:10:19,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2018-10-15 15:10:19,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-15 15:10:19,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-10-15 15:10:19,935 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 128 [2018-10-15 15:10:19,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:10:19,936 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-10-15 15:10:19,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-15 15:10:19,936 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-10-15 15:10:19,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-15 15:10:19,937 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:10:19,937 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:10:19,937 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:10:19,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:10:19,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1757868309, now seen corresponding path program 40 times [2018-10-15 15:10:19,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:10:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:10:21,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:10:21,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:10:21,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 15:10:21,287 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 15:10:21,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 15:10:21,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 15:10:21,288 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 43 states. [2018-10-15 15:10:23,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:10:23,758 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-10-15 15:10:23,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-15 15:10:23,758 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 131 [2018-10-15 15:10:23,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:10:23,760 INFO L225 Difference]: With dead ends: 136 [2018-10-15 15:10:23,760 INFO L226 Difference]: Without dead ends: 136 [2018-10-15 15:10:23,761 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 15:10:23,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-10-15 15:10:23,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2018-10-15 15:10:23,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-15 15:10:23,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-10-15 15:10:23,764 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 131 [2018-10-15 15:10:23,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:10:23,765 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-10-15 15:10:23,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 15:10:23,765 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-10-15 15:10:23,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-15 15:10:23,766 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:10:23,766 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:10:23,766 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:10:23,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:10:23,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1584752944, now seen corresponding path program 41 times [2018-10-15 15:10:23,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:10:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:10:25,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:10:25,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:10:25,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-15 15:10:25,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-15 15:10:25,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-15 15:10:25,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-10-15 15:10:25,257 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 44 states. [2018-10-15 15:10:27,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:10:27,783 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-10-15 15:10:27,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-15 15:10:27,785 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 134 [2018-10-15 15:10:27,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:10:27,786 INFO L225 Difference]: With dead ends: 139 [2018-10-15 15:10:27,786 INFO L226 Difference]: Without dead ends: 139 [2018-10-15 15:10:27,786 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-10-15 15:10:27,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-15 15:10:27,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2018-10-15 15:10:27,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-10-15 15:10:27,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-10-15 15:10:27,789 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 134 [2018-10-15 15:10:27,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:10:27,789 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-10-15 15:10:27,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-15 15:10:27,790 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-10-15 15:10:27,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-15 15:10:27,790 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:10:27,790 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:10:27,791 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:10:27,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:10:27,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1734330571, now seen corresponding path program 42 times [2018-10-15 15:10:27,791 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:10:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:10:29,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:10:29,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:10:29,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 15:10:29,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 15:10:29,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 15:10:29,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 15:10:29,344 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 45 states. [2018-10-15 15:10:32,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:10:32,042 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-10-15 15:10:32,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 15:10:32,042 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 137 [2018-10-15 15:10:32,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:10:32,043 INFO L225 Difference]: With dead ends: 142 [2018-10-15 15:10:32,043 INFO L226 Difference]: Without dead ends: 142 [2018-10-15 15:10:32,045 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 15:10:32,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-15 15:10:32,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2018-10-15 15:10:32,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-15 15:10:32,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-10-15 15:10:32,048 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 137 [2018-10-15 15:10:32,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:10:32,049 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-10-15 15:10:32,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 15:10:32,049 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-10-15 15:10:32,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-15 15:10:32,050 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:10:32,050 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:10:32,050 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:10:32,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:10:32,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1814237424, now seen corresponding path program 43 times [2018-10-15 15:10:32,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:10:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:10:33,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:10:33,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:10:33,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-15 15:10:33,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-15 15:10:33,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-15 15:10:33,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-10-15 15:10:33,739 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 46 states. [2018-10-15 15:10:36,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:10:36,775 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-10-15 15:10:36,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-15 15:10:36,776 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 140 [2018-10-15 15:10:36,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:10:36,777 INFO L225 Difference]: With dead ends: 145 [2018-10-15 15:10:36,777 INFO L226 Difference]: Without dead ends: 145 [2018-10-15 15:10:36,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-10-15 15:10:36,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-10-15 15:10:36,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2018-10-15 15:10:36,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-10-15 15:10:36,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-10-15 15:10:36,781 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 140 [2018-10-15 15:10:36,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:10:36,782 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-10-15 15:10:36,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-15 15:10:36,782 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-10-15 15:10:36,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-15 15:10:36,783 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:10:36,783 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:10:36,783 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:10:36,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:10:36,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1387554133, now seen corresponding path program 44 times [2018-10-15 15:10:36,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:10:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:10:37,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:10:37,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:10:37,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 15:10:37,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 15:10:37,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 15:10:37,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 15:10:37,988 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 47 states. [2018-10-15 15:10:41,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:10:41,037 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-10-15 15:10:41,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-15 15:10:41,038 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 143 [2018-10-15 15:10:41,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:10:41,039 INFO L225 Difference]: With dead ends: 148 [2018-10-15 15:10:41,039 INFO L226 Difference]: Without dead ends: 148 [2018-10-15 15:10:41,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 15:10:41,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-15 15:10:41,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2018-10-15 15:10:41,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-15 15:10:41,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-10-15 15:10:41,043 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 143 [2018-10-15 15:10:41,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:10:41,044 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-10-15 15:10:41,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 15:10:41,044 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-10-15 15:10:41,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-15 15:10:41,045 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:10:41,045 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:10:41,045 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:10:41,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:10:41,045 INFO L82 PathProgramCache]: Analyzing trace with hash 968848144, now seen corresponding path program 45 times [2018-10-15 15:10:41,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:10:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:10:42,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:10:42,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:10:42,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-15 15:10:42,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-15 15:10:42,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-15 15:10:42,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 15:10:42,352 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 48 states. [2018-10-15 15:10:45,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:10:45,590 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-10-15 15:10:45,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 15:10:45,591 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 146 [2018-10-15 15:10:45,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:10:45,592 INFO L225 Difference]: With dead ends: 151 [2018-10-15 15:10:45,592 INFO L226 Difference]: Without dead ends: 151 [2018-10-15 15:10:45,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 15:10:45,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-10-15 15:10:45,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2018-10-15 15:10:45,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-10-15 15:10:45,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-10-15 15:10:45,596 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 146 [2018-10-15 15:10:45,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:10:45,596 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-10-15 15:10:45,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-15 15:10:45,596 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-10-15 15:10:45,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-15 15:10:45,597 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:10:45,597 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:10:45,597 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:10:45,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:10:45,598 INFO L82 PathProgramCache]: Analyzing trace with hash -691370869, now seen corresponding path program 46 times [2018-10-15 15:10:45,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:10:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:10:46,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:10:46,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:10:46,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 15:10:46,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 15:10:46,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 15:10:46,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 15:10:46,888 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 49 states. [2018-10-15 15:10:50,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:10:50,350 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-10-15 15:10:50,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-15 15:10:50,350 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 149 [2018-10-15 15:10:50,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:10:50,351 INFO L225 Difference]: With dead ends: 154 [2018-10-15 15:10:50,352 INFO L226 Difference]: Without dead ends: 154 [2018-10-15 15:10:50,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 15:10:50,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-15 15:10:50,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-10-15 15:10:50,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-10-15 15:10:50,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-10-15 15:10:50,355 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 149 [2018-10-15 15:10:50,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:10:50,356 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-10-15 15:10:50,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 15:10:50,356 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-10-15 15:10:50,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-15 15:10:50,356 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:10:50,356 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:10:50,357 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:10:50,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:10:50,357 INFO L82 PathProgramCache]: Analyzing trace with hash 567393584, now seen corresponding path program 47 times [2018-10-15 15:10:50,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:10:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:10:51,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:10:51,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:10:51,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-15 15:10:51,854 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-15 15:10:51,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-15 15:10:51,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 15:10:51,855 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 50 states. [2018-10-15 15:10:55,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:10:55,396 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-10-15 15:10:55,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-15 15:10:55,396 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 152 [2018-10-15 15:10:55,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:10:55,398 INFO L225 Difference]: With dead ends: 157 [2018-10-15 15:10:55,398 INFO L226 Difference]: Without dead ends: 157 [2018-10-15 15:10:55,398 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 15:10:55,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-10-15 15:10:55,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2018-10-15 15:10:55,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-15 15:10:55,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-10-15 15:10:55,401 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 152 [2018-10-15 15:10:55,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:10:55,401 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-10-15 15:10:55,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-15 15:10:55,402 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-10-15 15:10:55,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-15 15:10:55,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:10:55,402 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:10:55,402 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:10:55,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:10:55,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1059751531, now seen corresponding path program 48 times [2018-10-15 15:10:55,403 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:10:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:10:57,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:10:57,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:10:57,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 15:10:57,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 15:10:57,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 15:10:57,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 15:10:57,003 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 51 states. [2018-10-15 15:11:00,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:11:00,570 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-10-15 15:11:00,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 15:11:00,570 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 155 [2018-10-15 15:11:00,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:11:00,572 INFO L225 Difference]: With dead ends: 160 [2018-10-15 15:11:00,572 INFO L226 Difference]: Without dead ends: 160 [2018-10-15 15:11:00,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 15:11:00,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-15 15:11:00,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2018-10-15 15:11:00,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-10-15 15:11:00,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-10-15 15:11:00,576 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 155 [2018-10-15 15:11:00,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:11:00,576 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-10-15 15:11:00,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 15:11:00,576 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-10-15 15:11:00,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-15 15:11:00,577 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:11:00,577 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:11:00,577 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:11:00,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:11:00,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1582034768, now seen corresponding path program 49 times [2018-10-15 15:11:00,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:11:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:11:02,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:11:02,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:11:02,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-15 15:11:02,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-15 15:11:02,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-15 15:11:02,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-10-15 15:11:02,548 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 52 states. [2018-10-15 15:11:06,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:11:06,318 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-10-15 15:11:06,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-15 15:11:06,318 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 158 [2018-10-15 15:11:06,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:11:06,319 INFO L225 Difference]: With dead ends: 163 [2018-10-15 15:11:06,320 INFO L226 Difference]: Without dead ends: 163 [2018-10-15 15:11:06,320 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-10-15 15:11:06,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-10-15 15:11:06,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2018-10-15 15:11:06,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-15 15:11:06,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-10-15 15:11:06,323 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 158 [2018-10-15 15:11:06,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:11:06,324 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-10-15 15:11:06,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-15 15:11:06,324 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-10-15 15:11:06,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-15 15:11:06,325 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:11:06,325 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:11:06,325 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:11:06,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:11:06,325 INFO L82 PathProgramCache]: Analyzing trace with hash 255434827, now seen corresponding path program 50 times [2018-10-15 15:11:06,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:11:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:11:08,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:11:08,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:11:08,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 15:11:08,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 15:11:08,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 15:11:08,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 15:11:08,344 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 53 states. [2018-10-15 15:11:12,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:11:12,199 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-10-15 15:11:12,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-15 15:11:12,200 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 161 [2018-10-15 15:11:12,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:11:12,201 INFO L225 Difference]: With dead ends: 166 [2018-10-15 15:11:12,201 INFO L226 Difference]: Without dead ends: 166 [2018-10-15 15:11:12,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 15:11:12,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-15 15:11:12,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2018-10-15 15:11:12,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-15 15:11:12,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-10-15 15:11:12,204 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 161 [2018-10-15 15:11:12,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:11:12,205 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-10-15 15:11:12,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 15:11:12,205 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-10-15 15:11:12,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-15 15:11:12,206 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:11:12,206 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:11:12,206 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:11:12,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:11:12,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1805650288, now seen corresponding path program 51 times [2018-10-15 15:11:12,207 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:11:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:11:13,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:11:13,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:11:13,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-15 15:11:13,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-15 15:11:13,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-15 15:11:13,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-10-15 15:11:13,815 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 54 states. [2018-10-15 15:11:17,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:11:17,795 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-10-15 15:11:17,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 15:11:17,795 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 164 [2018-10-15 15:11:17,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:11:17,797 INFO L225 Difference]: With dead ends: 169 [2018-10-15 15:11:17,797 INFO L226 Difference]: Without dead ends: 169 [2018-10-15 15:11:17,798 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-10-15 15:11:17,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-15 15:11:17,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2018-10-15 15:11:17,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-10-15 15:11:17,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-10-15 15:11:17,800 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 164 [2018-10-15 15:11:17,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:11:17,800 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-10-15 15:11:17,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-15 15:11:17,801 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-10-15 15:11:17,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-15 15:11:17,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:11:17,802 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:11:17,802 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:11:17,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:11:17,802 INFO L82 PathProgramCache]: Analyzing trace with hash 491115051, now seen corresponding path program 52 times [2018-10-15 15:11:17,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:11:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:11:19,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:11:19,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:11:19,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 15:11:19,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 15:11:19,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 15:11:19,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 15:11:19,312 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 55 states. [2018-10-15 15:11:23,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:11:23,467 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2018-10-15 15:11:23,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-15 15:11:23,467 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 167 [2018-10-15 15:11:23,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:11:23,469 INFO L225 Difference]: With dead ends: 172 [2018-10-15 15:11:23,469 INFO L226 Difference]: Without dead ends: 172 [2018-10-15 15:11:23,469 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 15:11:23,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-10-15 15:11:23,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2018-10-15 15:11:23,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-15 15:11:23,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-10-15 15:11:23,472 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 167 [2018-10-15 15:11:23,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:11:23,472 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-10-15 15:11:23,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 15:11:23,472 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-10-15 15:11:23,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-15 15:11:23,473 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:11:23,473 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:11:23,473 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:11:23,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:11:23,474 INFO L82 PathProgramCache]: Analyzing trace with hash 683674512, now seen corresponding path program 53 times [2018-10-15 15:11:23,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:11:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:11:25,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:11:25,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:11:25,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-15 15:11:25,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-15 15:11:25,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-15 15:11:25,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-10-15 15:11:25,049 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 56 states. [2018-10-15 15:11:29,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:11:29,483 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-10-15 15:11:29,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-15 15:11:29,483 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 170 [2018-10-15 15:11:29,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:11:29,485 INFO L225 Difference]: With dead ends: 175 [2018-10-15 15:11:29,485 INFO L226 Difference]: Without dead ends: 175 [2018-10-15 15:11:29,486 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-10-15 15:11:29,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-10-15 15:11:29,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2018-10-15 15:11:29,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-10-15 15:11:29,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-10-15 15:11:29,487 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 170 [2018-10-15 15:11:29,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:11:29,488 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-10-15 15:11:29,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-15 15:11:29,488 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-10-15 15:11:29,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-15 15:11:29,488 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:11:29,488 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:11:29,489 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:11:29,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:11:29,489 INFO L82 PathProgramCache]: Analyzing trace with hash -853730293, now seen corresponding path program 54 times [2018-10-15 15:11:29,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:11:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:11:31,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:11:31,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:11:31,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 15:11:31,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 15:11:31,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 15:11:31,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 15:11:31,346 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 57 states. [2018-10-15 15:11:35,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:11:35,810 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-10-15 15:11:35,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 15:11:35,811 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 173 [2018-10-15 15:11:35,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:11:35,812 INFO L225 Difference]: With dead ends: 178 [2018-10-15 15:11:35,812 INFO L226 Difference]: Without dead ends: 178 [2018-10-15 15:11:35,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 15:11:35,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-10-15 15:11:35,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-10-15 15:11:35,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-15 15:11:35,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-10-15 15:11:35,815 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 173 [2018-10-15 15:11:35,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:11:35,816 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-10-15 15:11:35,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 15:11:35,816 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-10-15 15:11:35,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-15 15:11:35,816 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:11:35,816 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:11:35,817 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:11:35,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:11:35,817 INFO L82 PathProgramCache]: Analyzing trace with hash -149031504, now seen corresponding path program 55 times [2018-10-15 15:11:35,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:11:35,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:11:37,451 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:11:37,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:11:37,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-15 15:11:37,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-15 15:11:37,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-15 15:11:37,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-10-15 15:11:37,452 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 58 states. [2018-10-15 15:11:42,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:11:42,070 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-10-15 15:11:42,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-15 15:11:42,071 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 176 [2018-10-15 15:11:42,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:11:42,072 INFO L225 Difference]: With dead ends: 181 [2018-10-15 15:11:42,072 INFO L226 Difference]: Without dead ends: 181 [2018-10-15 15:11:42,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-10-15 15:11:42,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-10-15 15:11:42,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2018-10-15 15:11:42,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-15 15:11:42,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-10-15 15:11:42,076 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 176 [2018-10-15 15:11:42,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:11:42,076 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-10-15 15:11:42,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-15 15:11:42,077 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-10-15 15:11:42,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-15 15:11:42,077 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:11:42,078 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:11:42,078 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:11:42,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:11:42,078 INFO L82 PathProgramCache]: Analyzing trace with hash -267551253, now seen corresponding path program 56 times [2018-10-15 15:11:42,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:11:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:11:43,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:11:43,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:11:43,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 15:11:43,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 15:11:43,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 15:11:43,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 15:11:43,888 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 59 states. [2018-10-15 15:11:48,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:11:48,673 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-10-15 15:11:48,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-15 15:11:48,673 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 179 [2018-10-15 15:11:48,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:11:48,675 INFO L225 Difference]: With dead ends: 184 [2018-10-15 15:11:48,675 INFO L226 Difference]: Without dead ends: 184 [2018-10-15 15:11:48,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 15:11:48,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-15 15:11:48,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2018-10-15 15:11:48,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-15 15:11:48,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-10-15 15:11:48,679 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 179 [2018-10-15 15:11:48,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:11:48,679 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-10-15 15:11:48,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 15:11:48,679 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-10-15 15:11:48,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-15 15:11:48,680 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:11:48,680 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:11:48,681 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:11:48,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:11:48,681 INFO L82 PathProgramCache]: Analyzing trace with hash -626276400, now seen corresponding path program 57 times [2018-10-15 15:11:48,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:11:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:11:50,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:11:50,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:11:50,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-15 15:11:50,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-15 15:11:50,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-15 15:11:50,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-10-15 15:11:50,480 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 60 states. [2018-10-15 15:11:55,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:11:55,481 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-10-15 15:11:55,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 15:11:55,481 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 182 [2018-10-15 15:11:55,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:11:55,483 INFO L225 Difference]: With dead ends: 187 [2018-10-15 15:11:55,483 INFO L226 Difference]: Without dead ends: 187 [2018-10-15 15:11:55,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-10-15 15:11:55,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-10-15 15:11:55,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2018-10-15 15:11:55,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-15 15:11:55,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-10-15 15:11:55,487 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 182 [2018-10-15 15:11:55,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:11:55,487 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-10-15 15:11:55,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-15 15:11:55,487 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-10-15 15:11:55,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-15 15:11:55,488 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:11:55,488 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:11:55,488 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:11:55,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:11:55,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1528498229, now seen corresponding path program 58 times [2018-10-15 15:11:55,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:11:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:11:57,673 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 0 proven. 5075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:11:57,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:11:57,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 15:11:57,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 15:11:57,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 15:11:57,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 15:11:57,675 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 61 states. [2018-10-15 15:12:02,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:12:02,714 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-10-15 15:12:02,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-15 15:12:02,715 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 185 [2018-10-15 15:12:02,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:12:02,716 INFO L225 Difference]: With dead ends: 190 [2018-10-15 15:12:02,716 INFO L226 Difference]: Without dead ends: 190 [2018-10-15 15:12:02,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 15:12:02,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-15 15:12:02,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2018-10-15 15:12:02,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-10-15 15:12:02,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-10-15 15:12:02,720 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 185 [2018-10-15 15:12:02,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:12:02,720 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-10-15 15:12:02,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 15:12:02,720 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-10-15 15:12:02,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-15 15:12:02,721 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:12:02,721 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:12:02,721 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:12:02,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:12:02,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1713667600, now seen corresponding path program 59 times [2018-10-15 15:12:02,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:12:02,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:12:04,599 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:12:04,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:12:04,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-15 15:12:04,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-15 15:12:04,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-15 15:12:04,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-10-15 15:12:04,601 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 62 states. [2018-10-15 15:12:10,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:12:10,069 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-10-15 15:12:10,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-15 15:12:10,069 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 188 [2018-10-15 15:12:10,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:12:10,071 INFO L225 Difference]: With dead ends: 193 [2018-10-15 15:12:10,071 INFO L226 Difference]: Without dead ends: 193 [2018-10-15 15:12:10,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-10-15 15:12:10,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-10-15 15:12:10,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2018-10-15 15:12:10,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-10-15 15:12:10,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-10-15 15:12:10,073 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 188 [2018-10-15 15:12:10,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:12:10,073 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-10-15 15:12:10,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-15 15:12:10,073 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-10-15 15:12:10,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-15 15:12:10,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:12:10,074 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:12:10,075 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:12:10,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:12:10,075 INFO L82 PathProgramCache]: Analyzing trace with hash 938576299, now seen corresponding path program 60 times [2018-10-15 15:12:10,076 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:12:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:12:12,325 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 0 proven. 5430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:12:12,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:12:12,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 15:12:12,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 15:12:12,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 15:12:12,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 15:12:12,327 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 63 states. [2018-10-15 15:12:17,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:12:17,722 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2018-10-15 15:12:17,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 15:12:17,722 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 191 [2018-10-15 15:12:17,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:12:17,723 INFO L225 Difference]: With dead ends: 196 [2018-10-15 15:12:17,724 INFO L226 Difference]: Without dead ends: 196 [2018-10-15 15:12:17,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 15:12:17,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-15 15:12:17,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 195. [2018-10-15 15:12:17,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-10-15 15:12:17,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-10-15 15:12:17,727 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 191 [2018-10-15 15:12:17,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:12:17,728 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-10-15 15:12:17,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 15:12:17,728 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-10-15 15:12:17,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-15 15:12:17,729 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:12:17,729 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:12:17,729 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:12:17,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:12:17,730 INFO L82 PathProgramCache]: Analyzing trace with hash -576773104, now seen corresponding path program 61 times [2018-10-15 15:12:17,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:12:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:12:19,794 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 0 proven. 5612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:12:19,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:12:19,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-15 15:12:19,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-15 15:12:19,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-15 15:12:19,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-10-15 15:12:19,796 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 64 states. [2018-10-15 15:12:25,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:12:25,380 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-10-15 15:12:25,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-15 15:12:25,380 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 194 [2018-10-15 15:12:25,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:12:25,381 INFO L225 Difference]: With dead ends: 199 [2018-10-15 15:12:25,382 INFO L226 Difference]: Without dead ends: 199 [2018-10-15 15:12:25,382 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-10-15 15:12:25,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-10-15 15:12:25,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2018-10-15 15:12:25,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-10-15 15:12:25,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-10-15 15:12:25,385 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 194 [2018-10-15 15:12:25,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:12:25,386 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-10-15 15:12:25,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-15 15:12:25,386 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-10-15 15:12:25,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-15 15:12:25,387 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:12:25,387 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:12:25,387 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:12:25,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:12:25,388 INFO L82 PathProgramCache]: Analyzing trace with hash 50410379, now seen corresponding path program 62 times [2018-10-15 15:12:25,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:12:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:12:27,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:12:27,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:12:27,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 15:12:27,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 15:12:27,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 15:12:27,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 15:12:27,737 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 65 states. [2018-10-15 15:12:33,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:12:33,519 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2018-10-15 15:12:33,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-15 15:12:33,520 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 197 [2018-10-15 15:12:33,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:12:33,521 INFO L225 Difference]: With dead ends: 202 [2018-10-15 15:12:33,521 INFO L226 Difference]: Without dead ends: 202 [2018-10-15 15:12:33,521 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 15:12:33,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-10-15 15:12:33,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2018-10-15 15:12:33,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-15 15:12:33,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-10-15 15:12:33,525 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 197 [2018-10-15 15:12:33,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:12:33,526 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-10-15 15:12:33,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 15:12:33,526 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-10-15 15:12:33,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-15 15:12:33,527 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:12:33,527 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:12:33,527 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:12:33,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:12:33,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1365814832, now seen corresponding path program 63 times [2018-10-15 15:12:33,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:12:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:12:35,672 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:12:35,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:12:35,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-15 15:12:35,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-15 15:12:35,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-15 15:12:35,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-10-15 15:12:35,674 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 66 states. [2018-10-15 15:12:41,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:12:41,584 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-10-15 15:12:41,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 15:12:41,584 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 200 [2018-10-15 15:12:41,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:12:41,585 INFO L225 Difference]: With dead ends: 205 [2018-10-15 15:12:41,585 INFO L226 Difference]: Without dead ends: 205 [2018-10-15 15:12:41,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-10-15 15:12:41,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-10-15 15:12:41,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2018-10-15 15:12:41,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-10-15 15:12:41,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2018-10-15 15:12:41,589 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 200 [2018-10-15 15:12:41,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:12:41,589 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2018-10-15 15:12:41,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-15 15:12:41,589 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2018-10-15 15:12:41,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-15 15:12:41,590 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:12:41,590 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:12:41,590 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:12:41,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:12:41,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1298265451, now seen corresponding path program 64 times [2018-10-15 15:12:41,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:12:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:12:43,898 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 0 proven. 6176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:12:43,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:12:43,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 15:12:43,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 15:12:43,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 15:12:43,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 15:12:43,899 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 67 states. [2018-10-15 15:12:50,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:12:50,172 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2018-10-15 15:12:50,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-15 15:12:50,173 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 203 [2018-10-15 15:12:50,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:12:50,174 INFO L225 Difference]: With dead ends: 208 [2018-10-15 15:12:50,174 INFO L226 Difference]: Without dead ends: 208 [2018-10-15 15:12:50,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 15:12:50,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-10-15 15:12:50,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 207. [2018-10-15 15:12:50,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-15 15:12:50,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-10-15 15:12:50,177 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 203 [2018-10-15 15:12:50,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:12:50,178 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-10-15 15:12:50,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 15:12:50,178 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-10-15 15:12:50,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-15 15:12:50,179 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:12:50,179 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:12:50,179 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:12:50,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:12:50,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1020649392, now seen corresponding path program 65 times [2018-10-15 15:12:50,180 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:12:50,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:12:52,443 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 0 proven. 6370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:12:52,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:12:52,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-15 15:12:52,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-15 15:12:52,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-15 15:12:52,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-10-15 15:12:52,445 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 68 states. [2018-10-15 15:12:58,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:12:58,824 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-10-15 15:12:58,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-15 15:12:58,825 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 206 [2018-10-15 15:12:58,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:12:58,826 INFO L225 Difference]: With dead ends: 211 [2018-10-15 15:12:58,826 INFO L226 Difference]: Without dead ends: 211 [2018-10-15 15:12:58,827 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-10-15 15:12:58,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-10-15 15:12:58,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 210. [2018-10-15 15:12:58,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-10-15 15:12:58,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2018-10-15 15:12:58,829 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 206 [2018-10-15 15:12:58,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:12:58,830 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2018-10-15 15:12:58,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-15 15:12:58,830 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2018-10-15 15:12:58,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-10-15 15:12:58,831 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:12:58,831 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:12:58,831 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:12:58,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:12:58,831 INFO L82 PathProgramCache]: Analyzing trace with hash 736218955, now seen corresponding path program 66 times [2018-10-15 15:12:58,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:12:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:13:01,171 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 0 proven. 6567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:13:01,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:13:01,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 15:13:01,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 15:13:01,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 15:13:01,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 15:13:01,173 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 69 states. [2018-10-15 15:13:07,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:13:07,591 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2018-10-15 15:13:07,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 15:13:07,591 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 209 [2018-10-15 15:13:07,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:13:07,593 INFO L225 Difference]: With dead ends: 214 [2018-10-15 15:13:07,593 INFO L226 Difference]: Without dead ends: 214 [2018-10-15 15:13:07,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 15:13:07,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-10-15 15:13:07,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2018-10-15 15:13:07,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-15 15:13:07,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-10-15 15:13:07,596 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 209 [2018-10-15 15:13:07,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:13:07,596 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-10-15 15:13:07,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 15:13:07,596 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-10-15 15:13:07,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-15 15:13:07,597 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:13:07,597 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:13:07,598 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:13:07,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:13:07,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1129675376, now seen corresponding path program 67 times [2018-10-15 15:13:07,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:13:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:13:10,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:13:10,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:13:10,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-10-15 15:13:10,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-15 15:13:10,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-15 15:13:10,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-10-15 15:13:10,094 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 70 states. [2018-10-15 15:13:16,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:13:16,745 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2018-10-15 15:13:16,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-15 15:13:16,746 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 212 [2018-10-15 15:13:16,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:13:16,747 INFO L225 Difference]: With dead ends: 217 [2018-10-15 15:13:16,747 INFO L226 Difference]: Without dead ends: 217 [2018-10-15 15:13:16,747 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-10-15 15:13:16,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-10-15 15:13:16,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 216. [2018-10-15 15:13:16,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-10-15 15:13:16,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-10-15 15:13:16,750 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 212 [2018-10-15 15:13:16,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:13:16,750 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-10-15 15:13:16,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-15 15:13:16,750 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-10-15 15:13:16,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-15 15:13:16,751 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:13:16,752 INFO L375 BasicCegarLoop]: trace histogram [69, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:13:16,752 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:13:16,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:13:16,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1624162603, now seen corresponding path program 68 times [2018-10-15 15:13:16,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:13:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:13:19,620 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:13:19,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:13:19,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 15:13:19,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 15:13:19,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 15:13:19,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 15:13:19,621 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 71 states. [2018-10-15 15:13:26,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:13:26,472 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2018-10-15 15:13:26,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-15 15:13:26,473 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 215 [2018-10-15 15:13:26,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:13:26,474 INFO L225 Difference]: With dead ends: 220 [2018-10-15 15:13:26,474 INFO L226 Difference]: Without dead ends: 220 [2018-10-15 15:13:26,475 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 15:13:26,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-10-15 15:13:26,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 219. [2018-10-15 15:13:26,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-15 15:13:26,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-10-15 15:13:26,476 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 215 [2018-10-15 15:13:26,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:13:26,477 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-10-15 15:13:26,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 15:13:26,477 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-10-15 15:13:26,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-15 15:13:26,477 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:13:26,478 INFO L375 BasicCegarLoop]: trace histogram [70, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:13:26,478 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:13:26,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:13:26,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1155316880, now seen corresponding path program 69 times [2018-10-15 15:13:26,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:13:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:13:29,294 INFO L134 CoverageAnalysis]: Checked inductivity of 7176 backedges. 0 proven. 7176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:13:29,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:13:29,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-15 15:13:29,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-15 15:13:29,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-15 15:13:29,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-10-15 15:13:29,296 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 72 states. [2018-10-15 15:13:36,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:13:36,537 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-10-15 15:13:36,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 15:13:36,537 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 218 [2018-10-15 15:13:36,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:13:36,539 INFO L225 Difference]: With dead ends: 223 [2018-10-15 15:13:36,539 INFO L226 Difference]: Without dead ends: 223 [2018-10-15 15:13:36,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-10-15 15:13:36,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-10-15 15:13:36,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 222. [2018-10-15 15:13:36,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-15 15:13:36,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2018-10-15 15:13:36,543 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 218 [2018-10-15 15:13:36,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:13:36,543 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2018-10-15 15:13:36,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-15 15:13:36,544 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2018-10-15 15:13:36,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-15 15:13:36,544 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:13:36,544 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:13:36,545 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:13:36,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:13:36,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1006029579, now seen corresponding path program 70 times [2018-10-15 15:13:36,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:13:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:13:39,590 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:13:39,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:13:39,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 15:13:39,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 15:13:39,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 15:13:39,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 15:13:39,591 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 73 states. [2018-10-15 15:13:46,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:13:46,780 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2018-10-15 15:13:46,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-15 15:13:46,780 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 221 [2018-10-15 15:13:46,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:13:46,782 INFO L225 Difference]: With dead ends: 226 [2018-10-15 15:13:46,782 INFO L226 Difference]: Without dead ends: 226 [2018-10-15 15:13:46,782 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 15:13:46,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-10-15 15:13:46,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2018-10-15 15:13:46,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-10-15 15:13:46,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-10-15 15:13:46,784 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 221 [2018-10-15 15:13:46,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:13:46,784 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-10-15 15:13:46,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 15:13:46,784 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-10-15 15:13:46,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-15 15:13:46,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:13:46,785 INFO L375 BasicCegarLoop]: trace histogram [72, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:13:46,785 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:13:46,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:13:46,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1120803152, now seen corresponding path program 71 times [2018-10-15 15:13:46,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:13:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:13:49,707 INFO L134 CoverageAnalysis]: Checked inductivity of 7597 backedges. 0 proven. 7597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:13:49,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:13:49,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-10-15 15:13:49,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-15 15:13:49,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-15 15:13:49,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-10-15 15:13:49,708 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 74 states. [2018-10-15 15:13:57,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:13:57,165 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2018-10-15 15:13:57,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-15 15:13:57,166 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 224 [2018-10-15 15:13:57,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:13:57,167 INFO L225 Difference]: With dead ends: 229 [2018-10-15 15:13:57,167 INFO L226 Difference]: Without dead ends: 229 [2018-10-15 15:13:57,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-10-15 15:13:57,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-10-15 15:13:57,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 228. [2018-10-15 15:13:57,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-10-15 15:13:57,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 228 transitions. [2018-10-15 15:13:57,171 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 228 transitions. Word has length 224 [2018-10-15 15:13:57,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:13:57,171 INFO L481 AbstractCegarLoop]: Abstraction has 228 states and 228 transitions. [2018-10-15 15:13:57,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-15 15:13:57,171 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 228 transitions. [2018-10-15 15:13:57,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-10-15 15:13:57,172 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:13:57,173 INFO L375 BasicCegarLoop]: trace histogram [73, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:13:57,173 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:13:57,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:13:57,173 INFO L82 PathProgramCache]: Analyzing trace with hash 2057825515, now seen corresponding path program 72 times [2018-10-15 15:13:57,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:13:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:14:00,114 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:14:00,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:14:00,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 15:14:00,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 15:14:00,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 15:14:00,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 15:14:00,116 INFO L87 Difference]: Start difference. First operand 228 states and 228 transitions. Second operand 75 states. [2018-10-15 15:14:07,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:14:07,745 INFO L93 Difference]: Finished difference Result 232 states and 232 transitions. [2018-10-15 15:14:07,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 15:14:07,745 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 227 [2018-10-15 15:14:07,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:14:07,747 INFO L225 Difference]: With dead ends: 232 [2018-10-15 15:14:07,747 INFO L226 Difference]: Without dead ends: 232 [2018-10-15 15:14:07,747 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 15:14:07,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-10-15 15:14:07,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 231. [2018-10-15 15:14:07,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-15 15:14:07,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-10-15 15:14:07,750 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 227 [2018-10-15 15:14:07,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:14:07,750 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-10-15 15:14:07,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 15:14:07,750 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-10-15 15:14:07,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-15 15:14:07,751 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:14:07,751 INFO L375 BasicCegarLoop]: trace histogram [74, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:14:07,752 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:14:07,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:14:07,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1145501904, now seen corresponding path program 73 times [2018-10-15 15:14:07,752 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:14:07,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:14:10,858 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 0 proven. 8030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:14:10,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:14:10,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-10-15 15:14:10,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-15 15:14:10,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-15 15:14:10,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-10-15 15:14:10,859 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 76 states. [2018-10-15 15:14:18,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:14:18,743 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-10-15 15:14:18,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-15 15:14:18,743 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 230 [2018-10-15 15:14:18,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:14:18,745 INFO L225 Difference]: With dead ends: 235 [2018-10-15 15:14:18,745 INFO L226 Difference]: Without dead ends: 235 [2018-10-15 15:14:18,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-10-15 15:14:18,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-10-15 15:14:18,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 234. [2018-10-15 15:14:18,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-10-15 15:14:18,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 234 transitions. [2018-10-15 15:14:18,749 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 234 transitions. Word has length 230 [2018-10-15 15:14:18,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:14:18,749 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 234 transitions. [2018-10-15 15:14:18,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-15 15:14:18,749 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 234 transitions. [2018-10-15 15:14:18,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-15 15:14:18,750 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:14:18,750 INFO L375 BasicCegarLoop]: trace histogram [75, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:14:18,751 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:14:18,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:14:18,751 INFO L82 PathProgramCache]: Analyzing trace with hash 665855691, now seen corresponding path program 74 times [2018-10-15 15:14:18,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:14:18,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:14:21,891 INFO L134 CoverageAnalysis]: Checked inductivity of 8251 backedges. 0 proven. 8251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:14:21,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:14:21,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 15:14:21,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 15:14:21,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 15:14:21,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 15:14:21,892 INFO L87 Difference]: Start difference. First operand 234 states and 234 transitions. Second operand 77 states. [2018-10-15 15:14:29,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:14:29,948 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2018-10-15 15:14:29,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-15 15:14:29,948 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 233 [2018-10-15 15:14:29,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:14:29,950 INFO L225 Difference]: With dead ends: 238 [2018-10-15 15:14:29,950 INFO L226 Difference]: Without dead ends: 238 [2018-10-15 15:14:29,950 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 15:14:29,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-15 15:14:29,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2018-10-15 15:14:29,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-15 15:14:29,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-10-15 15:14:29,954 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 233 [2018-10-15 15:14:29,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:14:29,954 INFO L481 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-10-15 15:14:29,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 15:14:29,954 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-10-15 15:14:29,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-15 15:14:29,955 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:14:29,955 INFO L375 BasicCegarLoop]: trace histogram [76, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:14:29,955 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:14:29,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:14:29,955 INFO L82 PathProgramCache]: Analyzing trace with hash 881718000, now seen corresponding path program 75 times [2018-10-15 15:14:29,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:14:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:14:32,797 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 0 proven. 8475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:14:32,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:14:32,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-15 15:14:32,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-15 15:14:32,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-15 15:14:32,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-10-15 15:14:32,798 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 78 states. [2018-10-15 15:14:40,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:14:40,968 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-10-15 15:14:40,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 15:14:40,968 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 236 [2018-10-15 15:14:40,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:14:40,970 INFO L225 Difference]: With dead ends: 241 [2018-10-15 15:14:40,970 INFO L226 Difference]: Without dead ends: 241 [2018-10-15 15:14:40,970 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-10-15 15:14:40,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-10-15 15:14:40,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 240. [2018-10-15 15:14:40,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-15 15:14:40,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 240 transitions. [2018-10-15 15:14:40,973 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 240 transitions. Word has length 236 [2018-10-15 15:14:40,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:14:40,973 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 240 transitions. [2018-10-15 15:14:40,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-15 15:14:40,973 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 240 transitions. [2018-10-15 15:14:40,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-10-15 15:14:40,974 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:14:40,974 INFO L375 BasicCegarLoop]: trace histogram [77, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:14:40,974 INFO L424 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:14:40,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:14:40,975 INFO L82 PathProgramCache]: Analyzing trace with hash 2069723307, now seen corresponding path program 76 times [2018-10-15 15:14:40,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:14:40,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:14:43,905 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 0 proven. 8702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:14:43,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:14:43,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 15:14:43,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 15:14:43,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 15:14:43,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 15:14:43,907 INFO L87 Difference]: Start difference. First operand 240 states and 240 transitions. Second operand 79 states. [2018-10-15 15:14:52,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:14:52,338 INFO L93 Difference]: Finished difference Result 244 states and 244 transitions. [2018-10-15 15:14:52,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-15 15:14:52,338 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 239 [2018-10-15 15:14:52,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:14:52,339 INFO L225 Difference]: With dead ends: 244 [2018-10-15 15:14:52,340 INFO L226 Difference]: Without dead ends: 244 [2018-10-15 15:14:52,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 15:14:52,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-10-15 15:14:52,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 243. [2018-10-15 15:14:52,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-15 15:14:52,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-10-15 15:14:52,344 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 239 [2018-10-15 15:14:52,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:14:52,344 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-10-15 15:14:52,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 15:14:52,344 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-10-15 15:14:52,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-15 15:14:52,345 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:14:52,346 INFO L375 BasicCegarLoop]: trace histogram [78, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:14:52,346 INFO L424 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:14:52,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:14:52,346 INFO L82 PathProgramCache]: Analyzing trace with hash -889662192, now seen corresponding path program 77 times [2018-10-15 15:14:52,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:14:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:14:55,583 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 0 proven. 8932 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:14:55,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:14:55,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-10-15 15:14:55,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-15 15:14:55,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-15 15:14:55,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-10-15 15:14:55,585 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 80 states. [2018-10-15 15:15:04,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:15:04,072 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-10-15 15:15:04,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-15 15:15:04,073 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 242 [2018-10-15 15:15:04,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:15:04,074 INFO L225 Difference]: With dead ends: 247 [2018-10-15 15:15:04,074 INFO L226 Difference]: Without dead ends: 247 [2018-10-15 15:15:04,075 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-10-15 15:15:04,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-10-15 15:15:04,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 246. [2018-10-15 15:15:04,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-10-15 15:15:04,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2018-10-15 15:15:04,078 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 242 [2018-10-15 15:15:04,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:15:04,078 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2018-10-15 15:15:04,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-15 15:15:04,078 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2018-10-15 15:15:04,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-10-15 15:15:04,079 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:15:04,079 INFO L375 BasicCegarLoop]: trace histogram [79, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:15:04,080 INFO L424 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:15:04,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:15:04,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1149377909, now seen corresponding path program 78 times [2018-10-15 15:15:04,081 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:15:04,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:15:07,434 INFO L134 CoverageAnalysis]: Checked inductivity of 9165 backedges. 0 proven. 9165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:15:07,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:15:07,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 15:15:07,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 15:15:07,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 15:15:07,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 15:15:07,435 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 81 states. [2018-10-15 15:15:16,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:15:16,034 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2018-10-15 15:15:16,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 15:15:16,035 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 245 [2018-10-15 15:15:16,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:15:16,036 INFO L225 Difference]: With dead ends: 250 [2018-10-15 15:15:16,036 INFO L226 Difference]: Without dead ends: 250 [2018-10-15 15:15:16,037 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 15:15:16,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-10-15 15:15:16,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2018-10-15 15:15:16,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-15 15:15:16,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-10-15 15:15:16,039 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 245 [2018-10-15 15:15:16,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:15:16,039 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-10-15 15:15:16,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 15:15:16,039 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-10-15 15:15:16,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-15 15:15:16,040 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:15:16,040 INFO L375 BasicCegarLoop]: trace histogram [80, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:15:16,040 INFO L424 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:15:16,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:15:16,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1190764336, now seen corresponding path program 79 times [2018-10-15 15:15:16,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:15:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:15:19,141 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 0 proven. 9401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:15:19,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:15:19,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-10-15 15:15:19,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-15 15:15:19,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-15 15:15:19,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-10-15 15:15:19,142 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 82 states. [2018-10-15 15:15:27,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:15:27,882 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-10-15 15:15:27,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-15 15:15:27,883 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 248 [2018-10-15 15:15:27,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:15:27,884 INFO L225 Difference]: With dead ends: 253 [2018-10-15 15:15:27,884 INFO L226 Difference]: Without dead ends: 253 [2018-10-15 15:15:27,885 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-10-15 15:15:27,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-10-15 15:15:27,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2018-10-15 15:15:27,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-10-15 15:15:27,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2018-10-15 15:15:27,888 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 248 [2018-10-15 15:15:27,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:15:27,888 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2018-10-15 15:15:27,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-15 15:15:27,888 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2018-10-15 15:15:27,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-10-15 15:15:27,889 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:15:27,889 INFO L375 BasicCegarLoop]: trace histogram [81, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:15:27,889 INFO L424 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:15:27,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:15:27,889 INFO L82 PathProgramCache]: Analyzing trace with hash 459236459, now seen corresponding path program 80 times [2018-10-15 15:15:27,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:15:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:15:31,256 INFO L134 CoverageAnalysis]: Checked inductivity of 9640 backedges. 0 proven. 9640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:15:31,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:15:31,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 15:15:31,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 15:15:31,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 15:15:31,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 15:15:31,258 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand 83 states. [2018-10-15 15:15:40,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:15:40,229 INFO L93 Difference]: Finished difference Result 256 states and 256 transitions. [2018-10-15 15:15:40,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-15 15:15:40,229 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 251 [2018-10-15 15:15:40,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:15:40,231 INFO L225 Difference]: With dead ends: 256 [2018-10-15 15:15:40,231 INFO L226 Difference]: Without dead ends: 256 [2018-10-15 15:15:40,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 15:15:40,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-10-15 15:15:40,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 255. [2018-10-15 15:15:40,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-15 15:15:40,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-10-15 15:15:40,235 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 251 [2018-10-15 15:15:40,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:15:40,235 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-10-15 15:15:40,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 15:15:40,235 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-10-15 15:15:40,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-10-15 15:15:40,236 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:15:40,237 INFO L375 BasicCegarLoop]: trace histogram [82, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:15:40,237 INFO L424 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:15:40,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:15:40,237 INFO L82 PathProgramCache]: Analyzing trace with hash 176312656, now seen corresponding path program 81 times [2018-10-15 15:15:40,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:15:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:15:43,578 INFO L134 CoverageAnalysis]: Checked inductivity of 9882 backedges. 0 proven. 9882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:15:43,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:15:43,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-10-15 15:15:43,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-15 15:15:43,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-15 15:15:43,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-10-15 15:15:43,580 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 84 states. [2018-10-15 15:15:52,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:15:52,722 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-10-15 15:15:52,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 15:15:52,723 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 254 [2018-10-15 15:15:52,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:15:52,724 INFO L225 Difference]: With dead ends: 259 [2018-10-15 15:15:52,724 INFO L226 Difference]: Without dead ends: 259 [2018-10-15 15:15:52,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-10-15 15:15:52,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-15 15:15:52,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 258. [2018-10-15 15:15:52,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-10-15 15:15:52,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 258 transitions. [2018-10-15 15:15:52,728 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 258 transitions. Word has length 254 [2018-10-15 15:15:52,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:15:52,728 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 258 transitions. [2018-10-15 15:15:52,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-15 15:15:52,728 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 258 transitions. [2018-10-15 15:15:52,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-10-15 15:15:52,729 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:15:52,729 INFO L375 BasicCegarLoop]: trace histogram [83, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:15:52,729 INFO L424 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:15:52,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:15:52,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1680867765, now seen corresponding path program 82 times [2018-10-15 15:15:52,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:15:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:15:56,011 INFO L134 CoverageAnalysis]: Checked inductivity of 10127 backedges. 0 proven. 10127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:15:56,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:15:56,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 15:15:56,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 15:15:56,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 15:15:56,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 15:15:56,012 INFO L87 Difference]: Start difference. First operand 258 states and 258 transitions. Second operand 85 states. [2018-10-15 15:16:05,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:16:05,384 INFO L93 Difference]: Finished difference Result 262 states and 262 transitions. [2018-10-15 15:16:05,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-15 15:16:05,385 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 257 [2018-10-15 15:16:05,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:16:05,386 INFO L225 Difference]: With dead ends: 262 [2018-10-15 15:16:05,386 INFO L226 Difference]: Without dead ends: 262 [2018-10-15 15:16:05,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 15:16:05,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-10-15 15:16:05,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2018-10-15 15:16:05,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-10-15 15:16:05,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-10-15 15:16:05,389 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 257 [2018-10-15 15:16:05,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:16:05,390 INFO L481 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-10-15 15:16:05,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 15:16:05,390 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-10-15 15:16:05,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-10-15 15:16:05,391 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:16:05,391 INFO L375 BasicCegarLoop]: trace histogram [84, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:16:05,391 INFO L424 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:16:05,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:16:05,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1174082704, now seen corresponding path program 83 times [2018-10-15 15:16:05,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:16:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:16:08,922 INFO L134 CoverageAnalysis]: Checked inductivity of 10375 backedges. 0 proven. 10375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:16:08,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:16:08,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-10-15 15:16:08,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-15 15:16:08,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-15 15:16:08,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-10-15 15:16:08,923 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 86 states. [2018-10-15 15:16:18,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:16:18,510 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2018-10-15 15:16:18,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-15 15:16:18,511 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 260 [2018-10-15 15:16:18,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:16:18,512 INFO L225 Difference]: With dead ends: 265 [2018-10-15 15:16:18,512 INFO L226 Difference]: Without dead ends: 265 [2018-10-15 15:16:18,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-10-15 15:16:18,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-10-15 15:16:18,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 264. [2018-10-15 15:16:18,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-10-15 15:16:18,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 264 transitions. [2018-10-15 15:16:18,514 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 264 transitions. Word has length 260 [2018-10-15 15:16:18,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:16:18,514 INFO L481 AbstractCegarLoop]: Abstraction has 264 states and 264 transitions. [2018-10-15 15:16:18,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-15 15:16:18,515 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 264 transitions. [2018-10-15 15:16:18,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-10-15 15:16:18,515 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:16:18,515 INFO L375 BasicCegarLoop]: trace histogram [85, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:16:18,516 INFO L424 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:16:18,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:16:18,516 INFO L82 PathProgramCache]: Analyzing trace with hash -350375893, now seen corresponding path program 84 times [2018-10-15 15:16:18,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:16:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:16:22,027 INFO L134 CoverageAnalysis]: Checked inductivity of 10626 backedges. 0 proven. 10626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:16:22,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:16:22,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 15:16:22,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 15:16:22,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 15:16:22,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 15:16:22,028 INFO L87 Difference]: Start difference. First operand 264 states and 264 transitions. Second operand 87 states. [2018-10-15 15:16:31,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:16:31,884 INFO L93 Difference]: Finished difference Result 268 states and 268 transitions. [2018-10-15 15:16:31,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 15:16:31,885 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 263 [2018-10-15 15:16:31,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:16:31,886 INFO L225 Difference]: With dead ends: 268 [2018-10-15 15:16:31,886 INFO L226 Difference]: Without dead ends: 268 [2018-10-15 15:16:31,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 15:16:31,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-10-15 15:16:31,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 267. [2018-10-15 15:16:31,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-15 15:16:31,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2018-10-15 15:16:31,890 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 263 [2018-10-15 15:16:31,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:16:31,890 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2018-10-15 15:16:31,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 15:16:31,891 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2018-10-15 15:16:31,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-15 15:16:31,892 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:16:31,892 INFO L375 BasicCegarLoop]: trace histogram [86, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:16:31,892 INFO L424 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:16:31,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:16:31,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1551068560, now seen corresponding path program 85 times [2018-10-15 15:16:31,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:16:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:16:35,484 INFO L134 CoverageAnalysis]: Checked inductivity of 10880 backedges. 0 proven. 10880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:16:35,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:16:35,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-10-15 15:16:35,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-15 15:16:35,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-15 15:16:35,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-10-15 15:16:35,486 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 88 states. [2018-10-15 15:16:45,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:16:45,559 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-10-15 15:16:45,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-15 15:16:45,560 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 266 [2018-10-15 15:16:45,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:16:45,561 INFO L225 Difference]: With dead ends: 271 [2018-10-15 15:16:45,561 INFO L226 Difference]: Without dead ends: 271 [2018-10-15 15:16:45,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-10-15 15:16:45,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-10-15 15:16:45,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 270. [2018-10-15 15:16:45,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-10-15 15:16:45,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 270 transitions. [2018-10-15 15:16:45,564 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 270 transitions. Word has length 266 [2018-10-15 15:16:45,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:16:45,564 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 270 transitions. [2018-10-15 15:16:45,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-15 15:16:45,565 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 270 transitions. [2018-10-15 15:16:45,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-15 15:16:45,566 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:16:45,566 INFO L375 BasicCegarLoop]: trace histogram [87, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:16:45,566 INFO L424 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:16:45,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:16:45,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1159100939, now seen corresponding path program 86 times [2018-10-15 15:16:45,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:16:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:16:49,207 INFO L134 CoverageAnalysis]: Checked inductivity of 11137 backedges. 0 proven. 11137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:16:49,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:16:49,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 15:16:49,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 15:16:49,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 15:16:49,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 15:16:49,209 INFO L87 Difference]: Start difference. First operand 270 states and 270 transitions. Second operand 89 states. [2018-10-15 15:16:59,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:16:59,530 INFO L93 Difference]: Finished difference Result 274 states and 274 transitions. [2018-10-15 15:16:59,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-15 15:16:59,531 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 269 [2018-10-15 15:16:59,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:16:59,532 INFO L225 Difference]: With dead ends: 274 [2018-10-15 15:16:59,532 INFO L226 Difference]: Without dead ends: 274 [2018-10-15 15:16:59,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 15:16:59,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-10-15 15:16:59,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2018-10-15 15:16:59,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-10-15 15:16:59,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-10-15 15:16:59,536 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 269 [2018-10-15 15:16:59,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:16:59,537 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-10-15 15:16:59,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 15:16:59,537 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-10-15 15:16:59,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-10-15 15:16:59,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:16:59,538 INFO L375 BasicCegarLoop]: trace histogram [88, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:16:59,538 INFO L424 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:16:59,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:16:59,538 INFO L82 PathProgramCache]: Analyzing trace with hash 2067781552, now seen corresponding path program 87 times [2018-10-15 15:16:59,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:16:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:17:03,283 INFO L134 CoverageAnalysis]: Checked inductivity of 11397 backedges. 0 proven. 11397 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:17:03,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:17:03,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-10-15 15:17:03,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-15 15:17:03,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-15 15:17:03,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 15:17:03,284 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 90 states. [2018-10-15 15:17:13,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:17:13,819 INFO L93 Difference]: Finished difference Result 277 states and 277 transitions. [2018-10-15 15:17:13,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 15:17:13,820 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 272 [2018-10-15 15:17:13,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:17:13,821 INFO L225 Difference]: With dead ends: 277 [2018-10-15 15:17:13,821 INFO L226 Difference]: Without dead ends: 277 [2018-10-15 15:17:13,822 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 15:17:13,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-10-15 15:17:13,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 276. [2018-10-15 15:17:13,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-10-15 15:17:13,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 276 transitions. [2018-10-15 15:17:13,824 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 276 transitions. Word has length 272 [2018-10-15 15:17:13,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:17:13,824 INFO L481 AbstractCegarLoop]: Abstraction has 276 states and 276 transitions. [2018-10-15 15:17:13,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-15 15:17:13,824 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 276 transitions. [2018-10-15 15:17:13,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-10-15 15:17:13,825 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:17:13,825 INFO L375 BasicCegarLoop]: trace histogram [89, 88, 88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:17:13,825 INFO L424 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:17:13,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:17:13,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1393056747, now seen corresponding path program 88 times [2018-10-15 15:17:13,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:17:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:17:17,638 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 0 proven. 11660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:17:17,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:17:17,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 15:17:17,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 15:17:17,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 15:17:17,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 15:17:17,639 INFO L87 Difference]: Start difference. First operand 276 states and 276 transitions. Second operand 91 states. [2018-10-15 15:17:28,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:17:28,429 INFO L93 Difference]: Finished difference Result 280 states and 280 transitions. [2018-10-15 15:17:28,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-15 15:17:28,430 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 275 [2018-10-15 15:17:28,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:17:28,431 INFO L225 Difference]: With dead ends: 280 [2018-10-15 15:17:28,431 INFO L226 Difference]: Without dead ends: 280 [2018-10-15 15:17:28,431 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 15:17:28,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-10-15 15:17:28,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 279. [2018-10-15 15:17:28,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-15 15:17:28,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 279 transitions. [2018-10-15 15:17:28,434 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 279 transitions. Word has length 275 [2018-10-15 15:17:28,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:17:28,434 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 279 transitions. [2018-10-15 15:17:28,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 15:17:28,435 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 279 transitions. [2018-10-15 15:17:28,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-10-15 15:17:28,435 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:17:28,435 INFO L375 BasicCegarLoop]: trace histogram [90, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:17:28,436 INFO L424 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:17:28,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:17:28,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1113336272, now seen corresponding path program 89 times [2018-10-15 15:17:28,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:17:28,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:17:32,357 INFO L134 CoverageAnalysis]: Checked inductivity of 11926 backedges. 0 proven. 11926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:17:32,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:17:32,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-10-15 15:17:32,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-15 15:17:32,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-15 15:17:32,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-10-15 15:17:32,358 INFO L87 Difference]: Start difference. First operand 279 states and 279 transitions. Second operand 92 states. [2018-10-15 15:17:43,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:17:43,350 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-10-15 15:17:43,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-15 15:17:43,351 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 278 [2018-10-15 15:17:43,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:17:43,352 INFO L225 Difference]: With dead ends: 283 [2018-10-15 15:17:43,352 INFO L226 Difference]: Without dead ends: 283 [2018-10-15 15:17:43,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-10-15 15:17:43,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-10-15 15:17:43,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 282. [2018-10-15 15:17:43,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-10-15 15:17:43,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 282 transitions. [2018-10-15 15:17:43,355 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 282 transitions. Word has length 278 [2018-10-15 15:17:43,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:17:43,356 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 282 transitions. [2018-10-15 15:17:43,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-15 15:17:43,356 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 282 transitions. [2018-10-15 15:17:43,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-10-15 15:17:43,357 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:17:43,357 INFO L375 BasicCegarLoop]: trace histogram [91, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:17:43,357 INFO L424 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:17:43,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:17:43,358 INFO L82 PathProgramCache]: Analyzing trace with hash 197219787, now seen corresponding path program 90 times [2018-10-15 15:17:43,358 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:17:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:17:47,340 INFO L134 CoverageAnalysis]: Checked inductivity of 12195 backedges. 0 proven. 12195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:17:47,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:17:47,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 15:17:47,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 15:17:47,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 15:17:47,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 15:17:47,342 INFO L87 Difference]: Start difference. First operand 282 states and 282 transitions. Second operand 93 states.