java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength_true-valid-memsafety.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-502d2f4 [2018-10-12 20:45:51,690 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-12 20:45:51,692 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-12 20:45:51,704 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-12 20:45:51,704 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-12 20:45:51,705 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-12 20:45:51,706 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-12 20:45:51,708 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-12 20:45:51,710 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-12 20:45:51,711 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-12 20:45:51,712 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-12 20:45:51,712 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-12 20:45:51,713 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-12 20:45:51,714 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-12 20:45:51,715 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-12 20:45:51,716 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-12 20:45:51,717 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-12 20:45:51,721 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-12 20:45:51,726 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-12 20:45:51,728 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-12 20:45:51,730 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-12 20:45:51,731 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-12 20:45:51,737 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-12 20:45:51,737 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-12 20:45:51,740 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-12 20:45:51,741 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-12 20:45:51,742 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-12 20:45:51,743 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-12 20:45:51,743 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-12 20:45:51,744 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-12 20:45:51,745 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-12 20:45:51,745 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-12 20:45:51,745 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-12 20:45:51,749 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-12 20:45:51,751 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-12 20:45:51,752 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-12 20:45:51,752 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-12 20:45:51,771 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-12 20:45:51,771 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-12 20:45:51,772 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-12 20:45:51,773 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-12 20:45:51,773 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-12 20:45:51,773 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-12 20:45:51,774 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-12 20:45:51,774 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-12 20:45:51,774 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-12 20:45:51,774 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-12 20:45:51,775 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-12 20:45:51,775 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-12 20:45:51,775 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-12 20:45:51,777 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-12 20:45:51,777 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-12 20:45:51,846 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-12 20:45:51,865 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-12 20:45:51,873 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-12 20:45:51,875 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-12 20:45:51,876 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-12 20:45:51,876 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength_true-valid-memsafety.c_12.bpl [2018-10-12 20:45:51,877 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength_true-valid-memsafety.c_12.bpl' [2018-10-12 20:45:51,941 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-12 20:45:51,943 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-12 20:45:51,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-12 20:45:51,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-12 20:45:51,944 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-12 20:45:51,969 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:45:51" (1/1) ... [2018-10-12 20:45:51,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:45:51" (1/1) ... [2018-10-12 20:45:51,985 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:45:51" (1/1) ... [2018-10-12 20:45:51,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:45:51" (1/1) ... [2018-10-12 20:45:51,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:45:51" (1/1) ... [2018-10-12 20:45:51,994 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:45:51" (1/1) ... [2018-10-12 20:45:51,995 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:45:51" (1/1) ... [2018-10-12 20:45:51,997 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-12 20:45:51,998 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-12 20:45:51,998 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-12 20:45:51,999 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-12 20:45:52,000 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:45:51" (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-12 20:45:52,085 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-12 20:45:52,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-12 20:45:52,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-12 20:45:52,692 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-12 20:45:52,693 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:45:52 BoogieIcfgContainer [2018-10-12 20:45:52,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-12 20:45:52,694 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-12 20:45:52,694 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-12 20:45:52,698 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-12 20:45:52,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:45:51" (1/2) ... [2018-10-12 20:45:52,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40795d5a and model type ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:45:52, skipping insertion in model container [2018-10-12 20:45:52,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:45:52" (2/2) ... [2018-10-12 20:45:52,702 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength_true-valid-memsafety.c_12.bpl [2018-10-12 20:45:52,712 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-12 20:45:52,721 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-12 20:45:52,740 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-12 20:45:52,770 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-12 20:45:52,771 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-12 20:45:52,771 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-12 20:45:52,771 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-12 20:45:52,771 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-12 20:45:52,772 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-12 20:45:52,772 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-12 20:45:52,772 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-12 20:45:52,772 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-12 20:45:52,791 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-10-12 20:45:52,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-12 20:45:52,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:52,803 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:52,805 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:52,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:52,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1642431773, now seen corresponding path program 1 times [2018-10-12 20:45:52,881 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:53,436 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-12 20:45:53,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-12 20:45:53,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-12 20:45:53,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-12 20:45:53,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-12 20:45:53,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-12 20:45:53,465 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 8 states. [2018-10-12 20:45:53,877 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-10-12 20:45:54,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:54,045 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2018-10-12 20:45:54,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-12 20:45:54,051 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-10-12 20:45:54,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:54,075 INFO L225 Difference]: With dead ends: 129 [2018-10-12 20:45:54,075 INFO L226 Difference]: Without dead ends: 129 [2018-10-12 20:45:54,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-10-12 20:45:54,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-12 20:45:54,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 91. [2018-10-12 20:45:54,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-12 20:45:54,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2018-10-12 20:45:54,125 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 36 [2018-10-12 20:45:54,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:54,125 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2018-10-12 20:45:54,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-12 20:45:54,126 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2018-10-12 20:45:54,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-12 20:45:54,128 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:54,130 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:54,131 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:54,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:54,131 INFO L82 PathProgramCache]: Analyzing trace with hash -2036500607, now seen corresponding path program 1 times [2018-10-12 20:45:54,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:54,354 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:45:54,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:54,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-12 20:45:54,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-12 20:45:54,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-12 20:45:54,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-12 20:45:54,358 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. Second operand 8 states. [2018-10-12 20:45:55,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:55,272 INFO L93 Difference]: Finished difference Result 159 states and 162 transitions. [2018-10-12 20:45:55,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-12 20:45:55,274 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2018-10-12 20:45:55,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:55,277 INFO L225 Difference]: With dead ends: 159 [2018-10-12 20:45:55,280 INFO L226 Difference]: Without dead ends: 159 [2018-10-12 20:45:55,282 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-10-12 20:45:55,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-12 20:45:55,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 110. [2018-10-12 20:45:55,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-12 20:45:55,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2018-10-12 20:45:55,295 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 62 [2018-10-12 20:45:55,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:55,295 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2018-10-12 20:45:55,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-12 20:45:55,296 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2018-10-12 20:45:55,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-12 20:45:55,298 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:55,298 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:55,299 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:55,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:55,299 INFO L82 PathProgramCache]: Analyzing trace with hash -195640530, now seen corresponding path program 1 times [2018-10-12 20:45:55,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:55,700 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-12 20:45:55,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:55,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-12 20:45:55,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-12 20:45:55,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-12 20:45:55,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-10-12 20:45:55,703 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 10 states. [2018-10-12 20:45:56,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:56,279 INFO L93 Difference]: Finished difference Result 170 states and 174 transitions. [2018-10-12 20:45:56,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-12 20:45:56,281 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2018-10-12 20:45:56,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:56,283 INFO L225 Difference]: With dead ends: 170 [2018-10-12 20:45:56,284 INFO L226 Difference]: Without dead ends: 170 [2018-10-12 20:45:56,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2018-10-12 20:45:56,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-12 20:45:56,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 132. [2018-10-12 20:45:56,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-12 20:45:56,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 135 transitions. [2018-10-12 20:45:56,298 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 135 transitions. Word has length 77 [2018-10-12 20:45:56,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:56,298 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 135 transitions. [2018-10-12 20:45:56,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-12 20:45:56,299 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 135 transitions. [2018-10-12 20:45:56,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-12 20:45:56,307 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:56,308 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:56,308 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:56,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:56,308 INFO L82 PathProgramCache]: Analyzing trace with hash -514873332, now seen corresponding path program 2 times [2018-10-12 20:45:56,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:56,524 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 17 proven. 47 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-12 20:45:56,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:56,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-12 20:45:56,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-12 20:45:56,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-12 20:45:56,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-12 20:45:56,527 INFO L87 Difference]: Start difference. First operand 132 states and 135 transitions. Second operand 10 states. [2018-10-12 20:45:56,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:56,902 INFO L93 Difference]: Finished difference Result 158 states and 161 transitions. [2018-10-12 20:45:56,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-12 20:45:56,903 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2018-10-12 20:45:56,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:56,906 INFO L225 Difference]: With dead ends: 158 [2018-10-12 20:45:56,906 INFO L226 Difference]: Without dead ends: 158 [2018-10-12 20:45:56,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-10-12 20:45:56,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-12 20:45:56,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 133. [2018-10-12 20:45:56,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-12 20:45:56,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2018-10-12 20:45:56,919 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 103 [2018-10-12 20:45:56,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:56,919 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2018-10-12 20:45:56,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-12 20:45:56,920 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2018-10-12 20:45:56,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-12 20:45:56,922 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:56,922 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:56,922 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:56,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:56,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1932659523, now seen corresponding path program 3 times [2018-10-12 20:45:56,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:56,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:57,214 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 17 proven. 65 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-12 20:45:57,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:57,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-12 20:45:57,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-12 20:45:57,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-12 20:45:57,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-12 20:45:57,216 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand 12 states. [2018-10-12 20:45:57,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:57,873 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2018-10-12 20:45:57,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-12 20:45:57,874 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 118 [2018-10-12 20:45:57,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:57,876 INFO L225 Difference]: With dead ends: 160 [2018-10-12 20:45:57,876 INFO L226 Difference]: Without dead ends: 160 [2018-10-12 20:45:57,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2018-10-12 20:45:57,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-12 20:45:57,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 148. [2018-10-12 20:45:57,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-12 20:45:57,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 151 transitions. [2018-10-12 20:45:57,895 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 151 transitions. Word has length 118 [2018-10-12 20:45:57,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:57,895 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 151 transitions. [2018-10-12 20:45:57,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-12 20:45:57,898 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 151 transitions. [2018-10-12 20:45:57,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-12 20:45:57,900 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:57,900 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:57,905 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:57,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:57,905 INFO L82 PathProgramCache]: Analyzing trace with hash -2144079060, now seen corresponding path program 4 times [2018-10-12 20:45:57,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:45:58,856 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-12 20:45:58,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:45:58,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-12 20:45:58,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-12 20:45:58,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-12 20:45:58,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-10-12 20:45:58,858 INFO L87 Difference]: Start difference. First operand 148 states and 151 transitions. Second operand 12 states. [2018-10-12 20:45:59,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:45:59,727 INFO L93 Difference]: Finished difference Result 258 states and 263 transitions. [2018-10-12 20:45:59,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-12 20:45:59,728 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 133 [2018-10-12 20:45:59,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:45:59,730 INFO L225 Difference]: With dead ends: 258 [2018-10-12 20:45:59,730 INFO L226 Difference]: Without dead ends: 258 [2018-10-12 20:45:59,730 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2018-10-12 20:45:59,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-10-12 20:45:59,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 204. [2018-10-12 20:45:59,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-10-12 20:45:59,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 208 transitions. [2018-10-12 20:45:59,741 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 208 transitions. Word has length 133 [2018-10-12 20:45:59,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:45:59,742 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 208 transitions. [2018-10-12 20:45:59,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-12 20:45:59,742 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 208 transitions. [2018-10-12 20:45:59,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-12 20:45:59,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:45:59,745 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:45:59,745 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:45:59,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:45:59,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1201213738, now seen corresponding path program 5 times [2018-10-12 20:45:59,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:45:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:00,155 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 86 proven. 198 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-12 20:46:00,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:00,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-12 20:46:00,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-12 20:46:00,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-12 20:46:00,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-12 20:46:00,158 INFO L87 Difference]: Start difference. First operand 204 states and 208 transitions. Second operand 16 states. [2018-10-12 20:46:00,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:00,991 INFO L93 Difference]: Finished difference Result 231 states and 235 transitions. [2018-10-12 20:46:00,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-12 20:46:00,992 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 189 [2018-10-12 20:46:00,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:00,994 INFO L225 Difference]: With dead ends: 231 [2018-10-12 20:46:00,994 INFO L226 Difference]: Without dead ends: 231 [2018-10-12 20:46:00,996 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=232, Invalid=958, Unknown=0, NotChecked=0, Total=1190 [2018-10-12 20:46:00,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-10-12 20:46:01,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 219. [2018-10-12 20:46:01,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-12 20:46:01,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 223 transitions. [2018-10-12 20:46:01,005 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 223 transitions. Word has length 189 [2018-10-12 20:46:01,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:01,005 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 223 transitions. [2018-10-12 20:46:01,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-12 20:46:01,005 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 223 transitions. [2018-10-12 20:46:01,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-12 20:46:01,009 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:01,009 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:46:01,009 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:01,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:01,010 INFO L82 PathProgramCache]: Analyzing trace with hash -723418523, now seen corresponding path program 6 times [2018-10-12 20:46:01,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:01,664 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 349 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-12 20:46:01,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:01,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-12 20:46:01,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-12 20:46:01,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-12 20:46:01,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-10-12 20:46:01,666 INFO L87 Difference]: Start difference. First operand 219 states and 223 transitions. Second operand 20 states. [2018-10-12 20:46:05,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:05,359 INFO L93 Difference]: Finished difference Result 461 states and 468 transitions. [2018-10-12 20:46:05,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-12 20:46:05,360 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 204 [2018-10-12 20:46:05,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:05,362 INFO L225 Difference]: With dead ends: 461 [2018-10-12 20:46:05,363 INFO L226 Difference]: Without dead ends: 460 [2018-10-12 20:46:05,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1311 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1079, Invalid=4033, Unknown=0, NotChecked=0, Total=5112 [2018-10-12 20:46:05,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-10-12 20:46:05,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 276. [2018-10-12 20:46:05,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-10-12 20:46:05,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 280 transitions. [2018-10-12 20:46:05,373 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 280 transitions. Word has length 204 [2018-10-12 20:46:05,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:05,374 INFO L481 AbstractCegarLoop]: Abstraction has 276 states and 280 transitions. [2018-10-12 20:46:05,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-12 20:46:05,374 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 280 transitions. [2018-10-12 20:46:05,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-10-12 20:46:05,379 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:05,379 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:46:05,380 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:05,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:05,380 INFO L82 PathProgramCache]: Analyzing trace with hash -113288948, now seen corresponding path program 7 times [2018-10-12 20:46:05,381 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:05,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:06,698 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 0 proven. 733 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-10-12 20:46:06,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:06,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-12 20:46:06,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-12 20:46:06,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-12 20:46:06,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2018-10-12 20:46:06,700 INFO L87 Difference]: Start difference. First operand 276 states and 280 transitions. Second operand 22 states. [2018-10-12 20:46:11,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:11,162 INFO L93 Difference]: Finished difference Result 531 states and 539 transitions. [2018-10-12 20:46:11,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-12 20:46:11,163 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 275 [2018-10-12 20:46:11,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:11,166 INFO L225 Difference]: With dead ends: 531 [2018-10-12 20:46:11,166 INFO L226 Difference]: Without dead ends: 531 [2018-10-12 20:46:11,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1988 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1421, Invalid=5719, Unknown=0, NotChecked=0, Total=7140 [2018-10-12 20:46:11,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-10-12 20:46:11,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 347. [2018-10-12 20:46:11,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-10-12 20:46:11,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 352 transitions. [2018-10-12 20:46:11,177 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 352 transitions. Word has length 275 [2018-10-12 20:46:11,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:11,178 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 352 transitions. [2018-10-12 20:46:11,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-12 20:46:11,178 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 352 transitions. [2018-10-12 20:46:11,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-10-12 20:46:11,180 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:11,180 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:46:11,181 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:11,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:11,181 INFO L82 PathProgramCache]: Analyzing trace with hash 2083569797, now seen corresponding path program 8 times [2018-10-12 20:46:11,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:12,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1412 backedges. 0 proven. 1284 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-10-12 20:46:12,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:12,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-12 20:46:12,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-12 20:46:12,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-12 20:46:12,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2018-10-12 20:46:12,162 INFO L87 Difference]: Start difference. First operand 347 states and 352 transitions. Second operand 24 states. [2018-10-12 20:46:12,421 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2018-10-12 20:46:16,397 WARN L178 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2018-10-12 20:46:17,936 WARN L178 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-10-12 20:46:18,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:18,882 INFO L93 Difference]: Finished difference Result 602 states and 611 transitions. [2018-10-12 20:46:18,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-12 20:46:18,882 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 346 [2018-10-12 20:46:18,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:18,887 INFO L225 Difference]: With dead ends: 602 [2018-10-12 20:46:18,887 INFO L226 Difference]: Without dead ends: 602 [2018-10-12 20:46:18,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2815 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1820, Invalid=7686, Unknown=0, NotChecked=0, Total=9506 [2018-10-12 20:46:18,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-10-12 20:46:18,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 418. [2018-10-12 20:46:18,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-10-12 20:46:18,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 424 transitions. [2018-10-12 20:46:18,901 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 424 transitions. Word has length 346 [2018-10-12 20:46:18,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:18,902 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 424 transitions. [2018-10-12 20:46:18,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-12 20:46:18,902 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 424 transitions. [2018-10-12 20:46:18,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2018-10-12 20:46:18,905 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:18,906 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:46:18,906 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:18,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:18,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1540032788, now seen corresponding path program 9 times [2018-10-12 20:46:18,907 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:20,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-10-12 20:46:20,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:20,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-12 20:46:20,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-12 20:46:20,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-12 20:46:20,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2018-10-12 20:46:20,012 INFO L87 Difference]: Start difference. First operand 418 states and 424 transitions. Second operand 26 states. [2018-10-12 20:46:21,920 WARN L178 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2018-10-12 20:46:27,215 WARN L178 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-10-12 20:46:27,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:27,670 INFO L93 Difference]: Finished difference Result 673 states and 683 transitions. [2018-10-12 20:46:27,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-12 20:46:27,670 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 417 [2018-10-12 20:46:27,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:27,674 INFO L225 Difference]: With dead ends: 673 [2018-10-12 20:46:27,674 INFO L226 Difference]: Without dead ends: 673 [2018-10-12 20:46:27,678 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3792 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=2276, Invalid=9934, Unknown=0, NotChecked=0, Total=12210 [2018-10-12 20:46:27,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-10-12 20:46:27,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 489. [2018-10-12 20:46:27,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2018-10-12 20:46:27,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 496 transitions. [2018-10-12 20:46:27,688 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 496 transitions. Word has length 417 [2018-10-12 20:46:27,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:27,689 INFO L481 AbstractCegarLoop]: Abstraction has 489 states and 496 transitions. [2018-10-12 20:46:27,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-12 20:46:27,689 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 496 transitions. [2018-10-12 20:46:27,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2018-10-12 20:46:27,691 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:27,692 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:46:27,692 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:27,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:27,693 INFO L82 PathProgramCache]: Analyzing trace with hash 2112276133, now seen corresponding path program 10 times [2018-10-12 20:46:27,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:27,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:29,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3111 backedges. 0 proven. 2887 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-10-12 20:46:29,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:29,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-12 20:46:29,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-12 20:46:29,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-12 20:46:29,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2018-10-12 20:46:29,128 INFO L87 Difference]: Start difference. First operand 489 states and 496 transitions. Second operand 28 states. [2018-10-12 20:46:36,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:36,929 INFO L93 Difference]: Finished difference Result 744 states and 755 transitions. [2018-10-12 20:46:36,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-10-12 20:46:36,929 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 488 [2018-10-12 20:46:36,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:36,933 INFO L225 Difference]: With dead ends: 744 [2018-10-12 20:46:36,933 INFO L226 Difference]: Without dead ends: 744 [2018-10-12 20:46:36,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4919 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=2789, Invalid=12463, Unknown=0, NotChecked=0, Total=15252 [2018-10-12 20:46:36,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2018-10-12 20:46:36,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 560. [2018-10-12 20:46:36,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2018-10-12 20:46:36,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 568 transitions. [2018-10-12 20:46:36,948 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 568 transitions. Word has length 488 [2018-10-12 20:46:36,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:36,949 INFO L481 AbstractCegarLoop]: Abstraction has 560 states and 568 transitions. [2018-10-12 20:46:36,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-12 20:46:36,949 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 568 transitions. [2018-10-12 20:46:36,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2018-10-12 20:46:36,953 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:36,953 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:46:36,954 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:36,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:36,954 INFO L82 PathProgramCache]: Analyzing trace with hash 592628940, now seen corresponding path program 11 times [2018-10-12 20:46:36,955 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:36,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:38,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4211 backedges. 0 proven. 3939 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-10-12 20:46:38,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:38,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-12 20:46:38,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-12 20:46:38,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-12 20:46:38,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2018-10-12 20:46:38,845 INFO L87 Difference]: Start difference. First operand 560 states and 568 transitions. Second operand 30 states. [2018-10-12 20:46:39,730 WARN L178 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2018-10-12 20:46:47,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:47,502 INFO L93 Difference]: Finished difference Result 815 states and 827 transitions. [2018-10-12 20:46:47,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-12 20:46:47,504 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 559 [2018-10-12 20:46:47,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:47,508 INFO L225 Difference]: With dead ends: 815 [2018-10-12 20:46:47,509 INFO L226 Difference]: Without dead ends: 815 [2018-10-12 20:46:47,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6196 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=3359, Invalid=15273, Unknown=0, NotChecked=0, Total=18632 [2018-10-12 20:46:47,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2018-10-12 20:46:47,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 631. [2018-10-12 20:46:47,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2018-10-12 20:46:47,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 640 transitions. [2018-10-12 20:46:47,525 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 640 transitions. Word has length 559 [2018-10-12 20:46:47,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:47,526 INFO L481 AbstractCegarLoop]: Abstraction has 631 states and 640 transitions. [2018-10-12 20:46:47,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-12 20:46:47,526 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 640 transitions. [2018-10-12 20:46:47,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2018-10-12 20:46:47,530 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:47,531 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:46:47,531 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:47,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:47,532 INFO L82 PathProgramCache]: Analyzing trace with hash -972712763, now seen corresponding path program 12 times [2018-10-12 20:46:47,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:46:49,601 INFO L134 CoverageAnalysis]: Checked inductivity of 5478 backedges. 0 proven. 5158 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-10-12 20:46:49,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:46:49,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-12 20:46:49,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-12 20:46:49,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-12 20:46:49,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=839, Unknown=0, NotChecked=0, Total=992 [2018-10-12 20:46:49,603 INFO L87 Difference]: Start difference. First operand 631 states and 640 transitions. Second operand 32 states. [2018-10-12 20:46:58,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:46:58,644 INFO L93 Difference]: Finished difference Result 886 states and 899 transitions. [2018-10-12 20:46:58,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-10-12 20:46:58,644 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 630 [2018-10-12 20:46:58,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:46:58,649 INFO L225 Difference]: With dead ends: 886 [2018-10-12 20:46:58,649 INFO L226 Difference]: Without dead ends: 886 [2018-10-12 20:46:58,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7623 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=3986, Invalid=18364, Unknown=0, NotChecked=0, Total=22350 [2018-10-12 20:46:58,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2018-10-12 20:46:58,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 702. [2018-10-12 20:46:58,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2018-10-12 20:46:58,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 712 transitions. [2018-10-12 20:46:58,663 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 712 transitions. Word has length 630 [2018-10-12 20:46:58,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:46:58,664 INFO L481 AbstractCegarLoop]: Abstraction has 702 states and 712 transitions. [2018-10-12 20:46:58,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-12 20:46:58,664 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 712 transitions. [2018-10-12 20:46:58,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 702 [2018-10-12 20:46:58,670 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:46:58,670 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:46:58,671 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:46:58,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:46:58,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1951849132, now seen corresponding path program 13 times [2018-10-12 20:46:58,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:46:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:47:00,816 INFO L134 CoverageAnalysis]: Checked inductivity of 6912 backedges. 0 proven. 6544 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2018-10-12 20:47:00,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:47:00,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-12 20:47:00,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-12 20:47:00,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-12 20:47:00,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=946, Unknown=0, NotChecked=0, Total=1122 [2018-10-12 20:47:00,818 INFO L87 Difference]: Start difference. First operand 702 states and 712 transitions. Second operand 34 states. [2018-10-12 20:47:10,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:47:10,934 INFO L93 Difference]: Finished difference Result 957 states and 971 transitions. [2018-10-12 20:47:10,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-10-12 20:47:10,934 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 701 [2018-10-12 20:47:10,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:47:10,939 INFO L225 Difference]: With dead ends: 957 [2018-10-12 20:47:10,939 INFO L226 Difference]: Without dead ends: 957 [2018-10-12 20:47:10,942 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9200 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=4670, Invalid=21736, Unknown=0, NotChecked=0, Total=26406 [2018-10-12 20:47:10,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2018-10-12 20:47:10,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 773. [2018-10-12 20:47:10,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2018-10-12 20:47:10,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 784 transitions. [2018-10-12 20:47:10,953 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 784 transitions. Word has length 701 [2018-10-12 20:47:10,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:47:10,955 INFO L481 AbstractCegarLoop]: Abstraction has 773 states and 784 transitions. [2018-10-12 20:47:10,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-12 20:47:10,955 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 784 transitions. [2018-10-12 20:47:10,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 773 [2018-10-12 20:47:10,961 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:47:10,961 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:47:10,962 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:47:10,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:47:10,962 INFO L82 PathProgramCache]: Analyzing trace with hash -183555355, now seen corresponding path program 14 times [2018-10-12 20:47:10,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:47:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:47:14,332 INFO L134 CoverageAnalysis]: Checked inductivity of 8513 backedges. 0 proven. 8097 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2018-10-12 20:47:14,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:47:14,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-12 20:47:14,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-12 20:47:14,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-12 20:47:14,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1059, Unknown=0, NotChecked=0, Total=1260 [2018-10-12 20:47:14,335 INFO L87 Difference]: Start difference. First operand 773 states and 784 transitions. Second operand 36 states. [2018-10-12 20:47:25,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:47:25,868 INFO L93 Difference]: Finished difference Result 1028 states and 1043 transitions. [2018-10-12 20:47:25,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-12 20:47:25,868 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 772 [2018-10-12 20:47:25,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:47:25,874 INFO L225 Difference]: With dead ends: 1028 [2018-10-12 20:47:25,874 INFO L226 Difference]: Without dead ends: 1028 [2018-10-12 20:47:25,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10927 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=5411, Invalid=25389, Unknown=0, NotChecked=0, Total=30800 [2018-10-12 20:47:25,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2018-10-12 20:47:25,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 844. [2018-10-12 20:47:25,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-10-12 20:47:25,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 856 transitions. [2018-10-12 20:47:25,891 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 856 transitions. Word has length 772 [2018-10-12 20:47:25,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:47:25,892 INFO L481 AbstractCegarLoop]: Abstraction has 844 states and 856 transitions. [2018-10-12 20:47:25,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-12 20:47:25,892 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 856 transitions. [2018-10-12 20:47:25,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 844 [2018-10-12 20:47:25,901 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:47:25,902 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:47:25,902 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:47:25,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:47:25,903 INFO L82 PathProgramCache]: Analyzing trace with hash -796974964, now seen corresponding path program 15 times [2018-10-12 20:47:25,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:47:25,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:47:29,012 INFO L134 CoverageAnalysis]: Checked inductivity of 10281 backedges. 0 proven. 9817 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2018-10-12 20:47:29,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:47:29,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-12 20:47:29,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-12 20:47:29,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-12 20:47:29,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1178, Unknown=0, NotChecked=0, Total=1406 [2018-10-12 20:47:29,014 INFO L87 Difference]: Start difference. First operand 844 states and 856 transitions. Second operand 38 states. [2018-10-12 20:47:41,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:47:41,352 INFO L93 Difference]: Finished difference Result 1099 states and 1115 transitions. [2018-10-12 20:47:41,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-10-12 20:47:41,352 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 843 [2018-10-12 20:47:41,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:47:41,357 INFO L225 Difference]: With dead ends: 1099 [2018-10-12 20:47:41,358 INFO L226 Difference]: Without dead ends: 1099 [2018-10-12 20:47:41,361 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12804 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=6209, Invalid=29323, Unknown=0, NotChecked=0, Total=35532 [2018-10-12 20:47:41,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2018-10-12 20:47:41,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 915. [2018-10-12 20:47:41,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2018-10-12 20:47:41,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 928 transitions. [2018-10-12 20:47:41,374 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 928 transitions. Word has length 843 [2018-10-12 20:47:41,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:47:41,375 INFO L481 AbstractCegarLoop]: Abstraction has 915 states and 928 transitions. [2018-10-12 20:47:41,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-12 20:47:41,375 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 928 transitions. [2018-10-12 20:47:41,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 915 [2018-10-12 20:47:41,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:47:41,384 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:47:41,384 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:47:41,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:47:41,384 INFO L82 PathProgramCache]: Analyzing trace with hash -2147120891, now seen corresponding path program 16 times [2018-10-12 20:47:41,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:47:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:47:44,738 INFO L134 CoverageAnalysis]: Checked inductivity of 12216 backedges. 0 proven. 11704 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-10-12 20:47:44,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:47:44,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-12 20:47:44,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-12 20:47:44,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-12 20:47:44,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1303, Unknown=0, NotChecked=0, Total=1560 [2018-10-12 20:47:44,740 INFO L87 Difference]: Start difference. First operand 915 states and 928 transitions. Second operand 40 states. [2018-10-12 20:47:54,551 WARN L178 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2018-10-12 20:47:59,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:47:59,319 INFO L93 Difference]: Finished difference Result 1170 states and 1187 transitions. [2018-10-12 20:47:59,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-10-12 20:47:59,319 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 914 [2018-10-12 20:47:59,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:47:59,323 INFO L225 Difference]: With dead ends: 1170 [2018-10-12 20:47:59,323 INFO L226 Difference]: Without dead ends: 1170 [2018-10-12 20:47:59,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14831 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=7064, Invalid=33538, Unknown=0, NotChecked=0, Total=40602 [2018-10-12 20:47:59,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2018-10-12 20:47:59,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 986. [2018-10-12 20:47:59,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-10-12 20:47:59,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1000 transitions. [2018-10-12 20:47:59,338 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1000 transitions. Word has length 914 [2018-10-12 20:47:59,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:47:59,339 INFO L481 AbstractCegarLoop]: Abstraction has 986 states and 1000 transitions. [2018-10-12 20:47:59,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-12 20:47:59,339 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1000 transitions. [2018-10-12 20:47:59,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 986 [2018-10-12 20:47:59,348 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:47:59,348 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:47:59,349 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:47:59,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:47:59,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1937138068, now seen corresponding path program 17 times [2018-10-12 20:47:59,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:47:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:48:03,279 INFO L134 CoverageAnalysis]: Checked inductivity of 14318 backedges. 0 proven. 13758 refuted. 0 times theorem prover too weak. 560 trivial. 0 not checked. [2018-10-12 20:48:03,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:48:03,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-12 20:48:03,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-12 20:48:03,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-12 20:48:03,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=1434, Unknown=0, NotChecked=0, Total=1722 [2018-10-12 20:48:03,281 INFO L87 Difference]: Start difference. First operand 986 states and 1000 transitions. Second operand 42 states. [2018-10-12 20:48:18,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:48:18,268 INFO L93 Difference]: Finished difference Result 1241 states and 1259 transitions. [2018-10-12 20:48:18,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-10-12 20:48:18,268 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 985 [2018-10-12 20:48:18,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:48:18,272 INFO L225 Difference]: With dead ends: 1241 [2018-10-12 20:48:18,272 INFO L226 Difference]: Without dead ends: 1241 [2018-10-12 20:48:18,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17008 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=7976, Invalid=38034, Unknown=0, NotChecked=0, Total=46010 [2018-10-12 20:48:18,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2018-10-12 20:48:18,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1057. [2018-10-12 20:48:18,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1057 states. [2018-10-12 20:48:18,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1072 transitions. [2018-10-12 20:48:18,289 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1072 transitions. Word has length 985 [2018-10-12 20:48:18,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:48:18,290 INFO L481 AbstractCegarLoop]: Abstraction has 1057 states and 1072 transitions. [2018-10-12 20:48:18,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-12 20:48:18,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1072 transitions. [2018-10-12 20:48:18,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1057 [2018-10-12 20:48:18,300 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:48:18,300 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:48:18,301 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:48:18,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:48:18,301 INFO L82 PathProgramCache]: Analyzing trace with hash -798314715, now seen corresponding path program 18 times [2018-10-12 20:48:18,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:48:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:48:23,439 INFO L134 CoverageAnalysis]: Checked inductivity of 16587 backedges. 0 proven. 15979 refuted. 0 times theorem prover too weak. 608 trivial. 0 not checked. [2018-10-12 20:48:23,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:48:23,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-12 20:48:23,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-12 20:48:23,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-12 20:48:23,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=1571, Unknown=0, NotChecked=0, Total=1892 [2018-10-12 20:48:23,441 INFO L87 Difference]: Start difference. First operand 1057 states and 1072 transitions. Second operand 44 states. [2018-10-12 20:48:38,413 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2018-10-12 20:48:39,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:48:39,687 INFO L93 Difference]: Finished difference Result 1312 states and 1331 transitions. [2018-10-12 20:48:39,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2018-10-12 20:48:39,688 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 1056 [2018-10-12 20:48:39,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:48:39,692 INFO L225 Difference]: With dead ends: 1312 [2018-10-12 20:48:39,692 INFO L226 Difference]: Without dead ends: 1312 [2018-10-12 20:48:39,693 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19335 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=8945, Invalid=42811, Unknown=0, NotChecked=0, Total=51756 [2018-10-12 20:48:39,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2018-10-12 20:48:39,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1128. [2018-10-12 20:48:39,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1128 states. [2018-10-12 20:48:39,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1144 transitions. [2018-10-12 20:48:39,706 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1144 transitions. Word has length 1056 [2018-10-12 20:48:39,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:48:39,707 INFO L481 AbstractCegarLoop]: Abstraction has 1128 states and 1144 transitions. [2018-10-12 20:48:39,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-12 20:48:39,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1144 transitions. [2018-10-12 20:48:39,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1128 [2018-10-12 20:48:39,718 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:48:39,719 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:48:39,719 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:48:39,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:48:39,720 INFO L82 PathProgramCache]: Analyzing trace with hash -122399668, now seen corresponding path program 19 times [2018-10-12 20:48:39,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:48:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:48:45,588 INFO L134 CoverageAnalysis]: Checked inductivity of 19023 backedges. 0 proven. 18367 refuted. 0 times theorem prover too weak. 656 trivial. 0 not checked. [2018-10-12 20:48:45,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:48:45,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-12 20:48:45,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-12 20:48:45,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-12 20:48:45,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=1714, Unknown=0, NotChecked=0, Total=2070 [2018-10-12 20:48:45,590 INFO L87 Difference]: Start difference. First operand 1128 states and 1144 transitions. Second operand 46 states. [2018-10-12 20:48:57,765 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2018-10-12 20:49:03,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:49:03,720 INFO L93 Difference]: Finished difference Result 1383 states and 1403 transitions. [2018-10-12 20:49:03,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-10-12 20:49:03,720 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 1127 [2018-10-12 20:49:03,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:49:03,724 INFO L225 Difference]: With dead ends: 1383 [2018-10-12 20:49:03,725 INFO L226 Difference]: Without dead ends: 1383 [2018-10-12 20:49:03,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21812 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=9971, Invalid=47869, Unknown=0, NotChecked=0, Total=57840 [2018-10-12 20:49:03,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2018-10-12 20:49:03,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1199. [2018-10-12 20:49:03,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1199 states. [2018-10-12 20:49:03,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1216 transitions. [2018-10-12 20:49:03,741 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1216 transitions. Word has length 1127 [2018-10-12 20:49:03,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:49:03,742 INFO L481 AbstractCegarLoop]: Abstraction has 1199 states and 1216 transitions. [2018-10-12 20:49:03,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-12 20:49:03,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1216 transitions. [2018-10-12 20:49:03,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1199 [2018-10-12 20:49:03,754 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:49:03,755 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:49:03,755 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:49:03,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:49:03,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1681956165, now seen corresponding path program 20 times [2018-10-12 20:49:03,757 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:49:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:49:08,941 INFO L134 CoverageAnalysis]: Checked inductivity of 21626 backedges. 0 proven. 20922 refuted. 0 times theorem prover too weak. 704 trivial. 0 not checked. [2018-10-12 20:49:08,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:49:08,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-12 20:49:08,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-12 20:49:08,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-12 20:49:08,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=393, Invalid=1863, Unknown=0, NotChecked=0, Total=2256 [2018-10-12 20:49:08,944 INFO L87 Difference]: Start difference. First operand 1199 states and 1216 transitions. Second operand 48 states. [2018-10-12 20:49:27,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:49:27,665 INFO L93 Difference]: Finished difference Result 1454 states and 1475 transitions. [2018-10-12 20:49:27,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-10-12 20:49:27,667 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 1198 [2018-10-12 20:49:27,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:49:27,673 INFO L225 Difference]: With dead ends: 1454 [2018-10-12 20:49:27,673 INFO L226 Difference]: Without dead ends: 1454 [2018-10-12 20:49:27,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24439 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=11054, Invalid=53208, Unknown=0, NotChecked=0, Total=64262 [2018-10-12 20:49:27,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2018-10-12 20:49:27,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1270. [2018-10-12 20:49:27,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1270 states. [2018-10-12 20:49:27,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1288 transitions. [2018-10-12 20:49:27,692 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1288 transitions. Word has length 1198 [2018-10-12 20:49:27,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:49:27,692 INFO L481 AbstractCegarLoop]: Abstraction has 1270 states and 1288 transitions. [2018-10-12 20:49:27,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-12 20:49:27,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1288 transitions. [2018-10-12 20:49:27,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1270 [2018-10-12 20:49:27,707 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:49:27,707 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:49:27,708 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:49:27,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:49:27,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1086145068, now seen corresponding path program 21 times [2018-10-12 20:49:27,709 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:49:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:49:33,397 INFO L134 CoverageAnalysis]: Checked inductivity of 24396 backedges. 0 proven. 23644 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked. [2018-10-12 20:49:33,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:49:33,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-12 20:49:33,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-12 20:49:33,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-12 20:49:33,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=432, Invalid=2018, Unknown=0, NotChecked=0, Total=2450 [2018-10-12 20:49:33,399 INFO L87 Difference]: Start difference. First operand 1270 states and 1288 transitions. Second operand 50 states. [2018-10-12 20:49:54,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:49:54,202 INFO L93 Difference]: Finished difference Result 1525 states and 1547 transitions. [2018-10-12 20:49:54,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2018-10-12 20:49:54,203 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 1269 [2018-10-12 20:49:54,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:49:54,207 INFO L225 Difference]: With dead ends: 1525 [2018-10-12 20:49:54,208 INFO L226 Difference]: Without dead ends: 1525 [2018-10-12 20:49:54,210 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27216 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=12194, Invalid=58828, Unknown=0, NotChecked=0, Total=71022 [2018-10-12 20:49:54,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2018-10-12 20:49:54,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1341. [2018-10-12 20:49:54,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2018-10-12 20:49:54,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1360 transitions. [2018-10-12 20:49:54,225 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1360 transitions. Word has length 1269 [2018-10-12 20:49:54,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:49:54,226 INFO L481 AbstractCegarLoop]: Abstraction has 1341 states and 1360 transitions. [2018-10-12 20:49:54,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-12 20:49:54,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1360 transitions. [2018-10-12 20:49:54,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1341 [2018-10-12 20:49:54,241 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:49:54,242 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:49:54,242 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:49:54,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:49:54,243 INFO L82 PathProgramCache]: Analyzing trace with hash -301378715, now seen corresponding path program 22 times [2018-10-12 20:49:54,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:49:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:50:00,745 INFO L134 CoverageAnalysis]: Checked inductivity of 27333 backedges. 0 proven. 26533 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2018-10-12 20:50:00,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:50:00,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-12 20:50:00,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-12 20:50:00,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-12 20:50:00,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=473, Invalid=2179, Unknown=0, NotChecked=0, Total=2652 [2018-10-12 20:50:00,748 INFO L87 Difference]: Start difference. First operand 1341 states and 1360 transitions. Second operand 52 states. [2018-10-12 20:50:23,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:50:23,139 INFO L93 Difference]: Finished difference Result 1596 states and 1619 transitions. [2018-10-12 20:50:23,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 232 states. [2018-10-12 20:50:23,139 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 1340 [2018-10-12 20:50:23,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:50:23,144 INFO L225 Difference]: With dead ends: 1596 [2018-10-12 20:50:23,145 INFO L226 Difference]: Without dead ends: 1596 [2018-10-12 20:50:23,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30143 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=13391, Invalid=64729, Unknown=0, NotChecked=0, Total=78120 [2018-10-12 20:50:23,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2018-10-12 20:50:23,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1412. [2018-10-12 20:50:23,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2018-10-12 20:50:23,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 1432 transitions. [2018-10-12 20:50:23,161 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 1432 transitions. Word has length 1340 [2018-10-12 20:50:23,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:50:23,162 INFO L481 AbstractCegarLoop]: Abstraction has 1412 states and 1432 transitions. [2018-10-12 20:50:23,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-12 20:50:23,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 1432 transitions. [2018-10-12 20:50:23,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1412 [2018-10-12 20:50:23,180 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:50:23,181 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:50:23,181 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:50:23,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:50:23,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1273128972, now seen corresponding path program 23 times [2018-10-12 20:50:23,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:50:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:50:24,595 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-12 20:50:30,838 INFO L134 CoverageAnalysis]: Checked inductivity of 30437 backedges. 0 proven. 29589 refuted. 0 times theorem prover too weak. 848 trivial. 0 not checked. [2018-10-12 20:50:30,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:50:30,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-12 20:50:30,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-12 20:50:30,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-12 20:50:30,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=516, Invalid=2346, Unknown=0, NotChecked=0, Total=2862 [2018-10-12 20:50:30,840 INFO L87 Difference]: Start difference. First operand 1412 states and 1432 transitions. Second operand 54 states. [2018-10-12 20:50:47,646 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2018-10-12 20:50:54,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:50:54,415 INFO L93 Difference]: Finished difference Result 1667 states and 1691 transitions. [2018-10-12 20:50:54,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 243 states. [2018-10-12 20:50:54,415 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 1411 [2018-10-12 20:50:54,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:50:54,420 INFO L225 Difference]: With dead ends: 1667 [2018-10-12 20:50:54,420 INFO L226 Difference]: Without dead ends: 1667 [2018-10-12 20:50:54,423 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33220 ImplicationChecksByTransitivity, 23.2s TimeCoverageRelationStatistics Valid=14645, Invalid=70911, Unknown=0, NotChecked=0, Total=85556 [2018-10-12 20:50:54,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2018-10-12 20:50:54,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1483. [2018-10-12 20:50:54,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1483 states. [2018-10-12 20:50:54,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1483 states and 1504 transitions. [2018-10-12 20:50:54,435 INFO L78 Accepts]: Start accepts. Automaton has 1483 states and 1504 transitions. Word has length 1411 [2018-10-12 20:50:54,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:50:54,436 INFO L481 AbstractCegarLoop]: Abstraction has 1483 states and 1504 transitions. [2018-10-12 20:50:54,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-12 20:50:54,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 1504 transitions. [2018-10-12 20:50:54,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1483 [2018-10-12 20:50:54,454 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:50:54,455 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:50:54,455 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:50:54,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:50:54,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1959186821, now seen corresponding path program 24 times [2018-10-12 20:50:54,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:50:54,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:51:02,196 INFO L134 CoverageAnalysis]: Checked inductivity of 33708 backedges. 0 proven. 32812 refuted. 0 times theorem prover too weak. 896 trivial. 0 not checked. [2018-10-12 20:51:02,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:51:02,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-12 20:51:02,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-12 20:51:02,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-12 20:51:02,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=2519, Unknown=0, NotChecked=0, Total=3080 [2018-10-12 20:51:02,199 INFO L87 Difference]: Start difference. First operand 1483 states and 1504 transitions. Second operand 56 states. [2018-10-12 20:51:27,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:51:27,801 INFO L93 Difference]: Finished difference Result 1738 states and 1763 transitions. [2018-10-12 20:51:27,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 254 states. [2018-10-12 20:51:27,801 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 1482 [2018-10-12 20:51:27,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:51:27,808 INFO L225 Difference]: With dead ends: 1738 [2018-10-12 20:51:27,808 INFO L226 Difference]: Without dead ends: 1738 [2018-10-12 20:51:27,814 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36447 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=15956, Invalid=77374, Unknown=0, NotChecked=0, Total=93330 [2018-10-12 20:51:27,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2018-10-12 20:51:27,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1554. [2018-10-12 20:51:27,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1554 states. [2018-10-12 20:51:27,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 1576 transitions. [2018-10-12 20:51:27,827 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 1576 transitions. Word has length 1482 [2018-10-12 20:51:27,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:51:27,828 INFO L481 AbstractCegarLoop]: Abstraction has 1554 states and 1576 transitions. [2018-10-12 20:51:27,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-12 20:51:27,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 1576 transitions. [2018-10-12 20:51:27,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1554 [2018-10-12 20:51:27,849 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:51:27,850 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:51:27,850 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:51:27,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:51:27,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1662925332, now seen corresponding path program 25 times [2018-10-12 20:51:27,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:51:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:51:35,875 INFO L134 CoverageAnalysis]: Checked inductivity of 37146 backedges. 0 proven. 36202 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2018-10-12 20:51:35,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:51:35,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-12 20:51:35,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-12 20:51:35,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-12 20:51:35,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=608, Invalid=2698, Unknown=0, NotChecked=0, Total=3306 [2018-10-12 20:51:35,877 INFO L87 Difference]: Start difference. First operand 1554 states and 1576 transitions. Second operand 58 states. [2018-10-12 20:52:03,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:52:03,377 INFO L93 Difference]: Finished difference Result 1809 states and 1835 transitions. [2018-10-12 20:52:03,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 265 states. [2018-10-12 20:52:03,377 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 1553 [2018-10-12 20:52:03,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:52:03,383 INFO L225 Difference]: With dead ends: 1809 [2018-10-12 20:52:03,383 INFO L226 Difference]: Without dead ends: 1809 [2018-10-12 20:52:03,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 317 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39824 ImplicationChecksByTransitivity, 25.6s TimeCoverageRelationStatistics Valid=17324, Invalid=84118, Unknown=0, NotChecked=0, Total=101442 [2018-10-12 20:52:03,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2018-10-12 20:52:03,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1625. [2018-10-12 20:52:03,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1625 states. [2018-10-12 20:52:03,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 1648 transitions. [2018-10-12 20:52:03,400 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 1648 transitions. Word has length 1553 [2018-10-12 20:52:03,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:52:03,401 INFO L481 AbstractCegarLoop]: Abstraction has 1625 states and 1648 transitions. [2018-10-12 20:52:03,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-12 20:52:03,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 1648 transitions. [2018-10-12 20:52:03,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1625 [2018-10-12 20:52:03,421 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:52:03,422 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:52:03,422 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:52:03,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:52:03,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1945835429, now seen corresponding path program 26 times [2018-10-12 20:52:03,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:52:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:52:11,924 INFO L134 CoverageAnalysis]: Checked inductivity of 40751 backedges. 0 proven. 39759 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-10-12 20:52:11,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:52:11,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-12 20:52:11,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-12 20:52:11,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-12 20:52:11,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=657, Invalid=2883, Unknown=0, NotChecked=0, Total=3540 [2018-10-12 20:52:11,926 INFO L87 Difference]: Start difference. First operand 1625 states and 1648 transitions. Second operand 60 states. [2018-10-12 20:52:19,560 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2018-10-12 20:52:41,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:52:41,153 INFO L93 Difference]: Finished difference Result 1880 states and 1907 transitions. [2018-10-12 20:52:41,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 276 states. [2018-10-12 20:52:41,153 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 1624 [2018-10-12 20:52:41,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:52:41,159 INFO L225 Difference]: With dead ends: 1880 [2018-10-12 20:52:41,159 INFO L226 Difference]: Without dead ends: 1880 [2018-10-12 20:52:41,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 330 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43351 ImplicationChecksByTransitivity, 27.1s TimeCoverageRelationStatistics Valid=18749, Invalid=91143, Unknown=0, NotChecked=0, Total=109892 [2018-10-12 20:52:41,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2018-10-12 20:52:41,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1696. [2018-10-12 20:52:41,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1696 states. [2018-10-12 20:52:41,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 1720 transitions. [2018-10-12 20:52:41,174 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 1720 transitions. Word has length 1624 [2018-10-12 20:52:41,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:52:41,175 INFO L481 AbstractCegarLoop]: Abstraction has 1696 states and 1720 transitions. [2018-10-12 20:52:41,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-12 20:52:41,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 1720 transitions. [2018-10-12 20:52:41,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1696 [2018-10-12 20:52:41,192 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:52:41,193 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:52:41,193 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:52:41,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:52:41,194 INFO L82 PathProgramCache]: Analyzing trace with hash 838425548, now seen corresponding path program 27 times [2018-10-12 20:52:41,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:52:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:52:50,889 INFO L134 CoverageAnalysis]: Checked inductivity of 44523 backedges. 0 proven. 43483 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2018-10-12 20:52:50,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:52:50,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-12 20:52:50,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-12 20:52:50,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-12 20:52:50,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=708, Invalid=3074, Unknown=0, NotChecked=0, Total=3782 [2018-10-12 20:52:50,891 INFO L87 Difference]: Start difference. First operand 1696 states and 1720 transitions. Second operand 62 states. [2018-10-12 20:53:18,353 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2018-10-12 20:53:20,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:53:20,772 INFO L93 Difference]: Finished difference Result 1951 states and 1979 transitions. [2018-10-12 20:53:20,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 287 states. [2018-10-12 20:53:20,772 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 1695 [2018-10-12 20:53:20,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:53:20,778 INFO L225 Difference]: With dead ends: 1951 [2018-10-12 20:53:20,778 INFO L226 Difference]: Without dead ends: 1951 [2018-10-12 20:53:20,782 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 343 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47028 ImplicationChecksByTransitivity, 29.4s TimeCoverageRelationStatistics Valid=20231, Invalid=98449, Unknown=0, NotChecked=0, Total=118680 [2018-10-12 20:53:20,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1951 states. [2018-10-12 20:53:20,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1951 to 1767. [2018-10-12 20:53:20,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1767 states. [2018-10-12 20:53:20,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 1792 transitions. [2018-10-12 20:53:20,794 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 1792 transitions. Word has length 1695 [2018-10-12 20:53:20,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:53:20,795 INFO L481 AbstractCegarLoop]: Abstraction has 1767 states and 1792 transitions. [2018-10-12 20:53:20,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-12 20:53:20,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 1792 transitions. [2018-10-12 20:53:20,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1767 [2018-10-12 20:53:20,813 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:53:20,814 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:53:20,814 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:53:20,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:53:20,815 INFO L82 PathProgramCache]: Analyzing trace with hash -72866363, now seen corresponding path program 28 times [2018-10-12 20:53:20,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:53:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:53:30,614 INFO L134 CoverageAnalysis]: Checked inductivity of 48462 backedges. 0 proven. 47374 refuted. 0 times theorem prover too weak. 1088 trivial. 0 not checked. [2018-10-12 20:53:30,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:53:30,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-12 20:53:30,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-12 20:53:30,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-12 20:53:30,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=761, Invalid=3271, Unknown=0, NotChecked=0, Total=4032 [2018-10-12 20:53:30,616 INFO L87 Difference]: Start difference. First operand 1767 states and 1792 transitions. Second operand 64 states. [2018-10-12 20:54:02,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:54:02,155 INFO L93 Difference]: Finished difference Result 2022 states and 2051 transitions. [2018-10-12 20:54:02,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 298 states. [2018-10-12 20:54:02,155 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 1766 [2018-10-12 20:54:02,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:54:02,161 INFO L225 Difference]: With dead ends: 2022 [2018-10-12 20:54:02,161 INFO L226 Difference]: Without dead ends: 2022 [2018-10-12 20:54:02,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 356 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50855 ImplicationChecksByTransitivity, 30.7s TimeCoverageRelationStatistics Valid=21770, Invalid=106036, Unknown=0, NotChecked=0, Total=127806 [2018-10-12 20:54:02,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states. [2018-10-12 20:54:02,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 1838. [2018-10-12 20:54:02,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2018-10-12 20:54:02,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1864 transitions. [2018-10-12 20:54:02,179 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1864 transitions. Word has length 1766 [2018-10-12 20:54:02,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:54:02,180 INFO L481 AbstractCegarLoop]: Abstraction has 1838 states and 1864 transitions. [2018-10-12 20:54:02,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-12 20:54:02,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1864 transitions. [2018-10-12 20:54:02,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1838 [2018-10-12 20:54:02,206 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:54:02,207 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:54:02,207 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:54:02,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:54:02,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1692871084, now seen corresponding path program 29 times [2018-10-12 20:54:02,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:54:02,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:54:13,429 INFO L134 CoverageAnalysis]: Checked inductivity of 52568 backedges. 0 proven. 51432 refuted. 0 times theorem prover too weak. 1136 trivial. 0 not checked. [2018-10-12 20:54:13,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:54:13,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-12 20:54:13,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-12 20:54:13,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-12 20:54:13,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=816, Invalid=3474, Unknown=0, NotChecked=0, Total=4290 [2018-10-12 20:54:13,431 INFO L87 Difference]: Start difference. First operand 1838 states and 1864 transitions. Second operand 66 states.